Theorems · Definition · order theory
IsWellOrder.linearOrder
{α : Type u} → (r : α → α → Prop) → [IsWellOrder α r] → LinearOrder αConstruct a decidable linear order from a well-founded linear order.
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement · cited by 8,572
- IsWellOrderstatement and proof · cited by 171
- linearOrderOfSTOproof · cited by 11
Cited by3
Results whose statement or proof uses this declaration.
- MvPolynomial.combinatorial_nullstellensatz_exists_linearCombinationproof · cited by 1
- LinearMap.BilinMap.toQuadraticMap_surjectiveproof · cited by 0
- MvPolynomial.combinatorial_nullstellensatz_exists_eval_nonzeroproof · cited by 0