Prove that if A, B.C are subsets of a universal set U, then AU(BnC) C (AUB)n(AUC)

Consider the universal set U: {1, 3, 7, 8, 15, 16, 17, 20} Set A: {3, 8, 16, 20} Set B: {1, 15, 17, 20} Find AC ∩ B.

Let S be the universal set, where: S = {1,2, 3, ..., 18, 19, 20} Let sets A and B be subsets of S, where: Set A = {1, 2, 5, 6, 9, 10, 13, 16, 17, 18, 19, 20} Set B = {1,4, 5, 7, 8, 9, 10, 12, 16, 19} Find the following: LIST the elements in the set (AU B): (AUB) = { } Enter the elements as a list, separated by commas. If the result is the empty set, enter DNE LIST the elements in the set (An B): (An B) = {| Enter the elements as a list, separated by commas. If the result is the empty set, enter DNE } You may want to draw a Venn Diagram to help answer this question.

Let S be the universal set, where: S = {1,2, 3, .., 23, 24, 25} Let sets A and B be subsets of S, where: Set A = {3, 9, 14, 15, 18, 20, 23, 25} Set B = {1, 2, 8, 9, 11, 14, 15, 16, 17, 21, 24, 25} Find the number of elements in the set (AU B) n[AU B]- [