Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Set Theoryhard
0:00.0

Consider a finite universal set UUU with ∣U∣=n|U| = n∣U∣=n. Let A,B⊆UA, B \subseteq UA,B⊆U be two subsets. If it is given that A∖B=B∖AA \setminus B = B \setminus AA∖B=B∖A and A∪B=UA \cup B = UA∪B=U, which of the following must be true?