category_theory.limits.fubini | 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

59382264

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

f60c6087

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -102,9 +102,9 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
                 naturality' := fun k k' f => by
                   dsimp; simp only [category.id_comp]
                   have := @nat_trans.naturality _ _ _ _ _ _ c.π (j, k) (j, k') (𝟙 j, f)
-                  dsimp at this 
+                  dsimp at this
                   simp only [category.id_comp, CategoryTheory.Functor.map_id, nat_trans.id_app] at
-                    this 
+                    this
                   exact this } }
       naturality' := fun j j' f =>
         (Q j').hom_ext
@@ -115,9 +115,9 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
               limits.is_limit.fac_assoc, limits.is_limit.fac, nat_trans.comp_app, category.id_comp,
               category.assoc]
             have := @nat_trans.naturality _ _ _ _ _ _ c.π (j, k) (j', k) (f, 𝟙 k)
-            dsimp at this 
+            dsimp at this
             simp only [category.id_comp, category.comp_id, CategoryTheory.Functor.map_id,
-              nat_trans.id_app] at this 
+              nat_trans.id_app] at this
             exact this) }
 #align category_theory.limits.cone_of_cone_uncurry CategoryTheory.Limits.coneOfConeUncurry
 -/
@@ -143,11 +143,11 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
               slice_rhs 2 3 => rw [← (D.obj j).π.naturality]
               simp only [functor.const_obj_map, category.id_comp, category.assoc]
               have w := (D.map fj).w k'
-              dsimp at w 
+              dsimp at w
               rw [← w]
               have n := s.π.naturality fj
-              dsimp at n 
-              simp only [category.id_comp] at n 
+              dsimp at n
+              simp only [category.id_comp] at n
               rw [n]
               simp } }
   fac s j := by

f60c6087

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) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 -/
-import Mathbin.CategoryTheory.Limits.HasLimits
-import Mathbin.CategoryTheory.Products.Basic
-import Mathbin.CategoryTheory.Functor.Currying
+import CategoryTheory.Limits.HasLimits
+import CategoryTheory.Products.Basic
+import CategoryTheory.Functor.Currying
 
 #align_import category_theory.limits.fubini from "leanprover-community/mathlib"@"f60c6087a7275b72d5db3c5a1d0e19e35a429c0a"

f60c6087

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) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.limits.fubini
-! leanprover-community/mathlib commit f60c6087a7275b72d5db3c5a1d0e19e35a429c0a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.CategoryTheory.Limits.HasLimits
 import Mathbin.CategoryTheory.Products.Basic
 import Mathbin.CategoryTheory.Functor.Currying
 
+#align_import category_theory.limits.fubini from "leanprover-community/mathlib"@"f60c6087a7275b72d5db3c5a1d0e19e35a429c0a"
+
 /-!
 # A Fubini theorem for categorical limits

f60c6087

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -87,6 +87,7 @@ def DiagramOfCones.conePoints (D : DiagramOfCones F) : J ⥤ C
 #align category_theory.limits.diagram_of_cones.cone_points CategoryTheory.Limits.DiagramOfCones.conePoints
 -/
 
+#print CategoryTheory.Limits.coneOfConeUncurry /-
 /-- Given a diagram `D` of limit cones over the `F.obj j`, and a cone over `uncurry.obj F`,
 we can construct a cone over the diagram consisting of the cone points from `D`.
 -/
@@ -122,7 +123,9 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
               nat_trans.id_app] at this 
             exact this) }
 #align category_theory.limits.cone_of_cone_uncurry CategoryTheory.Limits.coneOfConeUncurry
+-/
 
