Mathlib Map

Theorems · Inductive type · order theory

IsWellFounded

(α : Type u) → (α → α → Prop) → Prop

A well-founded relation. Not to be confused with IsWellOrder.

Defined in
Mathlib.Order.RelClasses
Cited by
18 results in Mathlib
Foundations
Depth 0 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

WellFoundedLT · cited by 491WellFoundedLTWellFoundedGT · cited by 114WellFoundedGTIsWellFounded.wf · cited by 43IsWellFounded.wfWfDvdMonoid · cited by 37WfDvdMonoidIsWellFounded.rank · cited by 9IsWellFounded.rankisWellFounded_iff · cited by 9isWellFounded_iffIsWellFounded.apply · cited by 5IsWellFounded.applyIsWellFounded.induction · cited by 5IsWellFounded.inductionIsWellFounded.rank_lt_of_rel · cited by 4IsWellFounded.rank_lt_of_…Subrelation.isWellFounded · cited by 4Subrelation.isWellFoundedIsWellFounded.fix_eq · cited by 2IsWellFounded.fix_eqIsWellFounded.rank_eq · cited by 2IsWellFounded.rank_eqisCofinal_setOfPred_imp_lt · cited by 2isCofinal_setOfPred_imp_ltIsWellFounded.casesOn · cited by 1IsWellFounded.casesOnIsWellFounded.fix · cited by 1IsWellFounded.fixIsWellFoundedCITED BYCITES

Cites0

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Nothing in Mathlib beyond the foundations.

Cited by31

Results whose statement or proof uses this declaration.