Why does A ⊆ C follow from A ⊆ B ∪ C and A ∩ B = ∅?

  • Thread starter j9mom
  • Start date
  • Tags Tags
    Set
3 replies · 4K views · last reply
j9mom
Messages
31
Reaction score
0

Homework Statement



I am very confused on how to prove these set theories. The statements seem to prove themselves just by the definitions of the symbols. For example:

If A is contained or equal to B union C and A intersect B = {} (the empty set) then A is contained or equal to C.


The Attempt at a Solution


What I have is:

Assume that A is contained in or equal to B union C. So, any element X that is in A will also be in either B or C. However, we also assume that A n B is the empty set, there is not element in B that is in A. Hence, any X must be contained in C. Therefore A is contained in or equal to C.

This seems too easy... What am I assuming that i need to prove?
 
It may seem too easy. But that is pretty much the whole proof. Well done. Easy theorems deserve easy proofs.
 
Generally, speaking, for sets, A, B, you prove "A = B" by proving "A is a subset of B" and "B is a subset of A".

And you prove "A is a subset of B" by starting "if x is in A" and using the definitions of A and B to conclude "x is in B".