Q.For all sets and , is equal to ______________.
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 key idea is that removes from the elements it shares with , leaving exactly the part of that is not in . The result is .
This is a classic set theory identity, and it’s best understood by thinking about what each operation actually does to the elements.
Set difference means “everything in that is not in .”
Intersection means “everything that is in both and .”
So the expression asks: Take all of , and remove from it the elements that belong to both and .
What’s left? Only those elements of that are not in — because any element of that is also in gets removed. That’s exactly the definition of .
Let’s verify this step by step.
- Start with the definition of set difference. For any element ,
-
Unpack the “not in intersection” condition.
means it is not true that is in both and . In other words, either or .
But we already know from step 1 that . So the “” case is impossible. Therefore, we must have .
-
Combine the conditions.
From step 1 and step 2, we get:
That is precisely the condition for .
- Conclusion of the logic. We have shown: …
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.