| Line 5: | Line 5: | ||
== Theorem == | == Theorem == | ||
| − | Let <math>A</math> and <math>B<math> be sets. Then <br/> | + | Let <math>A</math> and <math>B</math> be sets. Then <br/> |
| − | '''(a)''' (A ∩ B) ⊂ A | + | '''(a)''' (A ∩ B) ⊂ A <br/> |
'''(b)''' A ⊂ (A ∪ B) | '''(b)''' A ⊂ (A ∪ B) | ||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 11:19, 1 October 2013
Theorem
Let $ A $ and $ B $ be sets. Then
(a) (A ∩ B) ⊂ A
(b) A ⊂ (A ∪ B)
Proof
(a) let x ∈ (A ∩ B) ⇔ x ∈ A and x ∈ B ⇒ x ∈ A ⇒ (A ∩ B) ⊂ A.
(b) let x ∈ A. Then it is true that x is either in A or in B ⇔ x ∈ (A ∪ B) ⇒ A ⊂ (A ∪ B).
$ \blacksquare $
References
- B. Ikenaga, "Set Algebra and Proofs Involving Sets" March 1st, 2008, [October 1st, 2013]
