Minimally Inductive Class under Progressing Mapping induces Nest

Theorem
Let $M$ be a class which is minimally inductive under a progressing mapping $g$.

Then $M$ is a nest in which:
 * $\forall x, y \in M: \map g x \subseteq y \lor y \subseteq x$

Proof
Let $\RR$ be the relation on $M$ defined as:


 * $\forall x, y \in M: \map \RR {x, y} \iff \map g x \subseteq y \lor y \subseteq x$

We are given that $g$ is a progressing mapping.

From the Progressing Function Lemma, we have that:

From the Double Induction Principle, if $\RR$ is a relation on $M$ which satisfies:

then $\map \RR {x, y}$ holds for all $x, y \in M$.

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

follows directly.

Then the fact that:
 * $\map g x \subseteq y \lor y \subseteq x$

implies that:
 * $x \subseteq y \lor y \subseteq x$

because:
 * $x \subseteq \map g x$

Hence the result by definition of a nest.