$s_1: A \backslash B = \emptyset$ and $B \backslash A= \emptyset$
$s_2: A \cup B = A \cap B$.
I'm not sure if what I have is a correct way to show this proof, but I have the following so far:
Suppose $A \backslash B = \emptyset$ and $B \backslash A = \emptyset$. We want to show that $A \cup B = A \cap B$.
Take any $x \in A$. If $A \cap B$, then $x \in A$ and $x \in B$.
Since $x \in A$ and $x \in B$, then $A \cap B \subseteq A \cup B$.
I'm not really sure if this is correct or how to progress.