Let
Find , , , , and .
Fix the two definitions before computing. ("union") contains every element that is in or or both, each listed once. ("intersection") contains only the elements in both. A reliable habit is to write the answers in increasing order so that a missing or repeated element is easy to spot.
Compute the three unions. Merge the lists and delete repeats:
Note appears in both and but is written only once in .
Compute A ∩ B. Scan against : only occurs in both.
Compute C ∩ D. and share and .
Compute D ∩ A. and share only . Intersection is commutative, so .
Check each pair with the counting identity. . For and : ✓. For and : ✓. For and : , so ✓. All three unions have the predicted sizes.
Need to solve a different problem like this? Open the solver →