Q.If U = {1, 2, 3, 4, 5, 6, 7, 8, 9 }, A = {2, 4, 6, 8} and B = { 2, 3, 5, 7}. Verify that
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 →We verify De Morgan's Laws for sets by computing both sides independently and showing they yield identical sets: the complement of a union equals the intersection of complements, and the complement of an intersection equals the union of complements.
Understanding De Morgan's Laws
De Morgan's Laws are fundamental identities in set theory that reveal a beautiful duality between union and intersection under complementation. When you take the complement of a union, it "flips" to become an intersection of complements—and vice versa. These laws appear everywhere: logic, probability, computer science, and of course set theory problems in your exams.
The intuition is straightforward. An element is not in precisely when it's in neither nor —that is, when it's in both and simultaneously. Similarly, an element is not in when it fails to be in at least one of them—meaning it's in or in (or both).
Let's verify both laws with the given sets.
Given:
(i) Verifying
Left-hand side:
- Find : Combine all elements that appear in either set.
- Take the complement: Elements in but not in .
Right-hand side:
- Find : Elements in but not in .
- Find : Elements in but not in .
- Find : Elements common to both complements.
Comparison:
Notice that are precisely the elements that belong to neither nor . This is the essence of the law: being outside the union means being outside both sets.
(ii) Verifying
Left-hand side:
- Find : Elements common to both sets.
(Only appears in both and .)
- Take the complement: Elements in but not in . …
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.