topology.algebra.order.filter | 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

98e83c3d

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

ad0089ac

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.Topology.Order.Basic
-import Mathbin.Topology.Filter
+import Topology.Order.Basic
+import Topology.Filter
 
 #align_import topology.algebra.order.filter from "leanprover-community/mathlib"@"ad0089aca372256fe53dde13ca0dfea569bf5ac7"

ad0089ac

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module topology.algebra.order.filter
-! leanprover-community/mathlib commit ad0089aca372256fe53dde13ca0dfea569bf5ac7
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Topology.Order.Basic
 import Mathbin.Topology.Filter
 
+#align_import topology.algebra.order.filter from "leanprover-community/mathlib"@"ad0089aca372256fe53dde13ca0dfea569bf5ac7"
+
 /-!
 # Topology on filters of a space with order topology

ad0089ac

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -28,23 +28,31 @@ namespace Filter
 
 variable {α X : Type _} [TopologicalSpace X] [PartialOrder X] [OrderTopology X]
 
+#print Filter.tendsto_nhds_atTop /-
 protected theorem tendsto_nhds_atTop [NoMaxOrder X] : Tendsto 𝓝 (atTop : Filter X) (𝓝 atTop) :=
   Filter.tendsto_nhds_atTop_iff.2 fun x => (eventually_gt_atTop x).mono fun y => le_mem_nhds
 #align filter.tendsto_nhds_at_top Filter.tendsto_nhds_atTop
+-/
 
+#print Filter.tendsto_nhds_atBot /-
 protected theorem tendsto_nhds_atBot [NoMinOrder X] : Tendsto 𝓝 (atBot : Filter X) (𝓝 atBot) :=
   @Filter.tendsto_nhds_atTop Xᵒᵈ _ _ _ _
 #align filter.tendsto_nhds_at_bot Filter.tendsto_nhds_atBot
+-/
 
+#print Filter.Tendsto.nhds_atTop /-
 theorem Tendsto.nhds_atTop [NoMaxOrder X] {f : α → X} {l : Filter α} (h : Tendsto f l atTop) :
     Tendsto (𝓝 ∘ f) l (𝓝 atTop) :=
   Filter.tendsto_nhds_atTop.comp h
 #align filter.tendsto.nhds_at_top Filter.Tendsto.nhds_atTop
+-/
 
+#print Filter.Tendsto.nhds_atBot /-
 theorem Tendsto.nhds_atBot [NoMinOrder X] {f : α → X} {l : Filter α} (h : Tendsto f l atBot) :
     Tendsto (𝓝 ∘ f) l (𝓝 atBot) :=
   @Tendsto.nhds_atTop α Xᵒᵈ _ _ _ _ _ _ h
 #align filter.tendsto.nhds_at_bot Filter.Tendsto.nhds_atBot
+-/
 
 end Filter

ad0089ac

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -22,7 +22,7 @@ In this file we prove that `𝓝 (f x)` tends to `𝓝 filter.at_top` provided t
 -/
 
 
-open Topology
+open scoped Topology
 
 namespace Filter

ad0089ac

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -28,43 +28,19 @@ namespace Filter
 
 variable {α X : Type _} [TopologicalSpace X] [PartialOrder X] [OrderTopology X]
 
-/- warning: filter.tendsto_nhds_at_top -> Filter.tendsto_nhds_atTop is a dubious translation:
-lean 3 declaration is
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMaxOrder.{u1} X (Preorder.toHasLt.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
-but is expected to have type
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMaxOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.instTopologicalSpaceFilter.{u1} X) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
-Case conversion may be inaccurate. Consider using '#align filter.tendsto_nhds_at_top Filter.tendsto_nhds_atTopₓ'. -/
 protected theorem tendsto_nhds_atTop [NoMaxOrder X] : Tendsto 𝓝 (atTop : Filter X) (𝓝 atTop) :=
   Filter.tendsto_nhds_atTop_iff.2 fun x => (eventually_gt_atTop x).mono fun y => le_mem_nhds
 #align filter.tendsto_nhds_at_top Filter.tendsto_nhds_atTop
 
-/- warning: filter.tendsto_nhds_at_bot -> Filter.tendsto_nhds_atBot is a dubious translation:
-lean 3 declaration is
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMinOrder.{u1} X (Preorder.toHasLt.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
-but is expected to have type
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMinOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.instTopologicalSpaceFilter.{u1} X) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
-Case conversion may be inaccurate. Consider using '#align filter.tendsto_nhds_at_bot Filter.tendsto_nhds_atBotₓ'. -/
 protected theorem tendsto_nhds_atBot [NoMinOrder X] : Tendsto 𝓝 (atBot : Filter X) (𝓝 atBot) :=
   @Filter.tendsto_nhds_atTop Xᵒᵈ _ _ _ _
 #align filter.tendsto_nhds_at_bot Filter.tendsto_nhds_atBot
 
