Question #22050

Prove the Distributive Laws:
(a) A intersect (B union C) = ( A intersect B) union ( A intersect C)
(b) A union (B intersect C) = ( A union B) intersect ( A union C)

Expert's answer

Question 1. Prove the Distributive Laws:

(a) A(BC)=(AB)(AC)A \cap (B \cup C) = (A \cap B) \cup (A \cap C);

(b) A(BC)=(AB)(AC)A \cup (B \cap C) = (A \cup B) \cap (A \cup C).

Solution. (a) Prove that A(BC)(AB)(AC)A \cap (B \cup C) \subset (A \cap B) \cup (A \cap C). Suppose xA(BC)x \in A \cap (B \cup C), then xAx \in A and xBCx \in B \cup C. The latter means that either xBx \in B, or xCx \in C. If xBx \in B, then xABx \in A \cap B, and if xCx \in C, then xACx \in A \cap C. Thus, either xABx \in A \cap B, or xACx \in A \cap C, i.e. x(AB)(AC)x \in (A \cap B) \cup (A \cap C).

Prove the converse inclusion. Take x(AB)(AC)x \in (A \cap B) \cup (A \cap C). So, either xABx \in A \cap B, or xACx \in A \cap C. In both cases xAx \in A. If xABx \in A \cap B, then xBx \in B, and if xACx \in A \cap C, then xCx \in C. So, either xBx \in B, or xCx \in C, i.e. xBCx \in B \cup C. Thus, we proved xAx \in A and xBCx \in B \cup C, hence xA(BC)x \in A \cup (B \cap C).

(b) Prove the inclusion A(BC)(AB)(AC)A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C). Let xA(BC)x \in A \cup (B \cap C). Then either xAx \in A, or xBCx \in B \cap C. In the first case xAx \in A, which is a subset of both ABA \cup B and ACA \cup C. So, x(AB)(AC)x \in (A \cup B) \cap (A \cup C). In the second case xBCx \in B \cap C, which is a subset of BABB \subset A \cup B and CACC \subset A \cup C. Thus, x(AB)(AC)x \in (A \cup B) \cap (A \cup C) in this case.

Now prove the converse inclusion. Choose x(AB)(AC)x \in (A \cup B) \cap (A \cup C). So xABx \in A \cup B and xACx \in A \cup C. If xAx \in A, then obviously xA(BC)x \in A \cup (B \cap C), because AA(BC)A \subset A \cup (B \cap C). Otherwise xBx \in B and xCx \in C, i.e. xBCA(BC)x \in B \cap C \subset A \cup (B \cap C).


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS