[The following setalgebra laws are “borrowed”, in the great tradition of the internet, from Wikipedia. If you would like more background on why these things work, the article goes into more detail, and of course has the complete lattice of links to accompany it.]
I have a godawful memory. So, I’m constantly struggling to find some basic property of sets whenever I’m trying to prove something that I KNOW would be easy, if I could just remember the damned law. Well, after scouring the net, Wikipedia’s version turned out to be best … but I don’t need all the exposition, just the laws spelled out, easy to see.
Like to here it, here it go:
PROPOSITION 1: For any sets A, B, and C, the following identities hold:
 commutative laws:

 associative laws:

 distributive laws:

PROPOSITION 2: For any subset A of universal set U, the following identities hold:
 identity laws:


 complement laws:

PROPOSITION 3: For any subsets A and B of a universal set U, the following identities hold:
 idempotent laws:

 domination laws:

 absorption laws:

PROPOSITION 4: Let A and B be subsets of a universe U, then:
 De Morgan’s laws:

 double complement or Involution law:

 complement laws for the universal set and the empty set:

PROPOSITION 5: Let A and B be subsets of a universe U, then:
 uniqueness of complements:

 If , and , then

PROPOSITION 6: If A, B and C are sets then the following hold:
 antisymmetry:

 and if and only if

 transitivity:

 If and , then

PROPOSITION 7: If A, B and C are subsets of a set S then the following hold:
 existence of a least element and a greatest element:

 existence of joins:

 If and , then

 existence of meets:

 If and , then

PROPOSITION 8: For any two sets A and B, the following are equivalent:
PROPOSITION 9: For any universe U and subsets A, B, and C of U, the following identities hold:
Filed under: Set Theory  Tagged: Algebra, axiom, closed, complement, intersection, open, set, theory, union  5 Comments »