Transitive Set is Proper Subset of Ordinal iff Element of Ordinal

Theorem
For an ordinal $A$ and any transitive set $B$, we have:
 * $B \subset A \iff B \in A$

Proof
Suppose that $B \in A$.

Because an ordinal is transitive, it follows that $B \subseteq A$.

Also, $B \ne A$ because the strict well-ordering on $A$ is, by definition, given by the $\in$-relation.

Therefore, $B \subset A$, as desired.

Now, suppose that $B \subset A$.

By the definition of set equality, the set difference $A \setminus B$ is non-empty.

By the definition of a well-ordering, there exists a minimal element $x$ of $A \setminus B$.

Since the strict well-ordering on $A$ is given by the $\in$-relation, it follows by the definition of a minimal element that:
 * $\forall y \in A \setminus B: y \notin x$

Therefore:

Suppose that $z \in B$. Since $B \subset A$, it follows that $z \in A$.

Recall that the strict well-ordering on $A$ is given by the $\in$-relation; since a well-ordering is a total ordering, it follows that $z \in x$ or $x = z$ or $x \in z$.

If $x = z$ or $x \in z$, then it follows by the transitivity of $B$ that $x \in B$, which contradicts the definition of $x$.

Hence, $z \in x$. That is, $B \subseteq x$.

By the definition of set equality, it follows that $B = x \in A$, as desired.

Source

 * : $\S 7.7$