Theorems · Theorem · general topology
CantorBendixson.perfectKernel_eq_iteratedDerivedSet_of_mem_fixedPoints
∀ {X : Type u} [inst : TopologicalSpace X] {s : Set X} {a : Ordinal.{u}},
CantorBendixson.iteratedDerivedSet s a ∈ Function.fixedPoints ⇑relDerivedSet →
CantorBendixson.perfectKernel s = CantorBendixson.iteratedDerivedSet s aOnce sᵈ[a] is a fixed point of relDerivSet, the perfect kernel equals sᵈ[a].
- Defined in
- Mathlib.Topology.CantorBendixson
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- TopologicalSpace
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
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 and proof · cited by 53,352
- TopologicalSpacestatement and proof · cited by 24,529
- LT.lt.leproof · cited by 2,189
- le_antisymmproof · cited by 2,068
- Ordinalstatement and proof · cited by 1,688
- OrderHomstatement · cited by 934
- Eq.geproof · cited by 375
- lt_or_geproof · cited by 182
- Function.fixedPointsstatement and proof · cited by 90
- Set.subset_iInterproof · cited by 17
- relDerivedSetstatement and proof · cited by 14
Cited by1
Results whose statement or proof uses this declaration.
- CantorBendixson.perfect_perfectKernelproof · cited by 1