Q.Show that if A ⊂ B, then C – B ⊂ C – A.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →When is contained in , removing the larger set from leaves fewer elements than removing the smaller set ; hence .
The set difference consists of all elements that belong to but not to . The claim asks us to show that if is a subset of , then removing from cannot give us more elements than removing from .
The intuition is straightforward: if , then contains everything does, possibly more. When we subtract from , we're throwing away at least as much as we would by subtracting . So should be "smaller" (contained in) .
Let's prove this by showing that every element of must also belong to .
-
Take an arbitrary element of .
Let . By the definition of set difference, this means and .
-
Use the hypothesis .
Since , every element of is also in . The contrapositive of this statement is equally useful: if an element is not in , then it cannot be in either. Formally, .
-
Conclude that .
We know (from step 1) and (from step 2). Therefore, by definition, .
-
Generalize. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.