topology.instances.irrational | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

f2ce6086

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

61db041a

bump to nightly-2024-04-06-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

e34029c9

Diff

@@ -5,7 +5,7 @@ Authors: Yury G. Kudryashov
 -/
 import Data.Real.Irrational
 import Data.Rat.Encodable
-import Topology.MetricSpace.Baire
+import Topology.Baire.Lemmas
 
 #align_import topology.instances.irrational from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"

61db041a

bump to nightly-2024-03-21-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

b0154c5c

Diff

@@ -85,7 +85,7 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ m : ℤ, ε ≤ dist x (m / n) :=
   by
   have A : IsClosed (range (fun m => n⁻¹ * m : ℤ → ℝ)) :=
-    ((isClosedMap_smul₀ (n⁻¹ : ℝ)).comp int.closed_embedding_coe_real.is_closed_map).closed_range
+    ((isClosedMap_smul₀ (n⁻¹ : ℝ)).comp int.closed_embedding_coe_real.is_closed_map).isClosed_range
   have B : x ∉ range (fun m => n⁻¹ * m : ℤ → ℝ) := by rintro ⟨m, rfl⟩; simpa using hx
   rcases Metric.mem_nhds_iff.1 (A.is_open_compl.mem_nhds B) with ⟨ε, ε0, hε⟩
   refine' (ge_mem_nhds ε0).mono fun δ hδ m => not_lt.1 fun hlt => _

61db041a

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -89,7 +89,7 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   have B : x ∉ range (fun m => n⁻¹ * m : ℤ → ℝ) := by rintro ⟨m, rfl⟩; simpa using hx
   rcases Metric.mem_nhds_iff.1 (A.is_open_compl.mem_nhds B) with ⟨ε, ε0, hε⟩
   refine' (ge_mem_nhds ε0).mono fun δ hδ m => not_lt.1 fun hlt => _
-  rw [dist_comm] at hlt 
+  rw [dist_comm] at hlt
   refine' hε (ball_subset_ball hδ hlt) ⟨m, _⟩
   simp [div_eq_inv_mul]
 #align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_div

61db041a

bump to nightly-2024-02-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

42bef5c2

Diff

@@ -38,10 +38,10 @@ open Set Filter Metric
 
 open scoped Filter Topology
 
-#print isGδ_irrational /-
-theorem isGδ_irrational : IsGδ {x | Irrational x} :=
+#print IsGδ.setOf_irrational /-
+theorem IsGδ.setOf_irrational : IsGδ {x | Irrational x} :=
   (countable_range _).isGδ_compl
-#align is_Gδ_irrational isGδ_irrational
+#align is_Gδ_irrational IsGδ.setOf_irrational
 -/
 
 #print dense_irrational /-
@@ -56,7 +56,7 @@ theorem dense_irrational : Dense {x : ℝ | Irrational x} :=
 
 #print eventually_residual_irrational /-
 theorem eventually_residual_irrational : ∀ᶠ x in residual ℝ, Irrational x :=
-  eventually_residual.2 ⟨_, isGδ_irrational, dense_irrational, fun _ => id⟩
+  eventually_residual.2 ⟨_, IsGδ.setOf_irrational, dense_irrational, fun _ => id⟩
 #align eventually_residual_irrational eventually_residual_irrational
 -/

61db041a

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
 -/
-import Mathbin.Data.Real.Irrational
-import Mathbin.Data.Rat.Encodable
-import Mathbin.Topology.MetricSpace.Baire
+import Data.Real.Irrational
+import Data.Rat.Encodable
+import Topology.MetricSpace.Baire
 
 #align_import topology.instances.irrational from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"

61db041a

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
-
-! This file was ported from Lean 3 source module topology.instances.irrational
-! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Real.Irrational
 import Mathbin.Data.Rat.Encodable
 import Mathbin.Topology.MetricSpace.Baire
 
+#align_import topology.instances.irrational from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"
+
 /-!
 # Topology of irrational numbers

61db041a

bump to nightly-2023-07-16-17

mathlib commit https://github.com/leanprover-community/mathlib/commit/2fe465deb81bcd7ccafa065bb686888a82f15372