-/- warning: filter.tendsto.nhds_at_top -> Filter.Tendsto.nhds_atTop is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMaxOrder.{u2} X (Preorder.toHasLt.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
-but is expected to have type
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMaxOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.instTopologicalSpaceFilter.{u2} X) (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
-Case conversion may be inaccurate. Consider using '#align filter.tendsto.nhds_at_top Filter.Tendsto.nhds_atTopₓ'. -/
 theorem Tendsto.nhds_atTop [NoMaxOrder X] {f : α → X} {l : Filter α} (h : Tendsto f l atTop) :
     Tendsto (𝓝 ∘ f) l (𝓝 atTop) :=
   Filter.tendsto_nhds_atTop.comp h
 #align filter.tendsto.nhds_at_top Filter.Tendsto.nhds_atTop
 
-/- warning: filter.tendsto.nhds_at_bot -> Filter.Tendsto.nhds_atBot is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMinOrder.{u2} X (Preorder.toHasLt.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
-but is expected to have type
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMinOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.instTopologicalSpaceFilter.{u2} X) (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
-Case conversion may be inaccurate. Consider using '#align filter.tendsto.nhds_at_bot Filter.Tendsto.nhds_atBotₓ'. -/
 theorem Tendsto.nhds_atBot [NoMinOrder X] {f : α → X} {l : Filter α} (h : Tendsto f l atBot) :
     Tendsto (𝓝 ∘ f) l (𝓝 atBot) :=
   @Tendsto.nhds_atTop α Xᵒᵈ _ _ _ _ _ _ h

ad0089ac

bump to nightly-2023-05-16-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/0b9eaaa7686280fad8cce467f5c3c57ee6ce77f8

9cb92e8c

Diff

@@ -30,7 +30,7 @@ variable {α X : Type _} [TopologicalSpace X] [PartialOrder X] [OrderTopology X]
 
 /- warning: filter.tendsto_nhds_at_top -> Filter.tendsto_nhds_atTop is a dubious translation:
 lean 3 declaration is
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMaxOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
+  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMaxOrder.{u1} X (Preorder.toHasLt.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
 but is expected to have type
   forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMaxOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.instTopologicalSpaceFilter.{u1} X) (Filter.atTop.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
 Case conversion may be inaccurate. Consider using '#align filter.tendsto_nhds_at_top Filter.tendsto_nhds_atTopₓ'. -/
@@ -40,7 +40,7 @@ protected theorem tendsto_nhds_atTop [NoMaxOrder X] : Tendsto 𝓝 (atTop : Filt
 
 /- warning: filter.tendsto_nhds_at_bot -> Filter.tendsto_nhds_atBot is a dubious translation:
 lean 3 declaration is
-  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMinOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
+  forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMinOrder.{u1} X (Preorder.toHasLt.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.topologicalSpace.{u1} X) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
 but is expected to have type
   forall {X : Type.{u1}} [_inst_1 : TopologicalSpace.{u1} X] [_inst_2 : PartialOrder.{u1} X] [_inst_3 : OrderTopology.{u1} X _inst_1 (PartialOrder.toPreorder.{u1} X _inst_2)] [_inst_4 : NoMinOrder.{u1} X (Preorder.toLT.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2))], Filter.Tendsto.{u1, u1} X (Filter.{u1} X) (nhds.{u1} X _inst_1) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)) (nhds.{u1} (Filter.{u1} X) (Filter.instTopologicalSpaceFilter.{u1} X) (Filter.atBot.{u1} X (PartialOrder.toPreorder.{u1} X _inst_2)))
 Case conversion may be inaccurate. Consider using '#align filter.tendsto_nhds_at_bot Filter.tendsto_nhds_atBotₓ'. -/
@@ -50,7 +50,7 @@ protected theorem tendsto_nhds_atBot [NoMinOrder X] : Tendsto 𝓝 (atBot : Filt
 
 /- warning: filter.tendsto.nhds_at_top -> Filter.Tendsto.nhds_atTop is a dubious translation:
 lean 3 declaration is
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMaxOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
+  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMaxOrder.{u2} X (Preorder.toHasLt.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
 but is expected to have type
   forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMaxOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.instTopologicalSpaceFilter.{u2} X) (Filter.atTop.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
 Case conversion may be inaccurate. Consider using '#align filter.tendsto.nhds_at_top Filter.Tendsto.nhds_atTopₓ'. -/
@@ -61,7 +61,7 @@ theorem Tendsto.nhds_atTop [NoMaxOrder X] {f : α → X} {l : Filter α} (h : Te
 
 /- warning: filter.tendsto.nhds_at_bot -> Filter.Tendsto.nhds_atBot is a dubious translation:
 lean 3 declaration is
-  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMinOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
+  forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMinOrder.{u2} X (Preorder.toHasLt.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.topologicalSpace.{u2} X) (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
 but is expected to have type
   forall {α : Type.{u1}} {X : Type.{u2}} [_inst_1 : TopologicalSpace.{u2} X] [_inst_2 : PartialOrder.{u2} X] [_inst_3 : OrderTopology.{u2} X _inst_1 (PartialOrder.toPreorder.{u2} X _inst_2)] [_inst_4 : NoMinOrder.{u2} X (Preorder.toLT.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))] {f : α -> X} {l : Filter.{u1} α}, (Filter.Tendsto.{u1, u2} α X f l (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))) -> (Filter.Tendsto.{u1, u2} α (Filter.{u2} X) (Function.comp.{succ u1, succ u2, succ u2} α X (Filter.{u2} X) (nhds.{u2} X _inst_1) f) l (nhds.{u2} (Filter.{u2} X) (Filter.instTopologicalSpaceFilter.{u2} X) (Filter.atBot.{u2} X (PartialOrder.toPreorder.{u2} X _inst_2))))
 Case conversion may be inaccurate. Consider using '#align filter.tendsto.nhds_at_bot Filter.Tendsto.nhds_atBotₓ'. -/

ad0089ac

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

98e83c3d

move(Topology/Order): Move anything that doesn't concern algebra (#11610)

Move files from Topology.Algebra.Order to Topology.Order when they do not contain any algebra. Also move Topology.LocalExtr to Topology.Order.LocalExtr.

According to git, the moves are:

Mathlib/Topology/{Algebra => }/Order/ExtendFrom.lean
Mathlib/Topology/{Algebra => }/Order/ExtrClosure.lean
Mathlib/Topology/{Algebra => }/Order/Filter.lean
Mathlib/Topology/{Algebra => }/Order/IntermediateValue.lean
Mathlib/Topology/{Algebra => }/Order/LeftRight.lean
Mathlib/Topology/{Algebra => }/Order/LeftRightLim.lean
Mathlib/Topology/{Algebra => }/Order/MonotoneContinuity.lean
Mathlib/Topology/{Algebra => }/Order/MonotoneConvergence.lean
Mathlib/Topology/{Algebra => }/Order/ProjIcc.lean
Mathlib/Topology/{Algebra => }/Order/T5.lean
Mathlib/Topology/{ => Order}/LocalExtr.lean

cd9902cc

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathlib.Topology.Order.Basic
 import Mathlib.Topology.Filter
+import Mathlib.Topology.Order.Basic
 
 #align_import topology.algebra.order.filter from "leanprover-community/mathlib"@"98e83c3d541c77cdb7da20d79611a780ff8e7d90"

98e83c3d

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -20,7 +20,7 @@ open Topology
 
 namespace Filter
 
-variable {α X : Type _} [TopologicalSpace X] [PartialOrder X] [OrderTopology X]
+variable {α X : Type*} [TopologicalSpace X] [PartialOrder X] [OrderTopology X]
 
 protected theorem tendsto_nhds_atTop [NoMaxOrder X] : Tendsto 𝓝 (atTop : Filter X) (𝓝 atTop) :=
   Filter.tendsto_nhds_atTop_iff.2 fun x => (eventually_gt_atTop x).mono fun _ => le_mem_nhds

98e83c3d

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,15 +2,12 @@
 Copyright (c) 2022 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module topology.algebra.order.filter
-! leanprover-community/mathlib commit 98e83c3d541c77cdb7da20d79611a780ff8e7d90
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Topology.Order.Basic
 import Mathlib.Topology.Filter
 
+#align_import topology.algebra.order.filter from "leanprover-community/mathlib"@"98e83c3d541c77cdb7da20d79611a780ff8e7d90"
+
 /-!
 # Topology on filters of a space with order topology

98e83c3d

feat: port Topology.Algebra.Order.Filter (#2167)

0796b6a7

`topology.algebra.order.filter` ⟷ `Mathlib.Topology.Algebra.Order.Filter`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 319

topology.algebra.order.filter ⟷ Mathlib.Topology.Algebra.Order.Filter

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 319

`topology.algebra.order.filter` ⟷ `Mathlib.Topology.Algebra.Order.Filter`