6.2 Properties of Sets In this section we show how to establish basic set properties using element arguments, and we discuss a variation used to prove that a set is empty. In the next section we will show how to disprove a proposed set property by constructing a counterexample and how to use an algebraic technique to derive new set properties from set properties already known to be true. ‘We begin by listing some set properties that involve subset relations. ‘Theorem 6.2.1 Some Subset Relations 1, Inclusion af Imersection: For all sets A and By WM ANBCA and (ANBCB. : For all yets A and B. (AS AUB and (by BCAUB. ‘or all vets A, Band C, if AC Band BCC, then ACC. 2. Inclusion in Unio 3. Transitive Property of Subyets: The conclusion of each part of Theorem 6.2.1 states that one set X is a subset of Y,and so to Shou theixdeenalemenenre of the definitions of the other set operations are summarized bel In aur PPO; of Set Definitions Let X and ¥ be subsets of a universal yet U and suppose candy ane elements of LweXu¥ © xeNorreY 2eXOP @ ceXandyeY RxeX-¥ @ veXandy¢y Avex @ VEX S. @.yEXxY @ veXandyeYExample 1: Prove Theorem 6.2.1(1)(a): For all sets A and B, An BSA. Prot ‘Suppose A and B are any sets and suppose xis any element of An B. In particular, xe A. ANBSA. aed ‘The first important thing to realize is that the statement to be proved is universal (it says that for all sets A and B, AN BSA. ‘The proof, therefore, has the following outtine: ‘Starting Point: Suppose A and B are any (particular but arbitrarily chosen) sets. Show: An BSA. Now to prove that A n BSA, you must show that. Vx,if x € A B,then x € A (which Is a universal statement). So, to prove it you suppose xis an element of 4 n B and then you ‘show that x is an element of A. By following the procedural version of set definitions, this is pretty straight forward. Note that this argument is just a special ca valid argument form: 2. The following are two proofs that for all sets A and B, A- BS A. The first is less formal, and the second is more formal. Fill in the blanks. 1a, Proof: Suppose A and B are any sets. To show that A - B & A, we must show that every element in isin__A__. Butanyelement in A-Bisin__\ and notin (by definition of A ~ B). In particular, such an element isin A. b. Proof: Suppose A and B are any sets and x < A - B. [We must show that__X Morgan’ Laws: For all sets A and B. ()(A BY = ACHBE and (6) (A BY = ACU BE or Ran 10, Absorption Laws: For all sets A and B. ()AU(ANB=A and 0b) ATAU B)= 11, Complements of U and aU =0 and ib =U. jet Difference Law: For all sets A and B. A-B Proving Set Identities wom = (@ | iD method derived from this fact is the most basic way to prove equality of sets. Basie Method for Praving That Sets Ave Rqual Let sety X and ¥ be given. To prove that X= ¥: 1, Prove that X ¢Y 2 Prove that YX. Proving Set identities ‘Suppose A and B are arbitrarily chosen sets. ‘Theorem 6.2.2(3){a) A Distributive Law for Sets For all sets A, B. and C, AU(BO p27? SIA UBIMAUE), Theorem 6.2.2(9)(a) A De Morgan's Law for Sets Forall sets A and B,(AU BY = AYO BY pare‘The set property given in the next theorem says that if one set is a subset of another, then their intersection is the smaller ofthe two sets and their union is the larger of the two sats. | ‘Theorem 6.2.3 Intersection and Union with a Subset | Forany sets A and B.if A © B.then wWAQB=A and (b)AUB = B. |S eee | We rad fo Sho: D (ansye Aus Use an element argument to prove: eae ie 7. Forall sets A and B, (An B)° = A° U BE ark 2) KUB < (AaB) } : Bal: Shao CanBYS actus (med to shawn Yoet iF x «Caney her xe CAnBy Hien xe ADB). Cortes x 36 oO patter, but acbitnelly chen then xP ANB Coy duh. of cormmpleneat) OES also, “then xf A or “x¢gB,t xen, then xEAY, by Coy def, of intersection) del. of complewerk Thar x& ATU 8 Choy doh of union). VEX PB , than KREBS Loy Art of complemas), Ther XE AS OBE Wy Bee oh ron. Se, CANOES Ao ye Past 2i Shoo AO UBS (Andy. . Lup xe AT UBC prnttallon parbbeaily eaten + Tuer KEM or xe BR é Uf xe At yh EX, Thus reams XL RAB (ay dt Ca Ee OE Ce congonast Tew) Bury Hew x © CANBY by S46 of complnant anh ASuRme Cangys Cae 2) 12 EBT, Han x eB (by Af AQ comput). Also, xZ ANB (sha x«~B) by doh A intersection, one , LE CANBY vy dal. A Complemert. Soy AUBECANS TheEmpty set Buk, o (Ai - 8) CD ee)- BS. 2) Ned we Week to prove: (6 A= BE D care BY i het xe COR J = 8, By Aabh ot Akeancs , Ke Gat aed KYB. By Aafiniton of unter , gine xe Q py , tee 2 ant Citien, ieZ) mL Suh Het xefy, Alo, X¥B, S Sach that x € Ai-B By © Yao 4 on Coy Ae4 Atlecene), of urion, xe b CaL-B) , Here, Cos)- Be BF CAi-8) by. def of subset, Sine DB cai- 8) < Cad Band CG ay € UGCA BY, tHe sete one ey x equa Ore =(B, Ae) -B 3 Cee he,