For a partial order on a set: a subclass has at most one least and one greatest element; the strict relation is characterized by u <= v and u != v, is irreflexive and transitive, and u <= v iff u < v or u = v; for a total order, trichotomy holds and the negation of u <= v is v < u.
In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let be a set, a partial order on and its associated strict relation.
For every subclass of , there is at most one such that for every , and at most one such that for every .
For all sets and , holds if and only if and .
For every , does not hold.
For all , if and then .
For all , holds if and only if or .
If is total, then for all exactly one of , and holds.
If is total, then for all , fails if and only if .
Loading…
No relations recorded yet.