Theorems · Theorem · logic and foundations
OrdinalApprox.lfpApprox_le_of_mem_fixedPoints
∀ {α : Type u} [inst : CompleteLattice α] (f : α →o α) {x a : α},
a ∈ Function.fixedPoints ⇑f → x ≤ a → ∀ (i : Ordinal.{u}), OrdinalApprox.lfpApprox f x i ≤ aEvery value of the approximation is less or equal than every fixed point of f
greater or equal than the initial value
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 43 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.
Cites12
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
- Function.fixedPointsstatement and proof · cited by 90
- OrderHom.monoproof · cited by 28
- WellFoundedLT.inductionproof · cited by 24
- OrdinalApprox.lfpApproxstatement and proof · cited by 21
- iSup₂_le_iffproof · cited by 19
- Function.IsFixedPt.eqproof · cited by 14
Cited by3
Results whose statement or proof uses this declaration.
- OrdinalApprox.lfpApprox_ord_eq_lfpproof · cited by 2
- OrdinalApprox.nextFixed_eq_iSup_lfpApproxproof · cited by 1
- OrdinalApprox.le_gfpApprox_of_mem_fixedPointsproof · cited by 0