Option (B) is correct.
Explanation:
Assertion (A) is true. Every set splits into its part inside C and its part outside C. By the complement law C∪C′=U and the distributive law,
A=A∩U=A∩(C∪C′)=(A∩C)∪(A∩C′)
In the same way, B=(B∩C)∪(B∩C′). The two pieces of A equal the two pieces of B, so
A=(A∩C)∪(A∩C′)=(B∩C)∪(B∩C′)=B
Neither condition is enough on its own. With U={1,2,3}, A={1}, B={1,2} and C={1}, we get A∩C=B∩C={1} but A=B. Here A∩C′=ϕ while B∩C′={2}, so the second condition fails. Only both conditions together force A=B.
Reason (R) is true. It is De Morgan's law: an element is outside A∩B exactly when it is outside A or outside B.
The link. The proof of A uses C∪C′=U and the distributive law to split each set into its part in C and its part in C′. It never takes the complement of an intersection, so De Morgan's law plays no part. R is true but it does not explain A.
Why the other options are wrong
- (A) says R explains A. R turns the complement of an intersection into a union of complements, and no such complement appears in the proof of A.
- (C) says R is false. R is De Morgan's law, which holds for all subsets of U.
- (D) says A is false. That is true of each condition alone, as the example above shows, but the two conditions together cover both the part of U inside C and the part outside it.