de Morgan’s laws for sets (proof)


Let X be a set with subsets Ai⊂X for i∈I, where I is an arbitrary index-set. In other words, I can be finite, countableMathworldPlanetmath, or uncountable. We first show that

(∪i∈IAi)′ = ∩i∈IAi′,

where A′ denotes the complementPlanetmathPlanetmath of A.

Let us define S=(∪i∈IAi)′ and T=∩i∈IAi′. To establish the equality S=T, we shall use a standard argument for proving equalities in set theoryMathworldPlanetmath. Namely, we show that S⊂T and T⊂S. For the first claim, suppose x is an element in S. Then x∉∪i∈IAi, so x∉Ai for any i∈I. Hence x∈Ai′ for all i∈I, and x∈∩i∈IAi′=T. Conversely, suppose x is an element in T=∩i∈IAi′. Then x∈Ai′ for all i∈I. Hence x∉Ai for any i∈I, so x∉∪i∈IAi, and x∈S.

The second claim,

(∩i∈IAi)′ = ∪i∈IAi′,

follows by applying the first claim to the sets Ai′.

Title de Morgan’s laws for sets (proof)
Canonical name DeMorgansLawsForSetsproof
Date of creation 2013-03-22 13:32:16
Last modified on 2013-03-22 13:32:16
Owner mathcam (2727)
Last modified by mathcam (2727)
Numerical id 7
Author mathcam (2727)
Entry type Proof
Classification msc 03E30