Mathlib Map

Theorems · Theorem · order theory

wellFounded_gt

∀ {α : Type u} [inst : LT α] [WellFoundedGT α], WellFounded fun x1 x2 => x2 < x1
Defined in
Mathlib.Order.RelClasses
Cited by
5 results in Mathlib
Foundations
Depth 3 from the axioms · uses no axioms
Assumes
LTWellFoundedGT
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

CompleteLattice.WellFoundedGT.isSupFiniteCompact · cited by 2WellFoundedGT.isSupFinite…IsLowerSet.eq_empty_or_Iic · cited by 2IsLowerSet.eq_empty_or_IicFinset.exists_sup_ge · cited by 1Finset.exists_sup_geexists_covBy_of_wellFoundedGT · cited by 0exists_covBy_of_wellFound…WellFounded.maximal_wellFounded_lt_max · cited by 0WellFounded.maximal_wellF…WellFoundedGT · cited by 114WellFoundedGTIsWellFounded.wf · cited by 43IsWellFounded.wfwellFounded_gtCITED BYCITES

Cites2

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

Cited by5

Results whose statement or proof uses this declaration.