University of California, San Diego: Edward Bender and S. Williamson's "Sets, Equivalence and Order: Sets and Functions"
Study Theorem 1 on pages SF-2 and SF-3 on the associative laws: (A
B)
C = A
(B
C) = A
B
C. Note that we can write the rightmost expression, which has no parenthesis, because
is associative. Replacing
by the intersection operations, gives the associative law for intersection. Prove the associative laws.