Theorems · Definition · order theory
decidableEqOfDecidableLE
{α : Type u_1} → [inst : PartialOrder α] → [DecidableLE α] → DecidableEq αEquality is decidable if ≤ is.
- Defined in
- Mathlib.Order.Defs.PartialOrder
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
- Assumes
- PartialOrderDecidableLE
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.
- PartialOrderstatement and proof · cited by 6,410
- le_antisymmproof · cited by 2,068
Cited by6
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
- LinearOrder.mkOfAddGroupConeproof · cited by 0
- LinearOrder.mkOfGroupConeproof · cited by 0