Theorems · Theorem · logic and foundations
OrdinalApprox.lfpApprox_eq_of_mem_fixedPoints
∀ {α : Type u} [inst : CompleteLattice α] (f : α →o α) {x : α} {a b : Ordinal.{u}},
a ≤ b →
OrdinalApprox.lfpApprox f x a ∈ Function.fixedPoints ⇑f →
OrdinalApprox.lfpApprox f x b = OrdinalApprox.lfpApprox f x aThe approximations of the least fixed point stabilize at a fixed point of f
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 44 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement · cited by 53,352
- Ordinalstatement and proof · cited by 1,688
- CompleteLatticestatement and proof · cited by 1,048
- OrderHomstatement and proof · cited by 934
- sup_leproof · cited by 159
- LE.le.antisymm'proof · cited by 104
- Function.fixedPointsstatement and proof · cited by 90
- WellFoundedLT.inductionproof · cited by 24
- OrdinalApprox.lfpApproxstatement and proof · cited by 21
- iSup₂_le_iffproof · cited by 19
- Function.mem_fixedPoints_iffproof · cited by 16
Cited by4
Results whose statement or proof uses this declaration.
- OrdinalApprox.lfpApprox_mem_fixedPoints_of_eqproof · cited by 3
- OrdinalApprox.lfpApprox_eq_all_of_fixedPointproof · cited by 2
- OrdinalApprox.iSup_lfpApprox_eq_of_mem_fixedPointsproof · cited by 2
- OrdinalApprox.gfpApprox_eq_of_mem_fixedPointsproof · cited by 1