Subset Relation is Ordering/General Result

Theorem

Let $\mathbb S$ be a set of sets or class.

Then $\subseteq$ is an ordering on $\mathbb S$.

In other words, let $\left({\mathbb S, \subseteq}\right)$ be the relational structure defined on $\mathbb S$ by the relation $\subseteq$.

Then $\left({\mathbb S, \subseteq}\right)$ is an ordered set.

Proof

To establish that $\subseteq$ is an ordering, we need to show that it is reflexive, antisymmetric and transitive.

So, checking in turn each of the criteria for an ordering:

Reflexivity

 $\displaystyle \forall T \in \mathbb S: \ \$ $\displaystyle T$ $\subseteq$ $\displaystyle T$ Set is Subset of Itself

So $\subseteq$ is reflexive.

$\Box$

Antisymmetry

 $\displaystyle \forall S_1, S_2 \in \mathbb S: \ \$ $\displaystyle S_1 \subseteq S_2 \land S_2 \subseteq S_1$ $\iff$ $\displaystyle S_1 = S_2$ Definition 2 of Set Equality

So $\subseteq$ is antisymmetric.

$\Box$

Transitivity

 $\displaystyle \forall S_1, S_2, S_3 \in \mathbb S: \ \$ $\displaystyle S_1 \subseteq S_2 \land S_2 \subseteq S_3$ $\implies$ $\displaystyle S_1 \subseteq S_3$ Subset Relation is Transitive

That is, $\subseteq$ is transitive.

$\Box$

So we have shown that $\subseteq$ is an ordering on $\mathbb S$.

$\blacksquare$