Theorems · Definition · order theory
decidableLTOfDecidableLE
{α : Type u_1} → [inst : Preorder α] → [DecidableLE α] → DecidableLT α< is decidable if ≤ is.
- Defined in
- Mathlib.Order.Defs.PartialOrder
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- PreorderDecidableLE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
Cited by7
Results whose statement or proof uses this declaration.
- linearOrderOfSTOproof · cited by 11
- FirstOrder.Language.linearOrderOfModelsproof · cited by 2
- IsChain.linearOrderproof · cited by 1
- LinearOrder.ofSubsingletonproof · cited by 0
- IsSimpleOrder.linearOrderproof · cited by 0
- LinearOrder.mkOfAddGroupConeproof · cited by 0
- LinearOrder.mkOfGroupConeproof · cited by 0