Definition:Strict Well-Ordering/Definition 2

Definition
Let $A$ be a class.

Let $\prec$ be a relation on $A$.

Then $\prec$ is a strict well-ordering of $A$ iff:


 * $\prec$ connects $A$;
 * $\prec$ is well-founded. That is, whenever $b$ is a non-empty subset of $A$, $b$ has a $\prec$-minimal element.