+#print CategoryTheory.Limits.coneOfConeUncurryIsLimit /-
 /-- `cone_of_cone_uncurry Q c` is a limit cone when `c` is a limit cone.`
 -/
 def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
@@ -165,6 +168,7 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
     rw [← w j]
     simp
 #align category_theory.limits.cone_of_cone_uncurry_is_limit CategoryTheory.Limits.coneOfConeUncurryIsLimit
+-/
 
 section
 
@@ -204,6 +208,7 @@ variable [HasLimit (uncurry.obj F)]
 
 variable [HasLimit (F ⋙ lim)]
 
+#print CategoryTheory.Limits.limitUncurryIsoLimitCompLim /-
 /-- The Fubini theorem for a functor `F : J ⥤ K ⥤ C`,
 showing that the limit of `uncurry.obj F` can be computed as
 the limit of the limits of the functors `F.obj j`.
@@ -218,7 +223,9 @@ noncomputable def limitUncurryIsoLimitCompLim : limit (uncurry.obj F) ≅ limit
   have Q'' := limit.is_limit (F ⋙ limUnder)
   exact is_limit.cone_point_unique_up_to_iso Q' Q''
 #align category_theory.limits.limit_uncurry_iso_limit_comp_lim CategoryTheory.Limits.limitUncurryIsoLimitCompLim
+-/
 
+#print CategoryTheory.Limits.limitUncurryIsoLimitCompLim_hom_π_π /-
 @[simp, reassoc]
 theorem limitUncurryIsoLimitCompLim_hom_π_π {j} {k} :
     (limitUncurryIsoLimitCompLim F).Hom ≫ limit.π _ j ≫ limit.π _ k = limit.π _ (j, k) :=
@@ -227,7 +234,9 @@ theorem limitUncurryIsoLimitCompLim_hom_π_π {j} {k} :
     is_limit.unique_up_to_iso]
   simp
 #align category_theory.limits.limit_uncurry_iso_limit_comp_lim_hom_π_π CategoryTheory.Limits.limitUncurryIsoLimitCompLim_hom_π_π
+-/
 
+#print CategoryTheory.Limits.limitUncurryIsoLimitCompLim_inv_π /-
 @[simp, reassoc]
 theorem limitUncurryIsoLimitCompLim_inv_π {j} {k} :
     (limitUncurryIsoLimitCompLim F).inv ≫ limit.π _ (j, k) = limit.π _ j ≫ limit.π _ k :=
@@ -235,6 +244,7 @@ theorem limitUncurryIsoLimitCompLim_inv_π {j} {k} :
   rw [← cancel_epi (limit_uncurry_iso_limit_comp_lim F).Hom]
   simp
 #align category_theory.limits.limit_uncurry_iso_limit_comp_lim_inv_π CategoryTheory.Limits.limitUncurryIsoLimitCompLim_inv_π
+-/
 
 end
 
@@ -256,13 +266,16 @@ noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ l
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim
 -/
 
+#print CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_hom_π_π /-
 @[simp, reassoc]
 theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :
     (limitFlipCompLimIsoLimitCompLim F).Hom ≫ limit.π _ j ≫ limit.π _ k =
       limit.π _ k ≫ limit.π _ j :=
   by dsimp [limit_flip_comp_lim_iso_limit_comp_lim]; simp; dsimp; simp
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim_hom_π_π CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_hom_π_π
+-/
 
+#print CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_inv_π_π /-
 -- See note [dsimp, simp]
 @[simp, reassoc]
 theorem limitFlipCompLimIsoLimitCompLim_inv_π_π (k) (j) :
@@ -270,6 +283,7 @@ theorem limitFlipCompLimIsoLimitCompLim_inv_π_π (k) (j) :
       limit.π _ j ≫ limit.π _ k :=
   by dsimp [limit_flip_comp_lim_iso_limit_comp_lim]; simp; dsimp; simp; dsimp; simp
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim_inv_π_π CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_inv_π_π
+-/
 
 end
 
@@ -285,6 +299,7 @@ variable [HasLimit G]
 
 variable [HasLimit (curry.obj G ⋙ lim)]
 
+#print CategoryTheory.Limits.limitIsoLimitCurryCompLim /-
 /-- The Fubini theorem for a functor `G : J × K ⥤ C`,
 showing that the limit of `G` can be computed as
 the limit of the limits of the functors `G.obj (j, _)`.
@@ -297,14 +312,18 @@ noncomputable def limitIsoLimitCurryCompLim : limit G ≅ limit (curry.obj G ⋙
   apply has_limit.iso_of_nat_iso i
   exact limit_uncurry_iso_limit_comp_lim ((@curry J _ K _ C _).obj G)
 #align category_theory.limits.limit_iso_limit_curry_comp_lim CategoryTheory.Limits.limitIsoLimitCurryCompLim
+-/
 
+#print CategoryTheory.Limits.limitIsoLimitCurryCompLim_hom_π_π /-
 @[simp, reassoc]
 theorem limitIsoLimitCurryCompLim_hom_π_π {j} {k} :
     (limitIsoLimitCurryCompLim G).Hom ≫ limit.π _ j ≫ limit.π _ k = limit.π _ (j, k) := by
   simp [limit_iso_limit_curry_comp_lim, is_limit.cone_point_unique_up_to_iso,
     is_limit.unique_up_to_iso]
 #align category_theory.limits.limit_iso_limit_curry_comp_lim_hom_π_π CategoryTheory.Limits.limitIsoLimitCurryCompLim_hom_π_π
+-/
 
+#print CategoryTheory.Limits.limitIsoLimitCurryCompLim_inv_π /-
 @[simp, reassoc]
 theorem limitIsoLimitCurryCompLim_inv_π {j} {k} :
     (limitIsoLimitCurryCompLim G).inv ≫ limit.π _ (j, k) = limit.π _ j ≫ limit.π _ k :=
@@ -312,6 +331,7 @@ theorem limitIsoLimitCurryCompLim_inv_π {j} {k} :
   rw [← cancel_epi (limit_iso_limit_curry_comp_lim G).Hom]
   simp
 #align category_theory.limits.limit_iso_limit_curry_comp_lim_inv_π CategoryTheory.Limits.limitIsoLimitCurryCompLim_inv_π
+-/
 
 end
 
@@ -322,6 +342,7 @@ variable [HasLimits C]
 -- Certainly one could weaken the hypotheses here.
 open CategoryTheory.prod
 
+#print CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim /-
 /-- A variant of the Fubini theorem for a functor `G : J × K ⥤ C`,
 showing that $\lim_k \lim_j G(j,k) ≅ \lim_j \lim_k G(j,k)$.
 -/
@@ -333,7 +354,9 @@ noncomputable def limitCurrySwapCompLimIsoLimitCurryCompLim :
     _ ≅ limit G := (HasLimit.isoOfEquivalence (braiding K J) (Iso.refl _))
     _ ≅ limit (curry.obj G ⋙ lim) := limitIsoLimitCurryCompLim _
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim
+-/
 
+#print CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π /-
 @[simp]
 theorem limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π {j} {k} :
     (limitCurrySwapCompLimIsoLimitCurryCompLim G).Hom ≫ limit.π _ j ≫ limit.π _ k =
@@ -347,7 +370,9 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π {j} {k} :
   dsimp;
   simp
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim_hom_π_π CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π
+-/
 
+#print CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π /-
 @[simp]
 theorem limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π {j} {k} :
     (limitCurrySwapCompLimIsoLimitCurryCompLim G).inv ≫ limit.π _ k ≫ limit.π _ j =
@@ -361,6 +386,7 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π {j} {k} :
   dsimp;
   simp
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim_inv_π_π CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π
+-/
 
 end

f60c6087

bump to nightly-2023-06-09-07

mathlib commit https://github.com/leanprover-community/mathlib/commit/7e5137f579de09a059a5ce98f364a04e221aabf0

16afdc39

Diff

@@ -332,7 +332,6 @@ noncomputable def limitCurrySwapCompLimIsoLimitCurryCompLim :
       (limitIsoLimitCurryCompLim _).symm
     _ ≅ limit G := (HasLimit.isoOfEquivalence (braiding K J) (Iso.refl _))
     _ ≅ limit (curry.obj G ⋙ lim) := limitIsoLimitCurryCompLim _
-    
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim
 
 @[simp]

f60c6087

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -104,9 +104,9 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
                 naturality' := fun k k' f => by
                   dsimp; simp only [category.id_comp]
                   have := @nat_trans.naturality _ _ _ _ _ _ c.π (j, k) (j, k') (𝟙 j, f)
-                  dsimp at this
+                  dsimp at this 
                   simp only [category.id_comp, CategoryTheory.Functor.map_id, nat_trans.id_app] at
-                    this
+                    this 
                   exact this } }
       naturality' := fun j j' f =>
         (Q j').hom_ext
@@ -117,9 +117,9 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
               limits.is_limit.fac_assoc, limits.is_limit.fac, nat_trans.comp_app, category.id_comp,
               category.assoc]
             have := @nat_trans.naturality _ _ _ _ _ _ c.π (j, k) (j', k) (f, 𝟙 k)
-            dsimp at this
+            dsimp at this 
             simp only [category.id_comp, category.comp_id, CategoryTheory.Functor.map_id,
-              nat_trans.id_app] at this
+              nat_trans.id_app] at this 
             exact this) }
 #align category_theory.limits.cone_of_cone_uncurry CategoryTheory.Limits.coneOfConeUncurry
 
@@ -143,11 +143,11 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
               slice_rhs 2 3 => rw [← (D.obj j).π.naturality]
               simp only [functor.const_obj_map, category.id_comp, category.assoc]
               have w := (D.map fj).w k'
-              dsimp at w
+              dsimp at w 
               rw [← w]
               have n := s.π.naturality fj
-              dsimp at n
-              simp only [category.id_comp] at n
+              dsimp at n 
+              simp only [category.id_comp] at n 
               rw [n]
               simp } }
   fac s j := by

f60c6087

bump to nightly-2023-06-01-04

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

4d9eaa85

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 
 ! This file was ported from Lean 3 source module category_theory.limits.fubini
-! leanprover-community/mathlib commit 59382264386afdbaf1727e617f5fdda511992eb9
+! leanprover-community/mathlib commit f60c6087a7275b72d5db3c5a1d0e19e35a429c0a
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.CategoryTheory.Functor.Currying
 /-!
 # A Fubini theorem for categorical limits
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We prove that $lim_{J × K} G = lim_J (lim_K G(j, -))$ for a functor `G : J × K ⥤ C`,
 when all the appropriate limits exist.

59382264

bump to nightly-2023-05-29-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/88a563b158f59f2983cfad685664da95502e8cdd

0fd1d246

Diff

@@ -53,6 +53,7 @@ variable {C : Type u} [Category.{v} C]
 
 variable (F : J ⥤ K ⥤ C)
 
+#print CategoryTheory.Limits.DiagramOfCones /-
 -- We could try introducing a "dependent functor type" to handle this?
 /-- A structure carrying a diagram of cones over the functors `F.obj j`.
 -/
@@ -65,9 +66,11 @@ structure DiagramOfCones where
       (map (f ≫ g)).Hom = (map f).Hom ≫ (map g).Hom := by
     obviously
 #align category_theory.limits.diagram_of_cones CategoryTheory.Limits.DiagramOfCones
+-/
 
 variable {F}
 
+#print CategoryTheory.Limits.DiagramOfCones.conePoints /-
 /-- Extract the functor `J ⥤ C` consisting of the cone points and the maps between them,
 from a `diagram_of_cones`.
 -/
@@ -79,6 +82,7 @@ def DiagramOfCones.conePoints (D : DiagramOfCones F) : J ⥤ C
   map_id' j := D.id j
   map_comp' j₁ j₂ j₃ f g := D.comp f g
 #align category_theory.limits.diagram_of_cones.cone_points CategoryTheory.Limits.DiagramOfCones.conePoints
+-/
 
 /-- Given a diagram `D` of limit cones over the `F.obj j`, and a cone over `uncurry.obj F`,
 we can construct a cone over the diagram consisting of the cone points from `D`.
@@ -165,6 +169,7 @@ variable (F)
 
 variable [HasLimitsOfShape K C]
 
+#print CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits /-
 /-- Given a functor `F : J ⥤ K ⥤ C`, with all needed limits,
 we can construct a diagram consisting of the limit cone over each functor `F.obj j`,
 and the universal cone morphisms between these.
@@ -175,17 +180,22 @@ noncomputable def DiagramOfCones.mkOfHasLimits : DiagramOfCones F
   obj j := limit.cone (F.obj j)
   map j j' f := { Hom := lim.map (F.map f) }
 #align category_theory.limits.diagram_of_cones.mk_of_has_limits CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits
+-/
 
+#print CategoryTheory.Limits.diagramOfConesInhabited /-
 -- Satisfying the inhabited linter.
 noncomputable instance diagramOfConesInhabited : Inhabited (DiagramOfCones F) :=
   ⟨DiagramOfCones.mkOfHasLimits F⟩
 #align category_theory.limits.diagram_of_cones_inhabited CategoryTheory.Limits.diagramOfConesInhabited
+-/
 
+#print CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits_conePoints /-
 @[simp]
 theorem DiagramOfCones.mkOfHasLimits_conePoints :
     (DiagramOfCones.mkOfHasLimits F).conePoints = F ⋙ lim :=
   rfl
 #align category_theory.limits.diagram_of_cones.mk_of_has_limits_cone_points CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits_conePoints
+-/
 
 variable [HasLimit (uncurry.obj F)]
 
@@ -232,6 +242,7 @@ variable (F) [HasLimitsOfShape J C] [HasLimitsOfShape K C]
 -- With only moderate effort these could be derived if needed:
 variable [HasLimitsOfShape (J × K) C] [HasLimitsOfShape (K × J) C]
 
+#print CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim /-
 /-- The limit of `F.flip ⋙ lim` is isomorphic to the limit of `F ⋙ lim`. -/
 noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ limit (F ⋙ lim) :=
   (limitUncurryIsoLimitCompLim _).symm ≪≫
@@ -240,6 +251,7 @@ noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ l
           (NatIso.ofComponents (fun _ => by rfl) (by tidy)) ≪≫
         limitUncurryIsoLimitCompLim _
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim
+-/
 
 @[simp, reassoc]
 theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :

59382264

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -245,11 +245,7 @@ noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ l
 theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :
     (limitFlipCompLimIsoLimitCompLim F).Hom ≫ limit.π _ j ≫ limit.π _ k =
       limit.π _ k ≫ limit.π _ j :=
-  by
-  dsimp [limit_flip_comp_lim_iso_limit_comp_lim]
-  simp
-  dsimp
-  simp
+  by dsimp [limit_flip_comp_lim_iso_limit_comp_lim]; simp; dsimp; simp
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim_hom_π_π CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_hom_π_π
 
 -- See note [dsimp, simp]
@@ -257,13 +253,7 @@ theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :
 theorem limitFlipCompLimIsoLimitCompLim_inv_π_π (k) (j) :
     (limitFlipCompLimIsoLimitCompLim F).inv ≫ limit.π _ k ≫ limit.π _ j =
       limit.π _ j ≫ limit.π _ k :=
-  by
-  dsimp [limit_flip_comp_lim_iso_limit_comp_lim]
-  simp
-  dsimp
-  simp
-  dsimp
-  simp
+  by dsimp [limit_flip_comp_lim_iso_limit_comp_lim]; simp; dsimp; simp; dsimp; simp
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim_inv_π_π CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_inv_π_π
 
 end

59382264

bump to nightly-2023-05-23-03

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

ed98987c

Diff

@@ -206,7 +206,7 @@ noncomputable def limitUncurryIsoLimitCompLim : limit (uncurry.obj F) ≅ limit
   exact is_limit.cone_point_unique_up_to_iso Q' Q''
 #align category_theory.limits.limit_uncurry_iso_limit_comp_lim CategoryTheory.Limits.limitUncurryIsoLimitCompLim
 
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitUncurryIsoLimitCompLim_hom_π_π {j} {k} :
     (limitUncurryIsoLimitCompLim F).Hom ≫ limit.π _ j ≫ limit.π _ k = limit.π _ (j, k) :=
   by
@@ -215,7 +215,7 @@ theorem limitUncurryIsoLimitCompLim_hom_π_π {j} {k} :
   simp
 #align category_theory.limits.limit_uncurry_iso_limit_comp_lim_hom_π_π CategoryTheory.Limits.limitUncurryIsoLimitCompLim_hom_π_π
 
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitUncurryIsoLimitCompLim_inv_π {j} {k} :
     (limitUncurryIsoLimitCompLim F).inv ≫ limit.π _ (j, k) = limit.π _ j ≫ limit.π _ k :=
   by
@@ -241,7 +241,7 @@ noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ l
         limitUncurryIsoLimitCompLim _
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim
 
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :
     (limitFlipCompLimIsoLimitCompLim F).Hom ≫ limit.π _ j ≫ limit.π _ k =
       limit.π _ k ≫ limit.π _ j :=
@@ -253,7 +253,7 @@ theorem limitFlipCompLimIsoLimitCompLim_hom_π_π (j) (k) :
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim_hom_π_π CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim_hom_π_π
 
 -- See note [dsimp, simp]
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitFlipCompLimIsoLimitCompLim_inv_π_π (k) (j) :
     (limitFlipCompLimIsoLimitCompLim F).inv ≫ limit.π _ k ≫ limit.π _ j =
       limit.π _ j ≫ limit.π _ k :=
@@ -293,14 +293,14 @@ noncomputable def limitIsoLimitCurryCompLim : limit G ≅ limit (curry.obj G ⋙
   exact limit_uncurry_iso_limit_comp_lim ((@curry J _ K _ C _).obj G)
 #align category_theory.limits.limit_iso_limit_curry_comp_lim CategoryTheory.Limits.limitIsoLimitCurryCompLim
 
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitIsoLimitCurryCompLim_hom_π_π {j} {k} :
     (limitIsoLimitCurryCompLim G).Hom ≫ limit.π _ j ≫ limit.π _ k = limit.π _ (j, k) := by
   simp [limit_iso_limit_curry_comp_lim, is_limit.cone_point_unique_up_to_iso,
     is_limit.unique_up_to_iso]
 #align category_theory.limits.limit_iso_limit_curry_comp_lim_hom_π_π CategoryTheory.Limits.limitIsoLimitCurryCompLim_hom_π_π
 
-@[simp, reassoc.1]
+@[simp, reassoc]
 theorem limitIsoLimitCurryCompLim_inv_π {j} {k} :
     (limitIsoLimitCurryCompLim G).inv ≫ limit.π _ (j, k) = limit.π _ j ≫ limit.π _ k :=
   by

59382264

bump to nightly-2023-03-01-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/4c586d291f189eecb9d00581aeb3dd998ac34442

20cadee0

Diff

@@ -325,7 +325,7 @@ noncomputable def limitCurrySwapCompLimIsoLimitCurryCompLim :
   calc
     limit (curry.obj (swap K J ⋙ G) ⋙ lim) ≅ limit (swap K J ⋙ G) :=
       (limitIsoLimitCurryCompLim _).symm
-    _ ≅ limit G := HasLimit.isoOfEquivalence (braiding K J) (Iso.refl _)
+    _ ≅ limit G := (HasLimit.isoOfEquivalence (braiding K J) (Iso.refl _))
     _ ≅ limit (curry.obj G ⋙ lim) := limitIsoLimitCurryCompLim _
     
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim

59382264

bump to nightly-2023-02-28-22

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

1fb1623f

Diff

@@ -74,7 +74,7 @@ from a `diagram_of_cones`.
 @[simps]
 def DiagramOfCones.conePoints (D : DiagramOfCones F) : J ⥤ C
     where
-  obj j := (D.obj j).x
+  obj j := (D.obj j).pt
   map j j' f := (D.map f).Hom
   map_id' j := D.id j
   map_comp' j₁ j₂ j₃ f g := D.comp f g
@@ -87,11 +87,11 @@ we can construct a cone over the diagram consisting of the cone points from `D`.
 def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
     (c : Cone (uncurry.obj F)) : Cone D.conePoints
     where
-  x := c.x
+  pt := c.pt
   π :=
     { app := fun j =>
         (Q j).lift
-          { x := c.x
+          { pt := c.pt
             π :=
               { app := fun k => c.π.app (j, k)
                 naturality' := fun k k' f => by
@@ -123,7 +123,7 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
     where
   lift s :=
     P.lift
-      { x := s.x
+      { pt := s.pt
         π :=
           { app := fun p => s.π.app p.1 ≫ (D.obj p.1).π.app p.2
             naturality' := fun p p' f => by
@@ -151,7 +151,7 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
     by
     refine'
       P.uniq
-        { x := s.X
+        { pt := s.X
           π := _ } m _
     rintro ⟨j, k⟩
     dsimp
@@ -172,7 +172,7 @@ and the universal cone morphisms between these.
 @[simps]
 noncomputable def DiagramOfCones.mkOfHasLimits : DiagramOfCones F
     where
-  obj j := Limit.cone (F.obj j)
+  obj j := limit.cone (F.obj j)
   map j j' f := { Hom := lim.map (F.map f) }
 #align category_theory.limits.diagram_of_cones.mk_of_has_limits CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits

59382264

bump to nightly-2023-02-27-08

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

91d8c210

Diff

@@ -143,11 +143,11 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
               simp only [category.id_comp] at n
               rw [n]
               simp } }
-  fac' s j := by
+  fac s j := by
     apply (Q j).hom_ext
     intro k
     simp
-  uniq' s m w :=
+  uniq s m w :=
     by
     refine'
       P.uniq

59382264

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

59382264

chore: adapt to multiple goal linter 1 (#12338)

A PR accompanying #12339.

Zulip discussion

45f93f3f

Diff

@@ -482,8 +482,8 @@ noncomputable def colimitIsoColimitCurryCompColim : colimit G ≅ colimit (curry
   have i : G ≅ uncurry.obj ((@curry J _ K _ C _).obj G) := currying.symm.unitIso.app G
   haveI : Limits.HasColimit (uncurry.obj ((@curry J _ K _ C _).obj G)) := hasColimitOfIso i.symm
   trans colimit (uncurry.obj ((@curry J _ K _ C _).obj G))
-  apply HasColimit.isoOfNatIso i
-  exact colimitUncurryIsoColimitCompColim ((@curry J _ K _ C _).obj G)
+  · apply HasColimit.isoOfNatIso i
+  · exact colimitUncurryIsoColimitCompColim ((@curry J _ K _ C _).obj G)
 
 @[simp, reassoc]
 theorem colimitIsoColimitCurryCompColim_ι_ι_inv {j} {k} :

59382264

chore: superfluous parentheses part 2 (#12131)

Co-authored-by: Moritz Firsching <firsching@google.com>

d48d30ac

Diff

@@ -517,7 +517,7 @@ noncomputable def limitCurrySwapCompLimIsoLimitCurryCompLim :
   calc
     limit (curry.obj (Prod.swap K J ⋙ G) ⋙ lim) ≅ limit (Prod.swap K J ⋙ G) :=
       (limitIsoLimitCurryCompLim _).symm
-    _ ≅ limit G := (HasLimit.isoOfEquivalence (Prod.braiding K J) (Iso.refl _))
+    _ ≅ limit G := HasLimit.isoOfEquivalence (Prod.braiding K J) (Iso.refl _)
     _ ≅ limit (curry.obj G ⋙ lim) := limitIsoLimitCurryCompLim _
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim
 
@@ -568,7 +568,7 @@ noncomputable def colimitCurrySwapCompColimIsoColimitCurryCompColim :
   calc
     colimit (curry.obj (Prod.swap K J ⋙ G) ⋙ colim) ≅ colimit (Prod.swap K J ⋙ G) :=
       (colimitIsoColimitCurryCompColim _).symm
-    _ ≅ colimit G := (HasColimit.isoOfEquivalence (Prod.braiding K J) (Iso.refl _))
+    _ ≅ colimit G := HasColimit.isoOfEquivalence (Prod.braiding K J) (Iso.refl _)
     _ ≅ colimit (curry.obj G ⋙ colim) := colimitIsoColimitCurryCompColim _
 
 @[simp]

59382264

chore(*): remove empty lines between variable statements (#11418)

Empty lines were removed by executing the following Python script twice

import os
import re


# Loop through each file in the repository
for dir_path, dirs, files in os.walk('.'):
  for filename in files:
    if filename.endswith('.lean'):
      file_path = os.path.join(dir_path, filename)

      # Open the file and read its contents
      with open(file_path, 'r') as file:
        content = file.read()

      # Use a regular expression to replace sequences of "variable" lines separated by empty lines
      # with sequences without empty lines
      modified_content = re.sub(r'(variable.*\n)\n(variable(?! .* in))', r'\1\2', content)

      # Write the modified content back to the file
      with open(file_path, 'w') as file:
        file.write(modified_content)

75c86f04

Diff

@@ -44,9 +44,7 @@ open CategoryTheory
 namespace CategoryTheory.Limits
 
 variable {J K : Type v} [SmallCategory J] [SmallCategory K]
-
 variable {C : Type u} [Category.{v} C]
-
 variable (F : J ⥤ K ⥤ C)
 
 -- We could try introducing a "dependent functor type" to handle this?
@@ -246,7 +244,6 @@ def coconeOfCoconeUncurryIsColimit {D : DiagramOfCocones F} (Q : ∀ j, IsColimi
 section
 
 variable (F)
-
 variable [HasLimitsOfShape K C]
 
 /-- Given a functor `F : J ⥤ K ⥤ C`, with all needed limits,
@@ -271,7 +268,6 @@ theorem DiagramOfCones.mkOfHasLimits_conePoints :
 #align category_theory.limits.diagram_of_cones.mk_of_has_limits_cone_points CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits_conePoints
 
 variable [HasLimit (uncurry.obj F)]
-
 variable [HasLimit (F ⋙ lim)]
 
 /-- The Fubini theorem for a functor `F : J ⥤ K ⥤ C`,
@@ -309,7 +305,6 @@ end
 section
 
 variable (F)
-
 variable [HasColimitsOfShape K C]
 
 /-- Given a functor `F : J ⥤ K ⥤ C`, with all needed colimits,
@@ -331,7 +326,6 @@ theorem DiagramOfCocones.mkOfHasColimits_coconePoints :
   rfl
 
 variable [HasColimit (uncurry.obj F)]
-
 variable [HasColimit (F ⋙ colim)]
 
 /-- The Fubini theorem for a functor `F : J ⥤ K ⥤ C`,
@@ -405,7 +399,6 @@ end
 section
 
 variable (F) [HasColimitsOfShape J C] [HasColimitsOfShape K C]
-
 variable [HasColimitsOfShape (J × K) C] [HasColimitsOfShape (K × J) C]
 
 /-- The colimit of `F.flip ⋙ colim` is isomorphic to the colimit of `F ⋙ colim`. -/
@@ -442,9 +435,7 @@ variable (G : J × K ⥤ C)
 section
 
 variable [HasLimitsOfShape K C]
-
 variable [HasLimit G]
-
 variable [HasLimit (curry.obj G ⋙ lim)]
 
 /-- The Fubini theorem for a functor `G : J × K ⥤ C`,
@@ -480,9 +471,7 @@ end
 section
 
 variable [HasColimitsOfShape K C]
-
 variable [HasColimit G]
-
 variable [HasColimit (curry.obj G ⋙ colim)]
 
 /-- The Fubini theorem for a functor `G : J × K ⥤ C`,

59382264

chore: move Mathlib to v4.7.0-rc1 (#11162)

This is a very large PR, but it has been reviewed piecemeal already in PRs to the bump/v4.7.0 branch as we update to intermediate nightlies.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Kyle Miller <kmill31415@gmail.com> Co-authored-by: damiano <adomani@gmail.com>

fa48894a

Diff

@@ -462,6 +462,7 @@ noncomputable def limitIsoLimitCurryCompLim : limit G ≅ limit (curry.obj G ⋙
 @[simp, reassoc]
 theorem limitIsoLimitCurryCompLim_hom_π_π {j} {k} :
     (limitIsoLimitCurryCompLim G).hom ≫ limit.π _ j ≫ limit.π _ k = limit.π _ (j, k) := by
+  set_option tactic.skipAssignedInstances false in
   simp [limitIsoLimitCurryCompLim, Trans.simple, HasLimit.isoOfNatIso, limitUncurryIsoLimitCompLim]
 #align category_theory.limits.limit_iso_limit_curry_comp_lim_hom_π_π CategoryTheory.Limits.limitIsoLimitCurryCompLim_hom_π_π
 
@@ -499,6 +500,7 @@ noncomputable def colimitIsoColimitCurryCompColim : colimit G ≅ colimit (curry
 theorem colimitIsoColimitCurryCompColim_ι_ι_inv {j} {k} :
     colimit.ι ((curry.obj G).obj j) k ≫ colimit.ι (curry.obj G ⋙ colim) j ≫
       (colimitIsoColimitCurryCompColim G).inv  = colimit.ι _ (j, k) := by
+  set_option tactic.skipAssignedInstances false in
   simp [colimitIsoColimitCurryCompColim, Trans.simple, HasColimit.isoOfNatIso,
     colimitUncurryIsoColimitCompColim]

59382264

style: homogenise porting notes (#11145)

Homogenises porting notes via capitalisation and addition of whitespace.

It makes the following changes:

converts "--porting note" into "-- Porting note";
converts "porting note" into "Porting note".

8be0b69c

Diff

@@ -541,7 +541,7 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π {j} {k} :
   erw [NatTrans.id_app]
   -- Why can't `simp` do this?
   dsimp
-  -- porting note: the original proof only had `simp`.
+  -- Porting note: the original proof only had `simp`.
   -- However, now `CategoryTheory.Bifunctor.map_id` does not get used by `simp`
   rw [CategoryTheory.Bifunctor.map_id]
   simp

59382264

chore: classify simp can do this porting notes (#10619)

Classify by adding issue number (#10618) to porting notes claiming anything semantically equivalent to simp can prove this or simp can simplify this.

de765f60

Diff

@@ -557,7 +557,7 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π {j} {k} :
   simp only [Iso.refl_hom, Prod.braiding_counitIso_hom_app, Limits.HasLimit.isoOfEquivalence_inv_π,
     Iso.refl_inv, limitIsoLimitCurryCompLim_hom_π_π, eqToIso_refl, Category.assoc]
   erw [NatTrans.id_app]
-  -- Porting note: `simp` can do this in lean 4.
+  -- Porting note (#10618): `simp` can do this in lean 4.
   simp
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim_inv_π_π CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π

59382264

chore: reduce imports (#9830)

This uses the improved shake script from #9772 to reduce imports across mathlib. The corresponding noshake.json file has been added to #9772.

Co-authored-by: Mario Carneiro <di.gama@gmail.com>

f4c4ca61

Diff

@@ -6,6 +6,7 @@ Authors: Scott Morrison
 import Mathlib.CategoryTheory.Limits.HasLimits
 import Mathlib.CategoryTheory.Products.Basic
 import Mathlib.CategoryTheory.Functor.Currying
+import Mathlib.CategoryTheory.Products.Bifunctor
 
 #align_import category_theory.limits.fubini from "leanprover-community/mathlib"@"59382264386afdbaf1727e617f5fdda511992eb9"

59382264

chore: tidy various files (#8818)

397ec08b

Diff

@@ -454,8 +454,8 @@ noncomputable def limitIsoLimitCurryCompLim : limit G ≅ limit (curry.obj G ⋙
   have i : G ≅ uncurry.obj ((@curry J _ K _ C _).obj G) := currying.symm.unitIso.app G
   haveI : Limits.HasLimit (uncurry.obj ((@curry J _ K _ C _).obj G)) := hasLimitOfIso i
   trans limit (uncurry.obj ((@curry J _ K _ C _).obj G))
-  apply HasLimit.isoOfNatIso i
-  exact limitUncurryIsoLimitCompLim ((@curry J _ K _ C _).obj G)
+  · apply HasLimit.isoOfNatIso i
+  · exact limitUncurryIsoLimitCompLim ((@curry J _ K _ C _).obj G)
 #align category_theory.limits.limit_iso_limit_curry_comp_lim CategoryTheory.Limits.limitIsoLimitCurryCompLim
 
 @[simp, reassoc]

59382264

chore(CategoryTheory/Limits/Fubini): Fubini theorem for colimits (#8046)

Dualize all statements in CategoryTheory/Limits/Fubini.lean.

Co-authored-by: Andrew Yang <36414270+erdOne@users.noreply.github.com>

d09f697a

Diff

@@ -10,7 +10,7 @@ import Mathlib.CategoryTheory.Functor.Currying
 #align_import category_theory.limits.fubini from "leanprover-community/mathlib"@"59382264386afdbaf1727e617f5fdda511992eb9"
 
 /-!
-# A Fubini theorem for categorical limits
+# A Fubini theorem for categorical (co)limits
 
 We prove that $lim_{J × K} G = lim_J (lim_K G(j, -))$ for a functor `G : J × K ⥤ C`,
 when all the appropriate limits exist.
@@ -32,9 +32,7 @@ For convenience, we also provide
 `limitIsoLimitCurryCompLim G : limit G ≅ limit ((curry.obj G) ⋙ lim)`
 in terms of the uncurried functor.
 
-## Future work
-
-The dual statement.
+All statements have their counterpart for colimits.
 -/
 
 
@@ -54,13 +52,26 @@ variable (F : J ⥤ K ⥤ C)
 /-- A structure carrying a diagram of cones over the functors `F.obj j`.
 -/
 structure DiagramOfCones where
+  /-- For each object, a cone. -/
   obj : ∀ j : J, Cone (F.obj j)
+  /-- For each map, a map of cones. -/
   map : ∀ {j j' : J} (f : j ⟶ j'), (Cones.postcompose (F.map f)).obj (obj j) ⟶ obj j'
   id : ∀ j : J, (map (𝟙 j)).hom = 𝟙 _ := by aesop_cat
   comp : ∀ {j₁ j₂ j₃ : J} (f : j₁ ⟶ j₂) (g : j₂ ⟶ j₃),
     (map (f ≫ g)).hom = (map f).hom ≫ (map g).hom := by aesop_cat
 #align category_theory.limits.diagram_of_cones CategoryTheory.Limits.DiagramOfCones
 
+/-- A structure carrying a diagram of cocones over the functors `F.obj j`.
+-/
+structure DiagramOfCocones where
+  /-- For each object, a cocone. -/
+  obj : ∀ j : J, Cocone (F.obj j)
+  /-- For each map, a map of cocones. -/
+  map : ∀ {j j' : J} (f : j ⟶ j'), (obj j) ⟶ (Cocones.precompose (F.map f)).obj (obj j')
+  id : ∀ j : J, (map (𝟙 j)).hom = 𝟙 _ := by aesop_cat
+  comp : ∀ {j₁ j₂ j₃ : J} (f : j₁ ⟶ j₂) (g : j₂ ⟶ j₃),
+    (map (f ≫ g)).hom = (map f).hom ≫ (map g).hom := by aesop_cat
+
 variable {F}
 
 /-- Extract the functor `J ⥤ C` consisting of the cone points and the maps between them,
@@ -74,6 +85,16 @@ def DiagramOfCones.conePoints (D : DiagramOfCones F) : J ⥤ C where
   map_comp f g := D.comp f g
 #align category_theory.limits.diagram_of_cones.cone_points CategoryTheory.Limits.DiagramOfCones.conePoints
 
+/-- Extract the functor `J ⥤ C` consisting of the cocone points and the maps between them,
+from a `DiagramOfCocones`.
+-/
+@[simps]
+def DiagramOfCocones.coconePoints (D : DiagramOfCocones F) : J ⥤ C where
+  obj j := (D.obj j).pt
+  map f := (D.map f).hom
+  map_id j := D.id j
+  map_comp f g := D.comp f g
+
 /-- Given a diagram `D` of limit cones over the `F.obj j`, and a cone over `uncurry.obj F`,
 we can construct a cone over the diagram consisting of the cone points from `D`.
 -/
@@ -109,6 +130,40 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
             exact this) }
 #align category_theory.limits.cone_of_cone_uncurry CategoryTheory.Limits.coneOfConeUncurry
 
+/-- Given a diagram `D` of colimit cocones over the `F.obj j`, and a cocone over `uncurry.obj F`,
+we can construct a cocone over the diagram consisting of the cocone points from `D`.
+-/
+@[simps]
+def coconeOfCoconeUncurry {D : DiagramOfCocones F} (Q : ∀ j, IsColimit (D.obj j))
+    (c : Cocone (uncurry.obj F)) : Cocone D.coconePoints where
+  pt := c.pt
+  ι :=
+    { app := fun j =>
+        (Q j).desc
+          { pt := c.pt
+            ι :=
+              { app := fun k => c.ι.app (j, k)
+                naturality := fun k k' f => by
+                  dsimp; simp only [Category.comp_id]
+                  conv_lhs =>
+                    arg 1; equals (F.map (𝟙 _)).app _ ≫  (F.obj j).map f =>
+                      simp;
+                  conv_lhs => arg 1; rw [← uncurry_obj_map F ((𝟙 j,f) : (j,k) ⟶ (j,k'))]
+                  rw [c.w] } }
+      naturality := fun j j' f =>
+        (Q j).hom_ext
+          (by
+            dsimp
+            intro k
+            simp only [Limits.CoconeMorphism.w_assoc, Limits.Cocones.precompose_obj_ι,
+              Limits.IsColimit.fac_assoc, Limits.IsColimit.fac, NatTrans.comp_app, Category.comp_id,
+              Category.assoc]
+            have := @NatTrans.naturality _ _ _ _ _ _ c.ι (j, k) (j', k) (f, 𝟙 k)
+            dsimp at this
+            simp only [Category.id_comp, Category.comp_id, CategoryTheory.Functor.map_id,
+              NatTrans.id_app] at this
+            exact this) }
+
 /-- `coneOfConeUncurry Q c` is a limit cone when `c` is a limit cone.
 -/
 def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
@@ -149,6 +204,44 @@ def coneOfConeUncurryIsLimit {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j
     simp
 #align category_theory.limits.cone_of_cone_uncurry_is_limit CategoryTheory.Limits.coneOfConeUncurryIsLimit
 
+/-- `coconeOfCoconeUncurry Q c` is a colimit cocone when `c` is a colimit cocone.
+-/
+def coconeOfCoconeUncurryIsColimit {D : DiagramOfCocones F} (Q : ∀ j, IsColimit (D.obj j))
+    {c : Cocone (uncurry.obj F)} (P : IsColimit c) : IsColimit (coconeOfCoconeUncurry Q c) where
+  desc s :=
+    P.desc
+      { pt := s.pt
+        ι :=
+          { app := fun p => (D.obj p.1).ι.app p.2 ≫ s.ι.app p.1
+            naturality := fun p p' f => by
+              dsimp; simp only [Category.id_comp, Category.assoc]
+              rcases p with ⟨j, k⟩
+              rcases p' with ⟨j', k'⟩
+              rcases f with ⟨fj, fk⟩
+              dsimp
+              slice_lhs 2 3 => rw [(D.obj j').ι.naturality]
+              simp only [Functor.const_obj_map, Category.id_comp, Category.assoc]
+              have w := (D.map fj).w k
+              dsimp at w
+              slice_lhs 1 2 => rw [← w]
+              have n := s.ι.naturality fj
+              dsimp at n
+              simp only [Category.comp_id] at n
+              rw [← n]
+              simp } }
+  fac s j := by
+    apply (Q j).hom_ext
+    intro k
+    simp
+  uniq s m w := by
+    refine' P.uniq
+      { pt := s.pt
+        ι := _ } m _
+    rintro ⟨j, k⟩
+    dsimp
+    rw [← w j]
+    simp
+
 section
 
 variable (F)
@@ -214,6 +307,65 @@ end
 
 section
 
+variable (F)
+
+variable [HasColimitsOfShape K C]
+
+/-- Given a functor `F : J ⥤ K ⥤ C`, with all needed colimits,
+we can construct a diagram consisting of the colimit cocone over each functor `F.obj j`,
+and the universal cocone morphisms between these.
+-/
+@[simps]
+noncomputable def DiagramOfCocones.mkOfHasColimits : DiagramOfCocones F where
+  obj j := colimit.cocone (F.obj j)
+  map f := { hom := colim.map (F.map f) }
+
+-- Satisfying the inhabited linter.
+noncomputable instance diagramOfCoconesInhabited : Inhabited (DiagramOfCocones F) :=
+  ⟨DiagramOfCocones.mkOfHasColimits F⟩
+
+@[simp]
+theorem DiagramOfCocones.mkOfHasColimits_coconePoints :
+    (DiagramOfCocones.mkOfHasColimits F).coconePoints = F ⋙ colim :=
+  rfl
+
+variable [HasColimit (uncurry.obj F)]
+
+variable [HasColimit (F ⋙ colim)]
+
+/-- The Fubini theorem for a functor `F : J ⥤ K ⥤ C`,
+showing that the colimit of `uncurry.obj F` can be computed as
+the colimit of the colimits of the functors `F.obj j`.
+-/
+noncomputable def colimitUncurryIsoColimitCompColim :
+    colimit (uncurry.obj F) ≅ colimit (F ⋙ colim) := by
+  let c := colimit.cocone (uncurry.obj F)
+  let P : IsColimit c := colimit.isColimit _
+  let G := DiagramOfCocones.mkOfHasColimits F
+  let Q : ∀ j, IsColimit (G.obj j) := fun j => colimit.isColimit _
+  have Q' := coconeOfCoconeUncurryIsColimit Q P
+  have Q'' := colimit.isColimit (F ⋙ colim)
+  exact IsColimit.coconePointUniqueUpToIso Q' Q''
+
+@[simp, reassoc]
+theorem colimitUncurryIsoColimitCompColim_ι_ι_inv {j} {k} :
+    colimit.ι (F.obj j) k ≫ colimit.ι (F ⋙ colim) j ≫ (colimitUncurryIsoColimitCompColim F).inv =
+      colimit.ι (uncurry.obj F) (j, k) := by
+  dsimp [colimitUncurryIsoColimitCompColim, IsColimit.coconePointUniqueUpToIso,
+    IsColimit.uniqueUpToIso]
+  simp
+
+@[simp, reassoc]
+theorem colimitUncurryIsoColimitCompColim_ι_hom {j} {k} :
+    colimit.ι _ (j, k) ≫ (colimitUncurryIsoColimitCompColim F).hom =
+      (colimit.ι _ k ≫ colimit.ι (F ⋙ colim) j : _ ⟶ (colimit (F ⋙ colim))) := by
+  rw [← cancel_mono (colimitUncurryIsoColimitCompColim F).inv]
+  simp
+
+end
+
+section
+
 variable (F) [HasLimitsOfShape J C] [HasLimitsOfShape K C]
 
 -- With only moderate effort these could be derived if needed:
@@ -251,6 +403,39 @@ end
 
 section
 
+variable (F) [HasColimitsOfShape J C] [HasColimitsOfShape K C]
+
+variable [HasColimitsOfShape (J × K) C] [HasColimitsOfShape (K × J) C]
+
+/-- The colimit of `F.flip ⋙ colim` is isomorphic to the colimit of `F ⋙ colim`. -/
+noncomputable def colimitFlipCompColimIsoColimitCompColim :
+    colimit (F.flip ⋙ colim) ≅ colimit (F ⋙ colim) :=
+  (colimitUncurryIsoColimitCompColim _).symm ≪≫
+    HasColimit.isoOfNatIso (uncurryObjFlip _) ≪≫
+      HasColimit.isoOfEquivalence (Prod.braiding _ _)
+          (NatIso.ofComponents fun _ => by rfl) ≪≫
+        colimitUncurryIsoColimitCompColim _
+
+@[simp, reassoc]
+theorem colimitFlipCompColimIsoColimitCompColim_ι_ι_hom (j) (k) :
+    colimit.ι (F.flip.obj k) j ≫ colimit.ι (F.flip ⋙ colim) k ≫
+      (colimitFlipCompColimIsoColimitCompColim F).hom =
+        (colimit.ι _ k ≫ colimit.ι (F ⋙ colim) j : _ ⟶ colimit (F⋙ colim)) := by
+  dsimp [colimitFlipCompColimIsoColimitCompColim]
+  slice_lhs 1 3 => simp only []
+  simp
+
+@[simp, reassoc]
+theorem colimitFlipCompColimIsoColimitCompColim_ι_ι_inv (k) (j) :
+    colimit.ι (F.obj j) k ≫ colimit.ι (F ⋙ colim) j ≫
+      (colimitFlipCompColimIsoColimitCompColim F).inv =
+        (colimit.ι _ j ≫ colimit.ι (F.flip ⋙ colim) k : _ ⟶ colimit (F.flip ⋙ colim)) := by
+  dsimp [colimitFlipCompColimIsoColimitCompColim]
+  slice_lhs 1 3 => simp only []
+  simp
+
+end
+
 variable (G : J × K ⥤ C)
 
 section
@@ -292,6 +477,41 @@ end
 
 section
 
+variable [HasColimitsOfShape K C]
+
+variable [HasColimit G]
+
+variable [HasColimit (curry.obj G ⋙ colim)]
+
+/-- The Fubini theorem for a functor `G : J × K ⥤ C`,
+showing that the colimit of `G` can be computed as
+the colimit of the colimits of the functors `G.obj (j, _)`.
+-/
+noncomputable def colimitIsoColimitCurryCompColim : colimit G ≅ colimit (curry.obj G ⋙ colim) := by
+  have i : G ≅ uncurry.obj ((@curry J _ K _ C _).obj G) := currying.symm.unitIso.app G
+  haveI : Limits.HasColimit (uncurry.obj ((@curry J _ K _ C _).obj G)) := hasColimitOfIso i.symm
+  trans colimit (uncurry.obj ((@curry J _ K _ C _).obj G))
+  apply HasColimit.isoOfNatIso i
+  exact colimitUncurryIsoColimitCompColim ((@curry J _ K _ C _).obj G)
+
+@[simp, reassoc]
+theorem colimitIsoColimitCurryCompColim_ι_ι_inv {j} {k} :
+    colimit.ι ((curry.obj G).obj j) k ≫ colimit.ι (curry.obj G ⋙ colim) j ≫
+      (colimitIsoColimitCurryCompColim G).inv  = colimit.ι _ (j, k) := by
+  simp [colimitIsoColimitCurryCompColim, Trans.simple, HasColimit.isoOfNatIso,
+    colimitUncurryIsoColimitCompColim]
+
+@[simp, reassoc]
+theorem colimitIsoColimitCurryCompColim_ι_hom {j} {k} :
+    colimit.ι _ (j, k) ≫ (colimitIsoColimitCurryCompColim G).hom =
+      (colimit.ι (_) k ≫ colimit.ι (curry.obj G ⋙ colim) j : _ ⟶ colimit (_ ⋙ colim)) := by
+  rw [← cancel_mono (colimitIsoColimitCurryCompColim G).inv]
+  simp
+
+end
+
+section
+
 variable [HasLimits C]
 
 -- Certainly one could weaken the hypotheses here.
@@ -342,6 +562,48 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π {j} {k} :
 
 end
 
+section
+
+variable [HasColimits C]
+
+open CategoryTheory.prod
+
+/-- A variant of the Fubini theorem for a functor `G : J × K ⥤ C`,
+showing that $\colim_k \colim_j G(j,k) ≅ \colim_j \colim_k G(j,k)$.
+-/
+noncomputable def colimitCurrySwapCompColimIsoColimitCurryCompColim :
+    colimit (curry.obj (Prod.swap K J ⋙ G) ⋙ colim) ≅ colimit (curry.obj G ⋙ colim) :=
+  calc
+    colimit (curry.obj (Prod.swap K J ⋙ G) ⋙ colim) ≅ colimit (Prod.swap K J ⋙ G) :=
+      (colimitIsoColimitCurryCompColim _).symm
+    _ ≅ colimit G := (HasColimit.isoOfEquivalence (Prod.braiding K J) (Iso.refl _))
+    _ ≅ colimit (curry.obj G ⋙ colim) := colimitIsoColimitCurryCompColim _
+
+@[simp]
+theorem colimitCurrySwapCompColimIsoColimitCurryCompColim_ι_ι_hom {j} {k} :
+    colimit.ι _ j ≫ colimit.ι (curry.obj (Prod.swap K J ⋙ G) ⋙ colim) k ≫
+      (colimitCurrySwapCompColimIsoColimitCurryCompColim G).hom =
+        (colimit.ι _ k ≫ colimit.ι (curry.obj G ⋙ colim) j : _ ⟶ colimit (curry.obj G⋙ colim)) := by
+  dsimp [colimitCurrySwapCompColimIsoColimitCurryCompColim]
+  slice_lhs 1 3 => simp only []
+  simp
+
+@[simp]
+theorem colimitCurrySwapCompColimIsoColimitCurryCompColim_ι_ι_inv {j} {k} :
+    colimit.ι _ k ≫ colimit.ι (curry.obj G ⋙ colim) j ≫
+      (colimitCurrySwapCompColimIsoColimitCurryCompColim G).inv =
+        (colimit.ι _ j ≫
+          colimit.ι (curry.obj _ ⋙ colim) k :
+            _ ⟶ colimit (curry.obj (Prod.swap K J ⋙ G) ⋙ colim)) := by
+  dsimp [colimitCurrySwapCompColimIsoColimitCurryCompColim]
+  slice_lhs 1 3 => simp only []
+  simp only [colimitIsoColimitCurryCompColim_ι_ι_inv, HasColimit.isoOfEquivalence_inv_π,
+    Functor.id_obj, Functor.comp_obj, Prod.braiding_inverse_obj, Prod.braiding_functor_obj,
+    Prod.braiding_counitIso_inv_app, Prod.swap_obj, Iso.refl_hom, NatTrans.id_app, Category.id_comp,
+    Category.assoc, colimitIsoColimitCurryCompColim_ι_hom, curry_obj_obj_obj]
+  erw [CategoryTheory.Bifunctor.map_id]
+  simp
+
 end
 
 end CategoryTheory.Limits

59382264

chore: replace ConeMorphism.Hom by ConeMorphism.hom (#7176)

3e44bb07

Diff

@@ -56,9 +56,9 @@ variable (F : J ⥤ K ⥤ C)
 structure DiagramOfCones where
   obj : ∀ j : J, Cone (F.obj j)
   map : ∀ {j j' : J} (f : j ⟶ j'), (Cones.postcompose (F.map f)).obj (obj j) ⟶ obj j'
-  id : ∀ j : J, (map (𝟙 j)).Hom = 𝟙 _ := by aesop_cat
+  id : ∀ j : J, (map (𝟙 j)).hom = 𝟙 _ := by aesop_cat
   comp : ∀ {j₁ j₂ j₃ : J} (f : j₁ ⟶ j₂) (g : j₂ ⟶ j₃),
-    (map (f ≫ g)).Hom = (map f).Hom ≫ (map g).Hom := by aesop_cat
+    (map (f ≫ g)).hom = (map f).hom ≫ (map g).hom := by aesop_cat
 #align category_theory.limits.diagram_of_cones CategoryTheory.Limits.DiagramOfCones
 
 variable {F}
@@ -69,7 +69,7 @@ from a `DiagramOfCones`.
 @[simps]
 def DiagramOfCones.conePoints (D : DiagramOfCones F) : J ⥤ C where
   obj j := (D.obj j).pt
-  map f := (D.map f).Hom
+  map f := (D.map f).hom
   map_id j := D.id j
   map_comp f g := D.comp f g
 #align category_theory.limits.diagram_of_cones.cone_points CategoryTheory.Limits.DiagramOfCones.conePoints
@@ -162,7 +162,7 @@ and the universal cone morphisms between these.
 @[simps]
 noncomputable def DiagramOfCones.mkOfHasLimits : DiagramOfCones F where
   obj j := limit.cone (F.obj j)
-  map f := { Hom := lim.map (F.map f) }
+  map f := { hom := lim.map (F.map f) }
 #align category_theory.limits.diagram_of_cones.mk_of_has_limits CategoryTheory.Limits.DiagramOfCones.mkOfHasLimits
 
 -- Satisfying the inhabited linter.

59382264

feat: says tactic combinator (#5980)

This is a primitive implementation of the says combinator discussed at today's porting meeting.

If you write X says, where X is a tactic that produces a "Try this: Y" message, then you will get a message "Try this: X says Y". Once you've clicked to replace X says with X says Y, after then X says Y will only run Y.

I think this is already potentially useful.

Possible additions:

a CI mode that re-verifies that X really does still say Y. (Edit: DONE)
If X doesn't say anything, perhaps implicitly wrap it with show_term?
Add an extra suggest flag to the TacticM state, so we can instruct tactics to print "Try this:" suggestions without adding ? directly.

Very happy if anyone wants to hack on this / replace with a better implementation, etc.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

66659071

Diff

@@ -91,8 +91,8 @@ def coneOfConeUncurry {D : DiagramOfCones F} (Q : ∀ j, IsLimit (D.obj j))
                   dsimp; simp only [Category.id_comp]
                   have := @NatTrans.naturality _ _ _ _ _ _ c.π (j, k) (j, k') (𝟙 j, f)
                   dsimp at this
-                  simp only [Category.id_comp, CategoryTheory.Functor.map_id, NatTrans.id_app]
-                    at this
+                  simp? at this says
+                    simp only [Category.id_comp, Functor.map_id, NatTrans.id_app] at this
                   exact this } }
       naturality := fun j j' f =>
         (Q j').hom_ext

59382264

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) 2020 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.limits.fubini
-! leanprover-community/mathlib commit 59382264386afdbaf1727e617f5fdda511992eb9
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Limits.HasLimits
 import Mathlib.CategoryTheory.Products.Basic
 import Mathlib.CategoryTheory.Functor.Currying
 
+#align_import category_theory.limits.fubini from "leanprover-community/mathlib"@"59382264386afdbaf1727e617f5fdda511992eb9"
+
 /-!
 # A Fubini theorem for categorical limits

59382264

chore: fix backtick in docs (#5077)

I wrote a script to find lines that contain an odd number of backticks

878d95c4

Diff

@@ -321,7 +321,7 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_hom_π_π {j} {k} :
   simp only [Iso.refl_hom, Prod.braiding_counitIso_hom_app, Limits.HasLimit.isoOfEquivalence_hom_π,
     Iso.refl_inv, limitIsoLimitCurryCompLim_hom_π_π, eqToIso_refl, Category.assoc]
   erw [NatTrans.id_app]
-  -- Why can't `simp` do this`?
+  -- Why can't `simp` do this?
   dsimp
   -- porting note: the original proof only had `simp`.
   -- However, now `CategoryTheory.Bifunctor.map_id` does not get used by `simp`

