Theorems · Inductive type · order theory
IsStrictWeakOrder
(α : Sort u_1) → (α → α → Prop) → Prop
IsStrictWeakOrder X lt means that the binary relation lt on X is a strict weak order,
that is, IsStrictOrder X lt and ¬lt a b ∧ ¬lt b a → ¬lt b c ∧ ¬lt c b → ¬lt a c ∧ ¬lt c a.
- Defined in
- Mathlib.Order.Defs.Unbundled
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by4
Results whose statement or proof uses this declaration.
- IsStrictWeakOrder.casesOnstatement and proof · cited by 0
- isStrictWeakOrder_of_isOrderConnectedstatement · cited by 0
- IsStrictWeakOrder.incomp_transstatement and proof · cited by 0
- IsStrictWeakOrder.recOnstatement and proof · cited by 0