Theorems · Theorem · logic and foundations
OrdinalApprox.gfpApprox_ord_mem_fixedPoint
∀ {α : Type u} [inst : CompleteLattice α] (f : α →o α) {x : α},
f x ≤ x → OrdinalApprox.gfpApprox f x (Order.succ (Cardinal.mk α)).ord ∈ Function.fixedPoints ⇑fThe approximation at the index of the successor of the domain's cardinality is a fixed point
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 82 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
- Cardinalstatement · cited by 2,598
- CompleteLatticestatement and proof · cited by 1,048
- Cardinal.mkstatement · cited by 942
- OrderHomstatement and proof · cited by 934
- Order.succstatement · cited by 633
- Cardinal.ordstatement · cited by 266
- Function.fixedPointsstatement · cited by 90
- OrderHom.dualproof · cited by 48
- OrdinalApprox.gfpApproxstatement · cited by 23
- OrdinalApprox.lfpApprox_ord_mem_fixedPointproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- CantorBendixson.iteratedDerivedSet_mem_fixedPointsproof · cited by 1