Mathematical-Reasoning · Unit 16 · Video 2 · Interactive Practice

Complements Reverse Subsets: A ⊆ B Implies Bᶜ ⊆ Aᶜ

IKey Formulas

StatementMeaningName
A⊆BA \subseteq Bfor each x∈Ux \in U, if x∈Ax \in A, then x∈Bx \in BDefinition of subset
x∈Acx \in A^cx∈Ux \in U and x∉Ax \notin ADefinition of complement
P→Q≡¬Q→¬PP \to Q \equiv \neg Q \to \neg Pif x∈Ax \in A, then x∈Bx \in B   ≡  \;\equiv\; if x∉Bx \notin B, then x∉Ax \notin AContrapositive
A⊆B  ⇒  Bc⊆AcA \subseteq B \;\Rightarrow\; B^c \subseteq A^cfor any subsets AA, BB of UUThe proposition

Key Insight: Written with complements, the contrapositive of "if x∈Ax \in A, then x∈Bx \in B" is "if x∈Bcx \in B^c, then x∈Acx \in A^c", which is exactly what Bc⊆AcB^c \subseteq A^c asks of an arbitrary element xx.

IIChase One Element of the Complement

With U={1,2,…,12}U = \{1, 2, \ldots, 12\}, A={4,8,12}A = \{4, 8, 12\} and B={2,4,6,8,10,12}B = \{2, 4, 6, 8, 10, 12\}, so A⊆BA \subseteq B, the same three steps send any chosen x∈Bcx \in B^c into AcA^c.

IIIOne Witness Breaks Both Inclusions

An element of AA outside BB is the same thing as an element of BcB^c outside AcA^c.

💡 A finite picture only tests these eight elements; the proof is what covers every pair of subsets A⊆BA \subseteq B of every universal set.

IVThe Know-Show Table, Built from Both Ends

The table fills from the top (hypothesis) and the bottom (conclusion) until the two ends meet.

StepKnowReason
PA⊆BA \subseteq BHypothesis
P1Let x∈Bcx \in B^c.Choose an arbitrary element of BcB^c
P2If x∈Ax \in A, then x∈Bx \in B.Definition of "subset"
P3If x∉Bx \notin B, then x∉Ax \notin A.Contrapositive of P2
P4If x∈Bcx \in B^c, then x∈Acx \in A^c.Step P3 and definition of "complement"
Q2The element xx is in AcA^c.Steps P1 and P4
Q1Every element of BcB^c is an element of AcA^c.Choose-an-element method with Steps P1 and Q2
QBc⊆AcB^c \subseteq A^cDefinition of "subset"
StepShowReason

Proof. PLet AA and BB be subsets of the universal set UU, and assume that A⊆BA \subseteq B. We will prove that Bc⊆AcB^c \subseteq A^c by proving that each element of BcB^c is an element of AcA^c. P1So let x∈Bcx \in B^c. P2, P3Since A⊆BA \subseteq B, we know that if x∈Ax \in A, then x∈Bx \in B. The contrapositive of this conditional statement is: if x∉Bx \notin B, then x∉Ax \notin A. P4, Q2Since x∈Bcx \in B^c, we have x∉Bx \notin B, and so we conclude that x∉Ax \notin A. That is, x∈Acx \in A^c. Q1, QThis proves that every element of BcB^c is an element of AcA^c, and hence Bc⊆AcB^c \subseteq A^c. ∎

VQuiz Questions

Problem 1 · Where the Proof Starts

Given: AA and BB are subsets of UU with A⊆BA \subseteq B. To prove Bc⊆AcB^c \subseteq A^c with the choose-an-element method, which plan is correct?

✅ Correct! Bc⊆AcB^c \subseteq A^c means every element of BcB^c is in AcA^c, so the proof starts from an arbitrary x∈Bcx \in B^c and ends with x∈Acx \in A^c.
❌ Not quite. That plan would prove Ac⊆BcA^c \subseteq B^c, the reverse inclusion. The element must be chosen from the set on the left of ⊆\subseteq, here BcB^c.
❌ Not quite. That swaps hypothesis and conclusion: it is a plan for the converse proposition. Here A⊆BA \subseteq B is given and Bc⊆AcB^c \subseteq A^c is what must be shown.
❌ Not quite. Checking one element shows only that this element lies in AcA^c. The conclusion is a universal statement, so the chosen xx must be arbitrary.
Show solution

By the definition of subset, Bc⊆AcB^c \subseteq A^c means: for each x∈Ux \in U, if x∈Bcx \in B^c, then x∈Acx \in A^c.

This is a universal statement, so the choose-an-element method applies: let xx be an arbitrary element of BcB^c, use only the fact x∈Bcx \in B^c (together with the hypothesis A⊆BA \subseteq B), and prove x∈Acx \in A^c. The answer is (c).

Problem 2 · Which Conditional Is Available

Given: A⊆BA \subseteq B and x∈Bcx \in B^c. Which conditional is true for every x∈Ux \in U because A⊆BA \subseteq B, and lets you conclude x∉Ax \notin A?

✅ Correct! It is the contrapositive of "if x∈Ax \in A, then x∈Bx \in B", so it is logically equivalent to it, and its hypothesis x∉Bx \notin B is exactly what x∈Bcx \in B^c says.
❌ Not quite. This is the converse of "if x∈Ax \in A, then x∈Bx \in B", and A⊆BA \subseteq B does not give the converse: with A={1}A = \{1\} and B={1,2}B = \{1, 2\}, the element 22 is in BB but not in AA.
❌ Not quite. This is the contrapositive of the converse "if x∈Bx \in B, then x∈Ax \in A", so it is logically equivalent to the converse and does not follow from A⊆BA \subseteq B. It also starts from x∉Ax \notin A, the very fact we are trying to reach.
❌ Not quite. From A⊆BA \subseteq B, an element of AA is in BB, so it is not in BcB^c: for each x∈Ax \in A this conditional is false, so it is not true for every x∈Ux \in U once AA is nonempty. Its hypothesis x∈Ax \in A does not match x∈Bcx \in B^c anyway.
Show solution

