Skip to content

Commit 9525089

Browse files
committed
chore: erw in Topology/Order/ (#23336)
1 parent d801031 commit 9525089

File tree

4 files changed

+6
-7
lines changed

4 files changed

+6
-7
lines changed

Mathlib/Topology/Order/LawsonTopology.lean

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -143,7 +143,7 @@ instance instIsLawson : IsLawson (WithLawson α) := ⟨rfl⟩
143143
/-- If `α` is equipped with the Lawson topology, then it is homeomorphic to `WithLawson α`.
144144
-/
145145
def homeomorph [TopologicalSpace α] [IsLawson α] : WithLawson α ≃ₜ α :=
146-
ofLawson.toHomeomorphOfIsInducing ⟨by erw [IsLawson.topology_eq_lawson (α := α), induced_id]; rfl
146+
ofLawson.toHomeomorphOfIsInducing ⟨IsLawson.topology_eq_lawson (α := α) ▸ induced_id.symm
147147

148148
theorem isOpen_preimage_ofLawson {S : Set α} :
149149
IsOpen (ofLawson ⁻¹' S) ↔ (lawson α).IsOpen S := Iff.rfl

Mathlib/Topology/Order/LowerUpperTopology.lean

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -233,7 +233,7 @@ variable {α}
233233
/-- If `α` is equipped with the lower topology, then it is homeomorphic to `WithLower α`.
234234
-/
235235
def withLowerHomeomorph : WithLower α ≃ₜ α :=
236-
WithLower.ofLower.toHomeomorphOfIsInducing ⟨by erw [topology_eq α, induced_id]; rfl
236+
WithLower.ofLower.toHomeomorphOfIsInducing ⟨topology_eq α ▸ induced_id.symm
237237

238238
theorem isOpen_iff_generate_Ici_compl : IsOpen s ↔ GenerateOpen { t | ∃ a, (Ici a)ᶜ = t } s := by
239239
rw [topology_eq α]; rfl
@@ -394,7 +394,7 @@ variable {α}
394394
/-- If `α` is equipped with the upper topology, then it is homeomorphic to `WithUpper α`.
395395
-/
396396
def withUpperHomeomorph : WithUpper α ≃ₜ α :=
397-
WithUpper.ofUpper.toHomeomorphOfIsInducing ⟨by erw [topology_eq α, induced_id]; rfl
397+
WithUpper.ofUpper.toHomeomorphOfIsInducing ⟨topology_eq α ▸ induced_id.symm
398398

399399
theorem isOpen_iff_generate_Iic_compl : IsOpen s ↔ GenerateOpen { t | ∃ a, (Iic a)ᶜ = t } s := by
400400
rw [topology_eq α]; rfl

Mathlib/Topology/Order/ScottTopology.lean

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -424,8 +424,7 @@ variable [TopologicalSpace α]
424424
/-- If `α` is equipped with the Scott topology, then it is homeomorphic to `WithScott α`.
425425
-/
426426
def IsScott.withScottHomeomorph [IsScott α univ] : WithScott α ≃ₜ α :=
427-
WithScott.ofScott.toHomeomorphOfIsInducing ⟨by
428-
rw [IsScott.topology_eq α univ]; erw [induced_id]; rfl⟩
427+
WithScott.ofScott.toHomeomorphOfIsInducing ⟨IsScott.topology_eq α univ ▸ induced_id.symm⟩
429428

430429
lemma IsScott.scottHausdorff_le [IsScott α univ] :
431430
scottHausdorff α univ ≤ ‹TopologicalSpace α› := by

Mathlib/Topology/Order/UpperLowerSetTopology.lean

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -220,7 +220,7 @@ instance _root_.OrderDual.instIsLowerSet [Preorder α] [TopologicalSpace α] [To
220220
/-- If `α` is equipped with the upper set topology, then it is homeomorphic to
221221
`WithUpperSet α`. -/
222222
def WithUpperSetHomeomorph : WithUpperSet α ≃ₜ α :=
223-
WithUpperSet.ofUpperSet.toHomeomorphOfIsInducing ⟨by erw [topology_eq α, induced_id]; rfl
223+
WithUpperSet.ofUpperSet.toHomeomorphOfIsInducing ⟨topology_eq α ▸ induced_id.symm
224224

225225
lemma isOpen_iff_isUpperSet : IsOpen s ↔ IsUpperSet s := by
226226
rw [topology_eq α]
@@ -305,7 +305,7 @@ instance _root_.OrderDual.instIsUpperSet [Preorder α] [TopologicalSpace α] [To
305305

306306
/-- If `α` is equipped with the lower set topology, then it is homeomorphic to `WithLowerSet α`. -/
307307
def WithLowerSetHomeomorph : WithLowerSet α ≃ₜ α :=
308-
WithLowerSet.ofLowerSet.toHomeomorphOfIsInducing ⟨by erw [topology_eq α, induced_id]; rfl
308+
WithLowerSet.ofLowerSet.toHomeomorphOfIsInducing ⟨topology_eq α ▸ induced_id.symm
309309

310310
lemma isOpen_iff_isLowerSet : IsOpen s ↔ IsLowerSet s := by rw [topology_eq α]; rfl
311311

0 commit comments

Comments
 (0)