6db63fa6

Diff

@@ -73,7 +73,7 @@ instance : OrderTopology { x // Irrational x } :=
     ⟨⟨a, ha⟩, hxa, hay⟩
 
 instance : NoMaxOrder { x // Irrational x } :=
-  ⟨fun ⟨x, hx⟩ => ⟨⟨x + (1 : ℕ), hx.addNat 1⟩, by simp⟩⟩
+  ⟨fun ⟨x, hx⟩ => ⟨⟨x + (1 : ℕ), hx.addNatEmb 1⟩, by simp⟩⟩
 
 instance : NoMinOrder { x // Irrational x } :=
   ⟨fun ⟨x, hx⟩ => ⟨⟨x - (1 : ℕ), hx.subNat 1⟩, by simp⟩⟩

61db041a

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -83,6 +83,7 @@ instance : DenselyOrdered { x // Irrational x } :=
     let ⟨z, hz, hxz, hzy⟩ := exists_irrational_btwn hlt
     ⟨⟨z, hz⟩, hxz, hzy⟩⟩
 
+#print Irrational.eventually_forall_le_dist_cast_div /-
 theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ m : ℤ, ε ≤ dist x (m / n) :=
   by
@@ -95,17 +96,22 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   refine' hε (ball_subset_ball hδ hlt) ⟨m, _⟩
   simp [div_eq_inv_mul]
 #align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_div
+-/
 
+#print Irrational.eventually_forall_le_dist_cast_div_of_denom_le /-
 theorem eventually_forall_le_dist_cast_div_of_denom_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ k ≤ n, ∀ (m : ℤ), ε ≤ dist x (m / k) :=
   (finite_le_nat n).eventually_all.2 fun k hk => hx.eventually_forall_le_dist_cast_div k
 #align irrational.eventually_forall_le_dist_cast_div_of_denom_le Irrational.eventually_forall_le_dist_cast_div_of_denom_le
+-/
 
+#print Irrational.eventually_forall_le_dist_cast_rat_of_den_le /-
 theorem eventually_forall_le_dist_cast_rat_of_den_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ r : ℚ, r.den ≤ n → ε ≤ dist x r :=
   (hx.eventually_forall_le_dist_cast_div_of_denom_le n).mono fun ε H r hr => by
     simpa only [Rat.cast_def] using H r.denom hr r.num
 #align irrational.eventually_forall_le_dist_cast_rat_of_denom_le Irrational.eventually_forall_le_dist_cast_rat_of_den_le
+-/
 
 end Irrational

61db041a

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -42,13 +42,13 @@ open Set Filter Metric
 open scoped Filter Topology
 
 #print isGδ_irrational /-
-theorem isGδ_irrational : IsGδ { x | Irrational x } :=
+theorem isGδ_irrational : IsGδ {x | Irrational x} :=
   (countable_range _).isGδ_compl
 #align is_Gδ_irrational isGδ_irrational
 -/
 
 #print dense_irrational /-
-theorem dense_irrational : Dense { x : ℝ | Irrational x } :=
+theorem dense_irrational : Dense {x : ℝ | Irrational x} :=
   by
   refine' real.is_topological_basis_Ioo_rat.dense_iff.2 _
   simp only [mem_Union, mem_singleton_iff]

61db041a

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -91,7 +91,7 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   have B : x ∉ range (fun m => n⁻¹ * m : ℤ → ℝ) := by rintro ⟨m, rfl⟩; simpa using hx
   rcases Metric.mem_nhds_iff.1 (A.is_open_compl.mem_nhds B) with ⟨ε, ε0, hε⟩
   refine' (ge_mem_nhds ε0).mono fun δ hδ m => not_lt.1 fun hlt => _
-  rw [dist_comm] at hlt
+  rw [dist_comm] at hlt 
   refine' hε (ball_subset_ball hδ hlt) ⟨m, _⟩
   simp [div_eq_inv_mul]
 #align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_div

61db041a

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -39,7 +39,7 @@ irrational, residual
 
 open Set Filter Metric
 
-open Filter Topology
+open scoped Filter Topology
 
 #print isGδ_irrational /-
 theorem isGδ_irrational : IsGδ { x | Irrational x } :=

61db041a

bump to nightly-2023-05-28-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

ba5d8b97

Diff

@@ -83,12 +83,6 @@ instance : DenselyOrdered { x // Irrational x } :=
     let ⟨z, hz, hxz, hzy⟩ := exists_irrational_btwn hlt
     ⟨⟨z, hz⟩, hxz, hzy⟩⟩
 
-/- warning: irrational.eventually_forall_le_dist_cast_div -> Irrational.eventually_forall_le_dist_cast_div is a dubious translation:
-lean 3 declaration is
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (m : Int), LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (DivInvMonoid.toHasDiv.{0} Real (DivisionRing.toDivInvMonoid.{0} Real Real.divisionRing))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Int Real (HasLiftT.mk.{1, 1} Int Real (CoeTCₓ.coe.{1, 1} Int Real (Int.castCoe.{0} Real Real.hasIntCast))) m) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) n)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
-but is expected to have type
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (m : Int), LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (LinearOrderedField.toDiv.{0} Real Real.instLinearOrderedFieldReal)) (Int.cast.{0} Real Real.intCast m) (Nat.cast.{0} Real Real.natCast n)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
-Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_divₓ'. -/
 theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ m : ℤ, ε ≤ dist x (m / n) :=
   by
@@ -102,23 +96,11 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   simp [div_eq_inv_mul]
 #align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_div
 
-/- warning: irrational.eventually_forall_le_dist_cast_div_of_denom_le -> Irrational.eventually_forall_le_dist_cast_div_of_denom_le is a dubious translation:
-lean 3 declaration is
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (k : Nat), (LE.le.{0} Nat Nat.hasLe k n) -> (forall (m : Int), LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (DivInvMonoid.toHasDiv.{0} Real (DivisionRing.toDivInvMonoid.{0} Real Real.divisionRing))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Int Real (HasLiftT.mk.{1, 1} Int Real (CoeTCₓ.coe.{1, 1} Int Real (Int.castCoe.{0} Real Real.hasIntCast))) m) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) k))))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
-but is expected to have type
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (k : Nat), (LE.le.{0} Nat instLENat k n) -> (forall (m : Int), LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (LinearOrderedField.toDiv.{0} Real Real.instLinearOrderedFieldReal)) (Int.cast.{0} Real Real.intCast m) (Nat.cast.{0} Real Real.natCast k))))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
-Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_div_of_denom_le Irrational.eventually_forall_le_dist_cast_div_of_denom_leₓ'. -/
 theorem eventually_forall_le_dist_cast_div_of_denom_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ k ≤ n, ∀ (m : ℤ), ε ≤ dist x (m / k) :=
   (finite_le_nat n).eventually_all.2 fun k hk => hx.eventually_forall_le_dist_cast_div k
 #align irrational.eventually_forall_le_dist_cast_div_of_denom_le Irrational.eventually_forall_le_dist_cast_div_of_denom_le
 
