Theorems · Theorem · combinatorics
Finite.wellFounded_of_trans_of_irrefl
∀ {α : Type u_1} [Finite α] (r : α → α → Prop) [IsTrans α r] [Std.Irrefl r], WellFounded r- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FiniteIsTransStd.Irrefl
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypeproof · cited by 7,736
- Finset.univproof · cited by 3,473
- Finitestatement and proof · cited by 3,029
- Finset.cardproof · cited by 2,327
- Finset.filterproof · cited by 949
- nonempty_fintypeproof · cited by 261
- IsTransstatement and proof · cited by 157
- transproof · cited by 111
- Finset.card_lt_cardproof · cited by 23
- irreflproof · cited by 15
Cited by2
Results whose statement or proof uses this declaration.
- Pi.Lex.wellFoundedproof · cited by 2
- isArtinian_of_finiteproof · cited by 0