Ordered set. A type α equipped with a relation lt : α → α → Prop is
an ordered set if it satisfies trichotomy (for any x y, exactly one of lt x y,
lt y x, or x = y holds) and transitivity (lt x y and lt y z imply lt x z).
- transitivity (x y z : α) : lt x y → lt y z → lt x z
Instances
Bounded above and bounded below. In a preorder, a set E is bounded above
iff there exists an upper bound b with x ≤ b for all x ∈ E, and bounded
below iff there exists a lower bound c with c ≤ x for all x ∈ E.
Least Upper Bound (LUB) Property. A preordered type α has the LUB
property if every nonempty subset E ⊆ α that is bounded above has a least
upper bound (supremum) in α.
Instances For
Ordered field axioms. In an ordered field F, the order is compatible
with addition (x < y implies x + z < y + z) and with multiplication
(if 0 < x and 0 < y, then 0 < x * y).
Field axioms. A field F satisfies the addition axioms (A1-A5:
commutativity, associativity, existence of 0, additive inverses), the
multiplication axioms (M1-M5: commutativity, associativity, existence of 1,
multiplicative inverses for nonzero elements), and the distributive law (D).