-/- warning: irrational.eventually_forall_le_dist_cast_rat_of_denom_le -> Irrational.eventually_forall_le_dist_cast_rat_of_den_le is a dubious translation:
-lean 3 declaration is
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (r : Rat), (LE.le.{0} Nat Nat.hasLe (Rat.den r) n) -> (LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Rat Real (HasLiftT.mk.{1, 1} Rat Real (CoeTCₓ.coe.{1, 1} Rat Real (Rat.castCoe.{0} Real Real.hasRatCast))) r)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
-but is expected to have type
-  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (r : Rat), (LE.le.{0} Nat instLENat (Rat.den r) n) -> (LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (Rat.cast.{0} Real Real.ratCast r)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
-Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_rat_of_denom_le Irrational.eventually_forall_le_dist_cast_rat_of_den_leₓ'. -/
 theorem eventually_forall_le_dist_cast_rat_of_den_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ r : ℚ, r.den ≤ n → ε ≤ dist x r :=
   (hx.eventually_forall_le_dist_cast_div_of_denom_le n).mono fun ε H r hr => by

61db041a

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -94,10 +94,7 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   by
   have A : IsClosed (range (fun m => n⁻¹ * m : ℤ → ℝ)) :=
     ((isClosedMap_smul₀ (n⁻¹ : ℝ)).comp int.closed_embedding_coe_real.is_closed_map).closed_range
-  have B : x ∉ range (fun m => n⁻¹ * m : ℤ → ℝ) :=
-    by
-    rintro ⟨m, rfl⟩
-    simpa using hx
+  have B : x ∉ range (fun m => n⁻¹ * m : ℤ → ℝ) := by rintro ⟨m, rfl⟩; simpa using hx
   rcases Metric.mem_nhds_iff.1 (A.is_open_compl.mem_nhds B) with ⟨ε, ε0, hε⟩
   refine' (ge_mem_nhds ε0).mono fun δ hδ m => not_lt.1 fun hlt => _
   rw [dist_comm] at hlt

61db041a

bump to nightly-2023-05-25-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/ef95945cd48c932c9e034872bd25c3c220d9c946

2175c3c2

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
 
 ! This file was ported from Lean 3 source module topology.instances.irrational
-! leanprover-community/mathlib commit f2ce6086713c78a7f880485f7917ea547a215982
+! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.Topology.MetricSpace.Baire
 /-!
 # Topology of irrational numbers
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 In this file we prove the following theorems:
 
 * `is_Gδ_irrational`, `dense_irrational`, `eventually_residual_irrational`: irrational numbers

f2ce6086

bump to nightly-2023-05-23-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/75e7fca56381d056096ce5d05e938f63a6567828

52e3d5e8

Diff

@@ -38,10 +38,13 @@ open Set Filter Metric
 
 open Filter Topology
 
+#print isGδ_irrational /-
 theorem isGδ_irrational : IsGδ { x | Irrational x } :=
   (countable_range _).isGδ_compl
 #align is_Gδ_irrational isGδ_irrational
+-/
 
+#print dense_irrational /-
 theorem dense_irrational : Dense { x : ℝ | Irrational x } :=
   by
   refine' real.is_topological_basis_Ioo_rat.dense_iff.2 _
@@ -49,10 +52,13 @@ theorem dense_irrational : Dense { x : ℝ | Irrational x } :=
   rintro _ ⟨a, b, hlt, rfl⟩ hne; rw [inter_comm]
   exact exists_irrational_btwn (Rat.cast_lt.2 hlt)
 #align dense_irrational dense_irrational
+-/
 
+#print eventually_residual_irrational /-
 theorem eventually_residual_irrational : ∀ᶠ x in residual ℝ, Irrational x :=
   eventually_residual.2 ⟨_, isGδ_irrational, dense_irrational, fun _ => id⟩
 #align eventually_residual_irrational eventually_residual_irrational
+-/
 
 namespace Irrational
 
@@ -74,6 +80,12 @@ instance : DenselyOrdered { x // Irrational x } :=
     let ⟨z, hz, hxz, hzy⟩ := exists_irrational_btwn hlt
     ⟨⟨z, hz⟩, hxz, hzy⟩⟩
 
+/- warning: irrational.eventually_forall_le_dist_cast_div -> Irrational.eventually_forall_le_dist_cast_div is a dubious translation:
+lean 3 declaration is
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (m : Int), LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (DivInvMonoid.toHasDiv.{0} Real (DivisionRing.toDivInvMonoid.{0} Real Real.divisionRing))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Int Real (HasLiftT.mk.{1, 1} Int Real (CoeTCₓ.coe.{1, 1} Int Real (Int.castCoe.{0} Real Real.hasIntCast))) m) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) n)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
+but is expected to have type
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (m : Int), LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (LinearOrderedField.toDiv.{0} Real Real.instLinearOrderedFieldReal)) (Int.cast.{0} Real Real.intCast m) (Nat.cast.{0} Real Real.natCast n)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
+Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_divₓ'. -/
 theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ m : ℤ, ε ≤ dist x (m / n) :=
   by
