Theorems · Theorem · order theory
DFinsupp.Lex.wellFounded_of_finite
∀ {ι : Type u_1} {α : ι → Type u_2} (r : ι → ι → Prop) {s : (i : ι) → α i → α i → Prop} [IsStrictTotalOrder ι r]
[Finite ι] [inst : (i : ι) → Zero (α i)], (∀ (i : ι), WellFounded (s i)) → WellFounded (DFinsupp.Lex r s)- Defined in
- Mathlib.Data.DFinsupp.WellFounded
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsStrictTotalOrderFiniteZero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fintypeproof · cited by 7,736
- Finitestatement and proof · cited by 3,029
- DFinsuppstatement · cited by 694
- Fintype.ofFiniteproof · cited by 255
- DFinsupp.Lexstatement · cited by 14
- DFinsupp.equivFunOnFintypeproof · cited by 11
- IsStrictTotalOrderstatement and proof · cited by 10
- Pi.Lex.wellFoundedproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.