Equivalence of Definitions of Ring of Sets

Theorem
The following definitions of ring of sets are equivalent:

Definition 1 implies Definition 2
Let $\mathcal R$ be a non-empty system of sets such that for all $A, B \in \mathcal R$:
 * $(1): \quad A \cap B \in \mathcal R$
 * $(2): \quad A * B \in \mathcal R$

As $\mathcal R$ is non-empty, there exists some $A \in \mathcal R$.

From Symmetric Difference with Self is Empty Set:
 * $A * A = \varnothing$

By hypothesis $A * A \in \mathcal R$ and so $\varnothing \in \mathcal R$.

Thus criterion $(1)'$ is fulfilled.

From Closure of Intersection and Symmetric Difference imply Closure of Set Difference it follows that criterion $(2)'$ is fulfilled.

From Closure of Intersection and Symmetric Difference imply Closure of Union it follows that criterion $(3)'$ is fulfilled.

Definition 2 implies Definition 1
Let $\mathcal R$ be a system of sets such that for all $A, B \in \mathcal R$:
 * $(1)': \quad \varnothing \in \mathcal R$
 * $(2)': \quad A \setminus B \in \mathcal R$
 * $(3)': \quad A \cup B \in \mathcal R$

We have that $\varnothing \in \mathcal R$ and so $\mathcal R$ is non-empty.

By hypothesis, $\mathcal R$ is closed under $\setminus$ and $\cup$.

Thus:
 * $\forall A, B \in \mathcal R: \left({A \setminus B}\right) \cup \left({B \setminus A}\right) \in \mathcal R$

But by the definition of symmetric difference:
 * $A * B := \left({A \setminus B}\right) \cup \left({B \setminus A}\right) \in \mathcal R$

Thus:
 * $\forall A, B \in \mathcal R: A * B \in \mathcal R$

and so $\mathcal R$ is closed under symmetric difference.

Thus criterion $(2)$ is fulfilled.

From Union minus Symmetric Difference equals Intersection:
 * $\forall A, B \in \mathcal R: \left({A \cup B}\right) \setminus \left({A * B}\right) = A \cap B$

Thus $\mathcal R$ is closed under set intersection.

Thus criterion $(1)$ is fulfilled.