@@ -90,11 +102,23 @@ theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
   simp [div_eq_inv_mul]
 #align irrational.eventually_forall_le_dist_cast_div Irrational.eventually_forall_le_dist_cast_div
 
+/- warning: irrational.eventually_forall_le_dist_cast_div_of_denom_le -> Irrational.eventually_forall_le_dist_cast_div_of_denom_le is a dubious translation:
+lean 3 declaration is
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (k : Nat), (LE.le.{0} Nat Nat.hasLe k n) -> (forall (m : Int), LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (DivInvMonoid.toHasDiv.{0} Real (DivisionRing.toDivInvMonoid.{0} Real Real.divisionRing))) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Int Real (HasLiftT.mk.{1, 1} Int Real (CoeTCₓ.coe.{1, 1} Int Real (Int.castCoe.{0} Real Real.hasIntCast))) m) ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Nat Real (HasLiftT.mk.{1, 1} Nat Real (CoeTCₓ.coe.{1, 1} Nat Real (Nat.castCoe.{0} Real Real.hasNatCast))) k))))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
+but is expected to have type
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (k : Nat), (LE.le.{0} Nat instLENat k n) -> (forall (m : Int), LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (HDiv.hDiv.{0, 0, 0} Real Real Real (instHDiv.{0} Real (LinearOrderedField.toDiv.{0} Real Real.instLinearOrderedFieldReal)) (Int.cast.{0} Real Real.intCast m) (Nat.cast.{0} Real Real.natCast k))))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
+Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_div_of_denom_le Irrational.eventually_forall_le_dist_cast_div_of_denom_leₓ'. -/
 theorem eventually_forall_le_dist_cast_div_of_denom_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ k ≤ n, ∀ (m : ℤ), ε ≤ dist x (m / k) :=
   (finite_le_nat n).eventually_all.2 fun k hk => hx.eventually_forall_le_dist_cast_div k
 #align irrational.eventually_forall_le_dist_cast_div_of_denom_le Irrational.eventually_forall_le_dist_cast_div_of_denom_le
 
