how do you prove that A ∩ ( B ∪ C) = (A ∩ B) ∪ ( A ∩ C) for any sets A, B,C?
Well it won't help you prove anything. I mean you can of course declare whatever you want, but someone could ask but what if x is not in B and you wouldn't be able to answer that person
To prove that 2 sets, say X and Y are equal, we need to show that they contain the same elements right? So one way of doing this is by picking an arbitrary element of X, call it p.
Let . Then we use the given information to conclude that p is also in Y. Since we picked p arbitrarily, it holds for all and so every element of X is in Y
Then we pick an arbitrary element of Y and show it must be in X. Then since every element of X is in Y and every element of Y is in X, X=Y
So to prove the other direction of your question, you want to start out by saying
now use your knowledge of unions and intersections do determine that x must also be in
So try to take it from here before I help you further