Theorems · Definition · order theory
Set.WellFoundedOn
{α : Type u_2} → Set α → (α → α → Prop) → Props.WellFoundedOn r indicates that the relation r is WellFounded when restricted to s.
- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 53 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by54
Results whose statement or proof uses this declaration.
- Set.IsWFproof · cited by 47
- Set.IsPWO.isWFproof · cited by 9
- Set.WellFoundedOn.mapsTostatement and proof · cited by 7
- Set.WellFoundedOn.mono'statement · cited by 7
- Set.WellFoundedOn.inductionstatement and proof · cited by 5
- Set.wellFoundedOn_rangestatement and proof · cited by 5
- LinearOrderedAddCommGroup.wellFoundedOn_setOfPred_le_lt_iff_nonempty_discretestatement and proof · cited by 3
- Set.Finite.wellFoundedOnstatement · cited by 3
- Set.WellFoundedOn.subsetstatement and proof · cited by 3
- Set.wellFoundedOn_iff_no_descending_seqstatement · cited by 3
- Set.wellFoundedOn_sdiff_singletonstatement and proof · cited by 3
- LinearOrderedCommGroup.wellFoundedOn_setOfPred_le_lt_iff_nonempty_discretestatement and proof · cited by 3