[share]

A binary relation R is called well-founded (or wellfounded) on a class X
if every non-empty subset S ⊆ X has a minimal element with respect to R,
that is, an element m not related by sRm
(for instance, "s is not smaller than m") for any s ∈ S.