Prove that A n (B u C) = (A n B) u ( A n C)

Let x be inside set A n (B u C)

We can write this as

This means x is in set A and also in set B u C. It may be in B, or in C, or both B and C at the same time.

--------------

Let's assume x is in set B but not in set C.

If so, then x is definitely in A n B and not in A n C. Overall, x is in (A n B) u ( A n C)

This leads us to the fact that A n (B u C) is a subset of (A n B) u ( A n C)

Symbolically we would write

-------------

Now let's assume that x is in set C but not in set B

We follow the same basic steps as the previous section. We'll conclude with the same symbolic notation written. There's not much different here other than x is in set A n C rather than A n B

--------------

The previous two sections fully confirm that is true.

To prove is true, we will use the same idea.

Let y be a member of the set (A n B) u ( A n C)

This means y is either in A n B or it is in A n C

If y is in A n B, then it's certainly in A and B. It doesn't matter if it's in C or not. We have enough to show that y is a member of  A n (B u C)

Or if y is in A n C, then it's in A and C simultaneously. This places element y in the set A n (B u C) overall.

Therefore, we have proven that is true. If something is in the right-side set, then it's also in the left-side set as well.

-----------------

To wrap things up, we have proven these two claims

In other words, we have shown the left and right sides are subsets of each other. This is sufficient to conclude that the two sets are equal.

Therefore, we have shown that

is a true claim.

For more information, check out the distributive property dealing with set mathematics.

answer: 43/157

this is the answer and if you try to prove me wrong your a meanie