G-Tower is Nest/Lemma 2

Theorem
Let $M$ be a class.

Let $g: M \to M$ be a progressing mapping on $M$.

Let $M$ be a $g$-tower.

Then:
 * $\forall x, y \in M: \map g x \subseteq y \lor y \subseteq x$

Proof
First a lemma:

Lemma 1
That is:

By definition of $g$-tower:


 * $M$ is minimally superinductive under $g$.

Hence by the Principle of Superinduction:
 * $\forall x, y \in M: \tuple {x, y} \in \RR$

That is:
 * $\forall x, y \in M: \map g x \subseteq y \lor y \subseteq x$