A ∩ (B ∪C) ⊂ B ∪ (A ∩C)
Can anyone give me a general outline of an approach to take to this proof? I Don't really know where to begin.
A ∩ (B ∪C) ⊂ B ∪ (A ∩C)
Can anyone give me a general outline of an approach to take to this proof? I Don't really know where to begin.
An elementary approach to such a proof would be to begin by letting $x \in A \cap (B \cup C)$. Then $x \in A$ and $x \in (B \cup C)$ so there are two cases: Either $x \in B \subseteq B \cup (A \cap C)$. Or $x \in C$ and so $x \in A \cap C \subseteq B \cup (A \cap C)$. In both cases we showed $x \in B \cup (A \cap C)$ so we showed any element of $A \cap (B \cup C)$ is contained in $B \cup (A \cap C)$.