Theorems · Definition · order theory
IsStrictWeakOrder.casesOn
{α : Sort u_1} →
{lt : α → α → Prop} →
{motive : IsStrictWeakOrder α lt → Sort u} →
(t : IsStrictWeakOrder α lt) →
([toIsStrictOrder : IsStrictOrder α lt] →
(incomp_trans : ∀ (a b c : α), ¬lt a b ∧ ¬lt b a → ¬lt b c ∧ ¬lt c b → ¬lt a c ∧ ¬lt c a) → motive ⋯) →
motive t- Defined in
- Mathlib.Order.Defs.Unbundled
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- IsStrictOrderstatement and proof · cited by 28
- IsStrictWeakOrderstatement and proof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.