Proving statement $(A \cup C)\setminus B=(A\setminus B)\cup C \iff B\cap C= \varnothing$ I want to prove the following statment:
$$(A \cup C)\setminus B=(A\setminus B)\cup C \iff B\cap C= \varnothing$$
Do I need to prove each side? Or is one side enough? I mean, if I get from the left side to the right is it enough?
How do the following statements help me?


*

*$(A \cup C) \setminus B = (A \cup C)\cap B'$

*$(A \setminus B) \cup C = (A \cap B')\cup C$


I would like to get some hint to prove this statement.
Thanks!

Let me try to explain how I'd think about this problem, since I'd work directly from definitions and thus use fewer formulas than other people seem to like. For the left-to-right implication, notice that $(A\setminus B)\cup C$ contains (by definition) all the elements of $C$. But it equals $(A\cup C)\setminus B$ and therefore contains none of the elements of $B$.  So no elements of $C$ can be in $B$; that is, $B\cap C=\varnothing$.
For the right-to-left implication, look at the expressions $(A\cup C)\setminus B$ and $(A\setminus B)\cup C$ on the left side.  Each involves starting with $A$, adding in the members of $C$ and removing the members of $B$; they differ only in the order in which "adding" and "removing" are done.  So for points that are in only one of $B$ and $C$ or in neither of them, the two expressions work exactly the same way. A difference arises only for points in $B\cap C$ as these would be  first removed and then added in $(A\setminus B)\cup C$, so they'd be present in the final result, but first added and then removed in $(A\cup C)\setminus B$, so they'd be absent from the final result. Conclusion: The two expressions on the left differ only in regard to elements of $B\cap C$.  In particular, if $B\cap C=\varnothing$ then the two expressions agree and the equation on the left side therefore holds. 
