Question: I need help with this problem please, and please make it legible sometimes I can't read it. 4. Let U be any set. Prove that
I need help with this problem please, and please make it legible sometimes I can't read it.

4. Let U be any set. Prove that for every B e g;)(U) there is a unique D e 3:;(U) such that for every C e 33(U), C \\ B = C n D
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
