Theorems · Theorem · order theory

WellFoundedGT.fix_eq

∀ {α : Type u} [inst : LT α] [inst_1 : WellFoundedGT α] {motive : α → Sort u_1}
  (ind : (x : α) → ((y : α) → x < y → motive y) → motive x) (x : α),
  WellFoundedGT.fix ind x = ind x fun y x => WellFoundedGT.fix ind y

The value from WellFoundedGT.fix is built from the successive ones as specified.

Defined in: Mathlib.Order.RelClasses
Cited by: 0 results in Mathlib
Foundations: Depth 8 from the axioms · uses no axioms
Assumes: LT WellFoundedGT

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites3

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

WellFoundedGTstatement and proof · cited by 114
IsWellFounded.fix_eqproof · cited by 2
WellFoundedGT.fixstatement · cited by 1

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.