Logical Proofs Regarding Sets and Subsets

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
2 replies · 2K views
enkrypt0r
Messages
10
Reaction score
0

Homework Statement



The following is all the information needed:

07rEA.png


Homework Equations



There are, of course, all the basic rules of logic and set identities to be considered.

The Attempt at a Solution



Not really sure how to attempt this one, to be honest. I know that (A ⊆ B) can be written with a quantifier and is equivalent to ∀x[xϵA ⇒ xϵB] but I'm really not sure how to apply this information properly.

Thanks, guys. :)
 
Physics news on Phys.org
If A is a subset of B, then we know that any element of A is also an element of B.

Now, what if we take an element of U, that is not an element of B. What does that mean? Could such an element be an element of A?
 
In general you prove set X is a subset of set Y by starting "if x is a member of X" and then using the definitions of X and Y, and any other information you are given, to conclude "x is a member of Y".

To prove [itex]\overline{B}\subset\overline{A}[/itex] start with "if x is a member of [itex]\overline{B}[/itex] then x is not in B. Since, by hypothesis, [itex]A\subset B[/itex] x is not in A. ...