My attempt:
Suppose $x \in A \times (B - C).$ We know x is of the form $(a, d)$, where $a \in A$ and $d \in B - C$. We know, by the definition of -, that $d \in B$ and $d \notin C$.
Got stuck there and don't get how to synthetize a proof of the theorem
...where $a\in A$ and $d\in B-C$. We know by definition of $-$ that $d\in B$ and $d\notin C$.
That is to say, $~~~a\in A$ and $d\in B~~~$ as well as $~~~a\in A$ and $d\notin C$.
The first two imply that $(a,d)\in A\times B$ while the second two imply that $(a,d)\notin A\times C$
These together imply that...