Theorems · Theorem · order theory
DFinsupp.wellFoundedLT
∀ {ι : Type u_1} {α : ι → Type u_2} [inst : (i : ι) → Zero (α i)] [inst_1 : (i : ι) → Preorder (α i)]
[∀ (i : ι), WellFoundedLT (α i)], (∀ ⦃i : ι⦄ ⦃a : α i⦄, ¬a < 0) → WellFoundedLT (Π₀ (i : ι), α i)- Defined in
- Mathlib.Data.DFinsupp.WellFounded
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ZeroPreorderWellFoundedLT
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- DFinsuppstatement and proof · cited by 694
- WellFoundedLTstatement and proof · cited by 491
- Function.swapproof · cited by 216
- IsWellFounded.wfproof · cited by 43
- WellOrderingRelproof · cited by 30
- DFinsupp.mapRangeproof · cited by 29
- Antisymmetrizationproof · cited by 25
- DFinsupp.Lexproof · cited by 14
- toAntisymmetrizationproof · cited by 12
- DFinsupp.Lex.wellFounded'proof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.