TheoremBase

Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders

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.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let aa be a set, ≤\le a partial order on aa and << its associated strict relation.

For every subclass ss of aa, there is at most one m∈sm\in s such that m≤vm\le v for every v∈sv\in s, and at most one m∈sm\in s such that v≤mv\le m for every v∈sv\in s.

For all sets uu and vv, u<vu<v holds if and only if u≤vu\le v and u≠vu\neq v.

For every u∈au\in a, u<uu<u does not hold.

For all u,v,w∈au,v,w\in a, if u<vu<v and v<wv<w then u<wu<w.

For all u,v∈au,v\in a, u≤vu\le v holds if and only if u<vu<v or u=vu=v.

If ≤\le is total, then for all u,v∈au,v\in a exactly one of u<vu<v, u=vu=v and v<uv<u holds.

If ≤\le is total, then for all u,v∈au,v\in a, u≤vu\le v fails if and only if v<uv<u.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…