Python

Prove each of the remaining iden- tities in table 4.1 using an element argument. Table 4.1. Set Identities Here S,T,W are any sets; is the empy set; and U is the universal set. Identity Su = S SOU= S Domination Sn= SUU = U Idempotent Laws SUS=S SS=S Double Complement (S) = S Complement SS= SUS=U Commutative Law SUT = TUS ST=TS Associative Law Su(TUW) = (SUT) UW Sn(TAW) = (SAT) W De Morgan's Law SnT= SUT SUT=ST Absorption Su ( ST) = S S n (S UT) = S Distributive Law Su (TnW) = (SUT) n (S UW) Sn (TUW) = (S nT) u ( SW)