Characteristics of Minimally Inductive Class under Progressing Mapping

From ProofWiki
Jump to navigation Jump to search

Theorem

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

Then for all $x, y \in M$:


Sandwich Principle

$x \subseteq y \subseteq \map g x \implies x = y \lor y = \map g x$


Image of Proper Subset is Subset

$x \subset y \implies \map g x \subseteq y$


Mapping Preserves Subsets

$x \subseteq y \implies \map g x \subseteq \map g y$


Sources