Q.Determine whether the following statement is true or false. Justify your answer: For all sets , and , if , then .
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 →The statement is true. The key idea is that set difference is not involved here — we are using the definition of subset: if every element of is in , then any element common to and must also be common to and .
This is a classic exercise in understanding what the subset symbol really means, and how intersection interacts with it. Many students get confused because they think of "subset" as a kind of containment that might break when you intersect with another set — but it doesn't.
Let’s unpack why.
1. Restate what we need to prove
We are given: . That means every element of is also an element of . We want to check whether must follow.
In words: if we take the elements that are in both and , are they necessarily also in both and ?
2. Pick an arbitrary element from
Let . By definition of intersection, this means:
Since and , we know .
So now we have:
- (from the subset condition)
- (from the intersection)
3. Conclude that belongs to
By definition of intersection again, and together mean .
We started with an arbitrary and showed . That is exactly the definition of .
This proof works for any sets — it never uses any special property of . The only requirement is . So the statement is always true, regardless of what is (even if is empty).
4. A common misunderstanding …
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.