The hypothesis A⊆BA \subseteq B gives, for our xx: if x∈Ax \in A, then x∈Bx \in B. Its starting fact x∈Ax \in A does not match what we know, x∈Bcx \in B^c.

The contrapositive is logically equivalent: if x∉Bx \notin B, then x∉Ax \notin A. Since x∈Bcx \in B^c means x∉Bx \notin B, this conditional applies and gives x∉Ax \notin A, that is, x∈Acx \in A^c. The answer is (a).

Problem 3 · Compute Both Complements

Given: U={1,2,…,10}U = \{1, 2, \ldots, 10\}, A={2,4,6}A = \{2, 4, 6\} and B={1,2,3,4,5,6}B = \{1, 2, 3, 4, 5, 6\}, so A⊆BA \subseteq B. Find BcB^c, then decide which statement is true.

What is BcB^c?

Which statement is true?

✅ Correct! Bc={7,8,9,10}B^c = \{7, 8, 9, 10\} sits inside Ac={1,3,5,7,8,9,10}A^c = \{1, 3, 5, 7, 8, 9, 10\}, and 11, 33, 55 are in AcA^c but not in BcB^c.
❌ Not quite. {1,3,5}\{1, 3, 5\} is B−AB - A, the elements of BB that are not in AA. BcB^c is everything in UU that is not in BB.
❌ Not quite. {2,4,6}\{2, 4, 6\} is AA itself. BcB^c consists of the elements of UU outside BB.
❌ Not quite. {1,3,5,7,8,9,10}\{1, 3, 5, 7, 8, 9, 10\} is AcA^c, the complement of AA. Remove only the elements of BB from UU.
❌ Not quite. 1∈Ac1 \in A^c but 1∈B1 \in B, so 1∉Bc1 \notin B^c. The inclusion reverses: it is BcB^c that sits inside AcA^c.
❌ Not quite. Bc⊆AcB^c \subseteq A^c holds, but the sets are not equal: 11, 33 and 55 are in AcA^c and not in BcB^c.
❌ Not quite. Since Bc⊆AcB^c \subseteq A^c, we get Ac∩Bc=Bc={7,8,9,10}A^c \cap B^c = B^c = \{7, 8, 9, 10\}, which is not empty.
Show solution

Bc=U−B={7,8,9,10}B^c = U - B = \{7, 8, 9, 10\} and Ac=U−A={1,3,5,7,8,9,10}A^c = U - A = \{1, 3, 5, 7, 8, 9, 10\}.

Each of 77, 88, 99, 1010 is in AcA^c, so Bc⊆AcB^c \subseteq A^c, as the proposition guarantees for A⊆BA \subseteq B. The element 11 is in AcA^c but not in BcB^c, so Ac⊈BcA^c \not\subseteq B^c and Bc≠AcB^c \neq A^c. The intersection Ac∩Bc={7,8,9,10}A^c \cap B^c = \{7, 8, 9, 10\} is nonempty.

Answers: Bc={7,8,9,10}B^c = \{7, 8, 9, 10\} (d), and Bc⊆AcB^c \subseteq A^c with Bc≠AcB^c \neq A^c (b).

Problem 4 · Complements of Divisibility Sets

Given: U=ZU = \mathbb{Z}, A={n∈Z∣12 divides n}A = \{n \in \mathbb{Z} \mid 12 \text{ divides } n\} and B={n∈Z∣4 divides n}B = \{n \in \mathbb{Z} \mid 4 \text{ divides } n\}, where aa divides nn means n=akn = ak for some integer kk. Since 12k=4(3k)12k = 4(3k), A⊆BA \subseteq B. Which statement follows from Bc⊆AcB^c \subseteq A^c?

✅ Correct! BcB^c is the set of integers not divisible by 44 and AcA^c the set not divisible by 1212, so Bc⊆AcB^c \subseteq A^c says exactly this.
❌ Not quite. This would mean Ac⊆BcA^c \subseteq B^c, the reversed inclusion. It is false: 1212 does not divide 44, but 44 divides 44.
❌ Not quite. This says B⊆AB \subseteq A, the converse of the hypothesis. It is false: 44 divides 44, but 1212 does not divide 44.
❌ Not quite. This says Ac⊆BA^c \subseteq B, which is false: 1212 does not divide 11, and 44 does not divide 11 either.
Show solution

If n∈An \in A, then n=12kn = 12k for some integer kk, so n=4(3k)n = 4(3k) with 3k∈Z3k \in \mathbb{Z}, and n∈Bn \in B. Hence A⊆BA \subseteq B.

By the proposition, Bc⊆AcB^c \subseteq A^c. Here Bc={n∈Z∣4 does not divide n}B^c = \{n \in \mathbb{Z} \mid 4 \text{ does not divide } n\} and Ac={n∈Z∣12 does not divide n}A^c = \{n \in \mathbb{Z} \mid 12 \text{ does not divide } n\}, so: for every integer nn, if 44 does not divide nn, then 1212 does not divide nn. The answer is (d).

The integer n=4n = 4 is a counterexample to (a) and (b), and n=1n = 1 is a counterexample to (c).

Solved: 0 / 4