Subset Relations

Theorem 5.2.1 Some Subset Relations

  1. Inclusion of intersection: For all sets A and B,
    (a) A Ç B Í A and (b) A Ç B Í B.
  2. Inclusion in Union: For all sets A and B,
    (a) A Í A È B and (b) B Í A È B.
  3. Transitive Property of Subsets: For all sets A, B, and C,
    if A Í B and B Í C, then A Í C.

The conclusion of each part of Theorem 5.2.1 states that one set is a subset of another.

Basic (Element) Method for Proving That One Set Is a Subset of Another
Let sets X and Y be given. To prove X Í Y,

  1. suppose that x is a particular but arbitrarily chosen element of X,
  2. show that x is an element of Y.

Examples: Prove Theorem 5.2.1 1.(b) and 2.(a)
1.(b) A Ç B Í B
Proof: Let x Î A Ç B, then x Î A Ù x Î B. In particular, x Î B. So A Ç B Í B.
2. (a) A Í A È B
Proof: Let x Î A. Now A È B = {x | x Î A Ú x Î B}. Since x Î A, we have x Î A È B. So A Í A È B.

Try it, complete this element proof.

Review Set Identities Theorem 5.2.2

Example: Prove the Absorption Law
Proof: Let sets A and B be given, then

A È (A Ç B) =

(A Ç U) È (A Ç B), intersection with union, identity

=

A Ç (U È B), distributive

=

A Ç U, intersection with U, universal bounds

=

A, intersection with union, identity

Example 5.2.5: Prove " sets A, B, C

(A È B) - C = (A - C) È (B - C).

(A È B) - C =

(A È B) Ç Cc , alternate representation of set difference

=

Cc Ç (A È B), commutative

=

(Cc Ç A) È (Cc Ç B) , distributive

=

(A Ç Cc) È (B Ç Cc), commutative

=

(A - C) È (B - C), alternate representation of set difference