It is to prove that the empty set is a subset of every set.
Therefore the following proposition is to be proven:
$$ \forall z: ( \emptyset \subset z)~~.$$
Therefore, the converse
$$ \exists z: ( \emptyset \not \subset z)$$
must lead to a contradiction.
Now, considering the set
$$ z = \{\{a\}\} \setminus \{a\} = \{\}~~, $$
if
$$ \emptyset \not \subset z~~, \text{and therefore} ~~ \emptyset \neq z ~~,$$
then $z$ wouldn't be a set, yet it is by definition a set, since the proposition
$$ a \in z $$
is still either true or false. Which is a contradiction.
Assuming my reasoning is flawed, please don't give me the proof. If it is correcct though, I would appreciate an alternative proof. Thank you in advance.