Theorems · Theorem · order theory
Finsupp.Lex.wellFounded_of_finite
∀ {α : Type u_1} {N : Type u_2} [inst : Zero N] (r : α → α → Prop) {s : N → N → Prop} [IsStrictTotalOrder α r]
[Finite α], WellFounded s → WellFounded (Finsupp.Lex r s)- Defined in
- Mathlib.Data.Finsupp.WellFounded
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ZeroIsStrictTotalOrderFinite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsuppstatement · cited by 5,255
- Finitestatement and proof · cited by 3,029
- Finsupp.equivFunOnFiniteproof · cited by 50
- Finsupp.Lexstatement · cited by 11
- IsStrictTotalOrderstatement and proof · cited by 10
- Pi.Lex.wellFoundedproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finsupp.Lex.wellFoundedLT_of_finiteproof · cited by 1