+/- warning: irrational.eventually_forall_le_dist_cast_rat_of_denom_le -> Irrational.eventually_forall_le_dist_cast_rat_of_den_le is a dubious translation:
+lean 3 declaration is
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (r : Rat), (LE.le.{0} Nat Nat.hasLe (Rat.den r) n) -> (LE.le.{0} Real Real.hasLe ε (Dist.dist.{0} Real (PseudoMetricSpace.toHasDist.{0} Real Real.pseudoMetricSpace) x ((fun (a : Type) (b : Type) [self : HasLiftT.{1, 1} a b] => self.0) Rat Real (HasLiftT.mk.{1, 1} Rat Real (CoeTCₓ.coe.{1, 1} Rat Real (Rat.castCoe.{0} Real Real.hasRatCast))) r)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (OfNat.mk.{0} Real 0 (Zero.zero.{0} Real Real.hasZero)))))
+but is expected to have type
+  forall {x : Real}, (Irrational x) -> (forall (n : Nat), Filter.Eventually.{0} Real (fun (ε : Real) => forall (r : Rat), (LE.le.{0} Nat instLENat (Rat.den r) n) -> (LE.le.{0} Real Real.instLEReal ε (Dist.dist.{0} Real (PseudoMetricSpace.toDist.{0} Real Real.pseudoMetricSpace) x (Rat.cast.{0} Real Real.ratCast r)))) (nhds.{0} Real (UniformSpace.toTopologicalSpace.{0} Real (PseudoMetricSpace.toUniformSpace.{0} Real Real.pseudoMetricSpace)) (OfNat.ofNat.{0} Real 0 (Zero.toOfNat0.{0} Real Real.instZeroReal))))
+Case conversion may be inaccurate. Consider using '#align irrational.eventually_forall_le_dist_cast_rat_of_denom_le Irrational.eventually_forall_le_dist_cast_rat_of_den_leₓ'. -/
 theorem eventually_forall_le_dist_cast_rat_of_den_le (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ r : ℚ, r.den ≤ n → ε ≤ dist x r :=
   (hx.eventually_forall_le_dist_cast_div_of_denom_le n).mono fun ε H r hr => by

f2ce6086

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

f2ce6086

chore: rename open_range to isOpen_range, closed_range to isClosed_range (#11438)

All these lemmas refer to the range of some function being open/range (i.e. isOpen or isClosed).

75784e0d

Diff

@@ -78,7 +78,7 @@ instance : DenselyOrdered { x // Irrational x } :=
 theorem eventually_forall_le_dist_cast_div (hx : Irrational x) (n : ℕ) :
     ∀ᶠ ε : ℝ in 𝓝 0, ∀ m : ℤ, ε ≤ dist x (m / n) := by
   have A : IsClosed (range (fun m => (n : ℝ)⁻¹ * m : ℤ → ℝ)) :=
-    ((isClosedMap_smul₀ (n⁻¹ : ℝ)).comp Int.closedEmbedding_coe_real.isClosedMap).closed_range
+    ((isClosedMap_smul₀ (n⁻¹ : ℝ)).comp Int.closedEmbedding_coe_real.isClosedMap).isClosed_range
   have B : x ∉ range (fun m => (n : ℝ)⁻¹ * m : ℤ → ℝ) := by
     rintro ⟨m, rfl⟩
     simp at hx

f2ce6086

chore(Topology/GDelta): use new-style dot notation (#10583)

Rename many isGδ_some lemmas to IsGδ.some. Also resolve a TODO.

2be6479c

Diff

@@ -5,7 +5,7 @@ Authors: Yury G. Kudryashov
 -/
 import Mathlib.Data.Real.Irrational
 import Mathlib.Data.Rat.Encodable
-import Mathlib.Topology.MetricSpace.Baire
+import Mathlib.Topology.GDelta
 
 #align_import topology.instances.irrational from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982"
 
@@ -14,7 +14,7 @@ import Mathlib.Topology.MetricSpace.Baire
 
 In this file we prove the following theorems:
 
-* `isGδ_irrational`, `dense_irrational`, `eventually_residual_irrational`: irrational numbers
+* `IsGδ.setOf_irrational`, `dense_irrational`, `eventually_residual_irrational`: irrational numbers
   form a dense Gδ set;
 
 * `Irrational.eventually_forall_le_dist_cast_div`,
@@ -35,10 +35,12 @@ open Set Filter Metric
 
 open Filter Topology
 
-theorem isGδ_irrational : IsGδ { x | Irrational x } :=
+protected theorem IsGδ.setOf_irrational : IsGδ { x | Irrational x } :=
   (countable_range _).isGδ_compl
 set_option linter.uppercaseLean3 false in
-#align is_Gδ_irrational isGδ_irrational
+#align is_Gδ_irrational IsGδ.setOf_irrational
+
+@[deprecated] alias isGδ_irrational := IsGδ.setOf_irrational
 
 theorem dense_irrational : Dense { x : ℝ | Irrational x } := by
   refine' Real.isTopologicalBasis_Ioo_rat.dense_iff.2 _
@@ -50,7 +52,7 @@ theorem dense_irrational : Dense { x : ℝ | Irrational x } := by
 #align dense_irrational dense_irrational
 
 theorem eventually_residual_irrational : ∀ᶠ x in residual ℝ, Irrational x :=
-  eventually_residual.2 ⟨_, isGδ_irrational, dense_irrational, fun _ => id⟩
+  residual_of_dense_Gδ .setOf_irrational dense_irrational
 #align eventually_residual_irrational eventually_residual_irrational
 
 namespace Irrational

f2ce6086

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury G. Kudryashov
-
-! This file was ported from Lean 3 source module topology.instances.irrational
-! leanprover-community/mathlib commit f2ce6086713c78a7f880485f7917ea547a215982
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Real.Irrational
 import Mathlib.Data.Rat.Encodable
 import Mathlib.Topology.MetricSpace.Baire
 
+#align_import topology.instances.irrational from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982"
+
 /-!
 # Topology of irrational numbers

f2ce6086

feat: port Topology.Instances.Irrational (#4244)

4ecc5d58

`topology.instances.irrational` ⟷ `Mathlib.Topology.Instances.Irrational`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 769

topology.instances.irrational ⟷ Mathlib.Topology.Instances.Irrational

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 769

`topology.instances.irrational` ⟷ `Mathlib.Topology.Instances.Irrational`