59382264

chore: review of automation in category theory (#4793)

Clean up of automation in the category theory library. Leaving out unnecessary proof steps, or fields done by aesop_cat, and making more use of available autoparameters.

Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au>

5b958613

Diff

@@ -227,7 +227,7 @@ noncomputable def limitFlipCompLimIsoLimitCompLim : limit (F.flip ⋙ lim) ≅ l
   (limitUncurryIsoLimitCompLim _).symm ≪≫
     HasLimit.isoOfNatIso (uncurryObjFlip _) ≪≫
       HasLimit.isoOfEquivalence (Prod.braiding _ _)
-          (NatIso.ofComponents (fun _ => by rfl) (by simp)) ≪≫
+          (NatIso.ofComponents fun _ => by rfl) ≪≫
         limitUncurryIsoLimitCompLim _
 #align category_theory.limits.limit_flip_comp_lim_iso_limit_comp_lim CategoryTheory.Limits.limitFlipCompLimIsoLimitCompLim

59382264

chore: tidy various files (#4854)

5238ba14

Diff

@@ -339,8 +339,7 @@ theorem limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π {j} {k} :
   simp only [Iso.refl_hom, Prod.braiding_counitIso_hom_app, Limits.HasLimit.isoOfEquivalence_inv_π,
     Iso.refl_inv, limitIsoLimitCurryCompLim_hom_π_π, eqToIso_refl, Category.assoc]
   erw [NatTrans.id_app]
-  -- Why can't `simp` do this`?
-  dsimp;
+  -- Porting note: `simp` can do this in lean 4.
   simp
 #align category_theory.limits.limit_curry_swap_comp_lim_iso_limit_curry_comp_lim_inv_π_π CategoryTheory.Limits.limitCurrySwapCompLimIsoLimitCurryCompLim_inv_π_π

59382264

feat: port CategoryTheory.Limits.Fubini (#4416)

Co-authored-by: adomani <adomani@gmail.com>

1e3da725

`category_theory.limits.fubini` ⟷ `Mathlib.CategoryTheory.Limits.Fubini`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 73

category_theory.limits.fubini ⟷ Mathlib.CategoryTheory.Limits.Fubini

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 73

`category_theory.limits.fubini` ⟷ `Mathlib.CategoryTheory.Limits.Fubini`