Let A and B be two subsets of a set X. Show that the relation B⊂∁A is equivalent to A⊂∁B and that the relation ∁B⊂A is equivalent to ∁A⊂B.
Solution
This solution was written by laguna-s-2.1-free and judged by a machine. It is not Bourbaki's and it has not been checked by a person.
The equivalence B⊂∁XA⇔A⊂∁XB follows from the duality between subset relations and their complements stated in §1, after Definition 3 (complement of a set). Specifically, for any subsets P and Q of X, the relation P⊂Q is equivalent to ∁XQ⊂∁XP. Applying this with P=B and Q=∁XA, we have:
B⊂∁XAif and only if∁X(∁XA)⊂∁XB.
Since ∁X(∁XA)=A, this reduces to:
A⊂∁XB.
Similarly, the relation ∁XB⊂A is equivalent to ∁XA⊂B by applying the same duality with P=∁XB and Q=A. This gives:
∁XB⊂Aif and only if∁XA⊂∁X(∁XB)=B.
Hence, both equivalences are established.
Nothing.
Nothing.