Skip to content

Commit cb94a5c

Browse files
committed
adapt to upstream changes
1 parent 8e2d689 commit cb94a5c

1 file changed

Lines changed: 12 additions & 10 deletions

File tree

Mathlib/Topology/CantorBendixson.lean

Lines changed: 12 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -99,16 +99,18 @@ theorem iteratedDerivedSet_limit (ha : Order.IsSuccLimit a) :
9999
is equal to the original set. -/
100100
theorem iteratedDerivedSet_constant_iff_preperfect :
101101
Preperfect s ↔ ∀ a : Ordinal, sᵈ[a] = s := by
102-
simp only [preperfect_iff_subset_derivedSet]
102+
simp only [preperfect_iff_eq_relDerivedSet]
103103
constructor <;> intro h
104104
· intro a
105-
rw [iteratedDerivedSet,
106-
gfpApprox_eq_of_mem_fixedPoints _ s relDerivedSet_subset (zero_le a)]
107-
· simp [gfpApprox_zero]
108-
simpa [Function.IsFixedPt, gfpApprox_zero, relDerivedSet] using h
109-
· specialize h 1
110-
rw [← zero_add 1, iteratedDerivedSet_succ] at h
111-
simpa [relDerivedSet] using h
105+
induction a using Ordinal.limitRecOn with
106+
| zero => simp
107+
| succ a ha => nth_rw 2 [h] ; simp [ha]
108+
| limit a ha ih =>
109+
simp only [iteratedDerivedSet_limit ha]
110+
haveI : Nonempty ↑(Iio a) := nonempty_subtype.mpr ⟨0, mem_Iio.mpr ha.bot_lt⟩
111+
exact iInter_eq_const (by simpa using ih)
112+
· specialize h 1 ; symm
113+
rwa [← zero_add 1, iteratedDerivedSet_succ, iteratedDerivedSet_zero] at h
112114

113115
theorem isClosed_iteratedDerivedSet (hs : IsClosed s) :
114116
∀ a : Ordinal, IsClosed (sᵈ[a]) := by
@@ -142,15 +144,15 @@ theorem stayOn.mono (h : stayOn s a) (hle : a ≤ b) :
142144
theorem stayOn_of_iteratedDerivedSet_succ_eq (ha : sᵈ[a + 1] = sᵈ[a]) :
143145
stayOn s a := by
144146
exact fun b hab =>
145-
gfpApprox_eq_of_mem_fixedPoints _ s relDerivedSet_subset hab <|
147+
gfpApprox_eq_of_mem_fixedPoints _ s hab <|
146148
Function.mem_fixedPoints_iff.mpr <| by simpa using ha
147149

148150
variable (s)
149151

150152
theorem iteratedDerivedSet_stay :
151153
∃ a : Ordinal, stayOn s a := by
152154
exact ⟨(Order.succ #(Set X)).ord, fun b hb =>
153-
gfpApprox_eq_of_mem_fixedPoints _ s relDerivedSet_subset hb <|
155+
gfpApprox_eq_of_mem_fixedPoints _ s hb <|
154156
gfpApprox_ord_mem_fixedPoint _ s relDerivedSet_subset⟩
155157

156158
/-- The perfect kernel of a set, defined as the intersection of all iterated derived sets. It is

0 commit comments

Comments
 (0)