category_theory.generator | 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

f187f107

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

9d2f0748

bump to nightly-2024-04-14-09

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

f736ea6b

Diff

@@ -637,14 +637,15 @@ theorem IsCodetector.def {G : C} :
 
 #print CategoryTheory.isSeparator_iff_faithful_coyoneda_obj /-
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
-    IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
+    IsSeparator G ↔ CategoryTheory.Functor.Faithful (coyoneda.obj (op G)) :=
   ⟨fun hG => ⟨fun X Y f g hfg => hG.def _ _ (congr_fun hfg)⟩, fun h =>
     (isSeparator_def _).2 fun X Y f g hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 -/
 
 #print CategoryTheory.isCoseparator_iff_faithful_yoneda_obj /-
-theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
+theorem isCoseparator_iff_faithful_yoneda_obj (G : C) :
+    IsCoseparator G ↔ CategoryTheory.Functor.Faithful (yoneda.obj G) :=
   ⟨fun hG => ⟨fun X Y f g hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun h =>
     (isCoseparator_def _).2 fun X Y f g hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
@@ -789,7 +790,7 @@ end ZeroMorphisms
 
 #print CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj /-
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
-    IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) :=
+    IsDetector G ↔ CategoryTheory.Functor.ReflectsIsomorphisms (coyoneda.obj (op G)) :=
   by
   refine'
     ⟨fun hG => ⟨fun X Y f hf => hG.def _ fun h => _⟩, fun h =>
@@ -804,7 +805,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
 
 #print CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj /-
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
-    IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) :=
+    IsCodetector G ↔ CategoryTheory.Functor.ReflectsIsomorphisms (yoneda.obj G) :=
   by
   refine' ⟨fun hG => ⟨fun X Y f hf => _⟩, fun h => (is_codetector_def _).2 fun X Y f hf => _⟩
   · refine' (is_iso_unop_iff _).1 (hG.def _ _)

9d2f0748

bump to nightly-2024-04-10-08

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

cd0c1af5

Diff

@@ -582,11 +582,11 @@ theorem isSeparator_def (G : C) :
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
 -/
 
-#print CategoryTheory.IsSeparator.def' /-
-theorem IsSeparator.def' {G : C} :
+#print CategoryTheory.IsSeparator.def /-
+theorem IsSeparator.def {G : C} :
     IsSeparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   (isSeparator_def _).1
-#align category_theory.is_separator.def CategoryTheory.IsSeparator.def'
+#align category_theory.is_separator.def CategoryTheory.IsSeparator.def
 -/
 
 #print CategoryTheory.isCoseparator_def /-
@@ -598,11 +598,11 @@ theorem isCoseparator_def (G : C) :
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
 -/
 
-#print CategoryTheory.IsCoseparator.def' /-
-theorem IsCoseparator.def' {G : C} :
+#print CategoryTheory.IsCoseparator.def /-
+theorem IsCoseparator.def {G : C} :
     IsCoseparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   (isCoseparator_def _).1
-#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def'
+#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def
 -/
 
 #print CategoryTheory.isDetector_def /-
@@ -613,11 +613,11 @@ theorem isDetector_def (G : C) :
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
 -/
 
-#print CategoryTheory.IsDetector.def' /-
-theorem IsDetector.def' {G : C} :
+#print CategoryTheory.IsDetector.def /-
+theorem IsDetector.def {G : C} :
     IsDetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   (isDetector_def _).1
-#align category_theory.is_detector.def CategoryTheory.IsDetector.def'
+#align category_theory.is_detector.def CategoryTheory.IsDetector.def
 -/
 
 #print CategoryTheory.isCodetector_def /-
@@ -628,11 +628,11 @@ theorem isCodetector_def (G : C) :
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
 -/
 
-#print CategoryTheory.IsCodetector.def' /-
-theorem IsCodetector.def' {G : C} :
+#print CategoryTheory.IsCodetector.def /-
+theorem IsCodetector.def {G : C} :
     IsCodetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   (isCodetector_def _).1
-#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def'
+#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
 -/
 
 #print CategoryTheory.isSeparator_iff_faithful_coyoneda_obj /-

9d2f0748

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -582,11 +582,11 @@ theorem isSeparator_def (G : C) :
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
 -/
 
-#print CategoryTheory.IsSeparator.def /-
-theorem IsSeparator.def {G : C} :
+#print CategoryTheory.IsSeparator.def' /-
+theorem IsSeparator.def' {G : C} :
     IsSeparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   (isSeparator_def _).1
-#align category_theory.is_separator.def CategoryTheory.IsSeparator.def
+#align category_theory.is_separator.def CategoryTheory.IsSeparator.def'
 -/
 
 #print CategoryTheory.isCoseparator_def /-
@@ -598,11 +598,11 @@ theorem isCoseparator_def (G : C) :
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
 -/
 
-#print CategoryTheory.IsCoseparator.def /-
-theorem IsCoseparator.def {G : C} :
+#print CategoryTheory.IsCoseparator.def' /-
+theorem IsCoseparator.def' {G : C} :
     IsCoseparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   (isCoseparator_def _).1
-#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def
+#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def'
 -/
 
 #print CategoryTheory.isDetector_def /-
@@ -613,11 +613,11 @@ theorem isDetector_def (G : C) :
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
 -/
 
-#print CategoryTheory.IsDetector.def /-
-theorem IsDetector.def {G : C} :
+#print CategoryTheory.IsDetector.def' /-
+theorem IsDetector.def' {G : C} :
     IsDetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   (isDetector_def _).1
-#align category_theory.is_detector.def CategoryTheory.IsDetector.def
+#align category_theory.is_detector.def CategoryTheory.IsDetector.def'
 -/
 
 #print CategoryTheory.isCodetector_def /-
@@ -628,11 +628,11 @@ theorem isCodetector_def (G : C) :
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
 -/
 
-#print CategoryTheory.IsCodetector.def /-
-theorem IsCodetector.def {G : C} :
+#print CategoryTheory.IsCodetector.def' /-
+theorem IsCodetector.def' {G : C} :
     IsCodetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   (isCodetector_def _).1
-#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
+#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def'
 -/
 
 #print CategoryTheory.isSeparator_iff_faithful_coyoneda_obj /-

9d2f0748

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -691,7 +691,7 @@ theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
   · refine' h.def _ _ fun g => coprod.hom_ext _ _
     · simpa using huv G (by simp) (coprod.inl ≫ g)
     · simpa using huv H (by simp) (coprod.inr ≫ g)
-  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ 
+  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
     rcases hZ with (rfl | rfl)
     · simpa using coprod.inl ≫= huv (coprod.desc g 0)
     · simpa using coprod.inr ≫= huv (coprod.desc 0 g)
@@ -743,7 +743,7 @@ theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
   · refine' h.def _ _ fun g => prod.hom_ext _ _
     · simpa using huv G (by simp) (g ≫ limits.prod.fst)
     · simpa using huv H (by simp) (g ≫ limits.prod.snd)
-  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ 
+  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
     rcases hZ with (rfl | rfl)
     · simpa using huv (prod.lift g 0) =≫ limits.prod.fst
     · simpa using huv (prod.lift 0 g) =≫ limits.prod.snd
@@ -794,7 +794,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
   refine'
     ⟨fun hG => ⟨fun X Y f hf => hG.def _ fun h => _⟩, fun h =>
       (is_detector_def _).2 fun X Y f hf => _⟩
-  · rw [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf 
+  · rw [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf
     exact hf h
   · suffices is_iso ((coyoneda.obj (op G)).map f) by
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (coyoneda.obj (op G)) _ h
@@ -808,7 +808,7 @@ theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
   by
   refine' ⟨fun hG => ⟨fun X Y f hf => _⟩, fun h => (is_codetector_def _).2 fun X Y f hf => _⟩
   · refine' (is_iso_unop_iff _).1 (hG.def _ _)
-    rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf 
+    rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf
   · rw [← is_iso_op_iff]
     suffices is_iso ((yoneda.obj G).map f.op) by
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (yoneda.obj G) _ h

9d2f0748

bump to nightly-2024-02-01-06

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

5433bded

Diff

@@ -722,7 +722,7 @@ theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
   · refine' h.def _ _ fun g => colimit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (colimit.ι (discrete.functor f) _ ≫ g)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
-    classical
+    classical simpa using sigma.ι f b ≫= huv (sigma.desc (Pi.single b g))
 #align category_theory.is_separator_sigma CategoryTheory.isSeparator_sigma
 -/
 
@@ -774,7 +774,7 @@ theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
   · refine' h.def _ _ fun g => limit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (g ≫ limit.π (discrete.functor f) _)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
-    classical
+    classical simpa using huv (pi.lift (Pi.single b g)) =≫ pi.π f b
 #align category_theory.is_coseparator_pi CategoryTheory.isCoseparator_pi
 -/

9d2f0748

bump to nightly-2024-01-31-06

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

61100fe9

Diff

@@ -722,7 +722,7 @@ theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
   · refine' h.def _ _ fun g => colimit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (colimit.ι (discrete.functor f) _ ≫ g)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
-    classical simpa using sigma.ι f b ≫= huv (sigma.desc (Pi.single b g))
+    classical
 #align category_theory.is_separator_sigma CategoryTheory.isSeparator_sigma
 -/
 
@@ -774,7 +774,7 @@ theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
   · refine' h.def _ _ fun g => limit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (g ≫ limit.π (discrete.functor f) _)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
-    classical simpa using huv (pi.lift (Pi.single b g)) =≫ pi.π f b
+    classical
 #align category_theory.is_coseparator_pi CategoryTheory.isCoseparator_pi
 -/

9d2f0748

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,13 +3,13 @@ Copyright (c) 2022 Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
 -/
-import Mathbin.CategoryTheory.Balanced
-import Mathbin.CategoryTheory.Limits.EssentiallySmall
-import Mathbin.CategoryTheory.Limits.Opposites
-import Mathbin.CategoryTheory.Limits.Shapes.ZeroMorphisms
-import Mathbin.CategoryTheory.Subobject.Lattice
-import Mathbin.CategoryTheory.Subobject.WellPowered
-import Mathbin.Data.Set.Opposite
+import CategoryTheory.Balanced
+import CategoryTheory.Limits.EssentiallySmall
+import CategoryTheory.Limits.Opposites
+import CategoryTheory.Limits.Shapes.ZeroMorphisms
+import CategoryTheory.Subobject.Lattice
+import CategoryTheory.Subobject.WellPowered
+import Data.Set.Opposite
 
 #align_import category_theory.generator from "leanprover-community/mathlib"@"9d2f0748e6c50d7a2657c564b1ff2c695b39148d"

9d2f0748

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,11 +2,6 @@
 Copyright (c) 2022 Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
-
-! This file was ported from Lean 3 source module category_theory.generator
-! leanprover-community/mathlib commit 9d2f0748e6c50d7a2657c564b1ff2c695b39148d
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.CategoryTheory.Balanced
 import Mathbin.CategoryTheory.Limits.EssentiallySmall
@@ -16,6 +11,8 @@ import Mathbin.CategoryTheory.Subobject.Lattice
 import Mathbin.CategoryTheory.Subobject.WellPowered
 import Mathbin.Data.Set.Opposite
 
+#align_import category_theory.generator from "leanprover-community/mathlib"@"9d2f0748e6c50d7a2657c564b1ff2c695b39148d"
+
 /-!
 # Separating and detecting sets

9d2f0748

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -411,10 +411,12 @@ theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C
 #align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetecting
 -/
 
+#print CategoryTheory.Subobject.inf_eq_of_isDetecting /-
 theorem inf_eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f → Q.Factors f) : P ⊓ Q = P :=
   eq_of_le_of_isDetecting h𝒢 _ _ inf_le_left fun G hG f hf => (inf_factors _).2 ⟨hf, h _ hG hf⟩
 #align category_theory.subobject.inf_eq_of_is_detecting CategoryTheory.Subobject.inf_eq_of_isDetecting
+-/
 
 #print CategoryTheory.Subobject.eq_of_isDetecting /-
 theorem eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
@@ -444,12 +446,14 @@ namespace StructuredArrow
 
 variable (S : D) (T : C ⥤ D)
 
+#print CategoryTheory.StructuredArrow.isCoseparating_proj_preimage /-
 theorem isCoseparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsCoseparating 𝒢) :
     IsCoseparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
   refine' fun X Y f g hfg => ext _ _ (h𝒢 _ _ fun G hG h => _)
   exact congr_arg comma_morphism.right (hfg (mk (Y.hom ≫ T.map h)) hG (hom_mk h rfl))
 #align category_theory.structured_arrow.is_coseparating_proj_preimage CategoryTheory.StructuredArrow.isCoseparating_proj_preimage
+-/
 
 end StructuredArrow
 
@@ -457,12 +461,14 @@ namespace CostructuredArrow
 
 variable (S : C ⥤ D) (T : D)
 
+#print CategoryTheory.CostructuredArrow.isSeparating_proj_preimage /-
 theorem isSeparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) :
     IsSeparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
   refine' fun X Y f g hfg => ext _ _ (h𝒢 _ _ fun G hG h => _)
   convert congr_arg comma_morphism.left (hfg (mk (S.map h ≫ X.hom)) hG (hom_mk h rfl))
 #align category_theory.costructured_arrow.is_separating_proj_preimage CategoryTheory.CostructuredArrow.isSeparating_proj_preimage
+-/
 
 end CostructuredArrow
 
@@ -632,17 +638,21 @@ theorem IsCodetector.def {G : C} :
 #align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
 -/
 
+#print CategoryTheory.isSeparator_iff_faithful_coyoneda_obj /-
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
     IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
   ⟨fun hG => ⟨fun X Y f g hfg => hG.def _ _ (congr_fun hfg)⟩, fun h =>
     (isSeparator_def _).2 fun X Y f g hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
+-/
 
+#print CategoryTheory.isCoseparator_iff_faithful_yoneda_obj /-
 theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
   ⟨fun hG => ⟨fun X Y f g hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun h =>
     (isCoseparator_def _).2 fun X Y f g hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
 #align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_obj
+-/
 
 #print CategoryTheory.isSeparator_iff_epi /-
 theorem isSeparator_iff_epi (G : C) [∀ A : C, HasCoproduct fun f : G ⟶ A => G] :
@@ -780,6 +790,7 @@ theorem isCoseparator_pi_of_isCoseparator {β : Type w} (f : β → C) [HasProdu
 
 end ZeroMorphisms
 
+#print CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj /-
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) :=
   by
@@ -792,7 +803,9 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (coyoneda.obj (op G)) _ h
     rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique]
 #align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj
+-/
 
+#print CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj /-
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) :=
   by
@@ -804,6 +817,7 @@ theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (yoneda.obj G) _ h
     rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique]
 #align category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj
+-/
 
 #print CategoryTheory.wellPowered_of_isDetector /-
 theorem wellPowered_of_isDetector [HasPullbacks C] (G : C) (hG : IsDetector G) : WellPowered C :=

9d2f0748

bump to nightly-2023-06-09-07

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

16afdc39

Diff

@@ -423,7 +423,6 @@ theorem eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 
     P = P ⊓ Q := Eq.symm <| inf_eq_of_isDetecting h𝒢 _ _ fun G hG f hf => (h G hG).1 hf
     _ = Q ⊓ P := inf_comm
     _ = Q := inf_eq_of_isDetecting h𝒢 _ _ fun G hG f hf => (h G hG).2 hf
-    
 #align category_theory.subobject.eq_of_is_detecting CategoryTheory.Subobject.eq_of_isDetecting
 -/

9d2f0748

bump to nightly-2023-06-04-18

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

3fb4268b

Diff

@@ -434,7 +434,7 @@ end Subobject
 theorem wellPowered_of_isDetecting [HasPullbacks C] {𝒢 : Set C} [Small.{v₁} 𝒢]
     (h𝒢 : IsDetecting 𝒢) : WellPowered C :=
   ⟨fun X =>
-    @small_of_injective _ _ _ (fun P : Subobject X => { f : Σ G : 𝒢, G.1 ⟶ X | P.Factors f.2 })
+    @small_of_injective _ _ _ (fun P : Subobject X => {f : Σ G : 𝒢, G.1 ⟶ X | P.Factors f.2})
       fun P Q h => Subobject.eq_of_isDetecting h𝒢 _ _ (by simpa [Set.ext_iff] using h)⟩
 #align category_theory.well_powered_of_is_detecting CategoryTheory.wellPowered_of_isDetecting
 -/

9d2f0748

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -325,11 +325,11 @@ end Empty
 
 #print CategoryTheory.isSeparating_iff_epi /-
 theorem isSeparating_iff_epi (𝒢 : Set C)
-    [∀ A : C, HasCoproduct fun f : ΣG : 𝒢, (G : C) ⟶ A => (f.1 : C)] :
+    [∀ A : C, HasCoproduct fun f : Σ G : 𝒢, (G : C) ⟶ A => (f.1 : C)] :
     IsSeparating 𝒢 ↔ ∀ A : C, Epi (Sigma.desc (@Sigma.snd 𝒢 fun G => (G : C) ⟶ A)) :=
   by
   refine' ⟨fun h A => ⟨fun Z u v huv => h _ _ fun G hG f => _⟩, fun h X Y f g hh => _⟩
-  · simpa using sigma.ι (fun f : ΣG : 𝒢, (G : C) ⟶ A => (f.1 : C)) ⟨⟨G, hG⟩, f⟩ ≫= huv
+  · simpa using sigma.ι (fun f : Σ G : 𝒢, (G : C) ⟶ A => (f.1 : C)) ⟨⟨G, hG⟩, f⟩ ≫= huv
   · haveI := h X
     refine'
       (cancel_epi (sigma.desc (@Sigma.snd 𝒢 fun G => (G : C) ⟶ X))).1 (colimit.hom_ext fun j => _)
@@ -339,11 +339,11 @@ theorem isSeparating_iff_epi (𝒢 : Set C)
 
 #print CategoryTheory.isCoseparating_iff_mono /-
 theorem isCoseparating_iff_mono (𝒢 : Set C)
-    [∀ A : C, HasProduct fun f : ΣG : 𝒢, A ⟶ (G : C) => (f.1 : C)] :
+    [∀ A : C, HasProduct fun f : Σ G : 𝒢, A ⟶ (G : C) => (f.1 : C)] :
     IsCoseparating 𝒢 ↔ ∀ A : C, Mono (Pi.lift (@Sigma.snd 𝒢 fun G => A ⟶ (G : C))) :=
   by
   refine' ⟨fun h A => ⟨fun Z u v huv => h _ _ fun G hG f => _⟩, fun h X Y f g hh => _⟩
-  · simpa using huv =≫ pi.π (fun f : ΣG : 𝒢, A ⟶ (G : C) => (f.1 : C)) ⟨⟨G, hG⟩, f⟩
+  · simpa using huv =≫ pi.π (fun f : Σ G : 𝒢, A ⟶ (G : C) => (f.1 : C)) ⟨⟨G, hG⟩, f⟩
   · haveI := h Y
     refine' (cancel_mono (pi.lift (@Sigma.snd 𝒢 fun G => Y ⟶ (G : C)))).1 (limit.hom_ext fun j => _)
     simpa using hh j.as.1.1 j.as.1.2 j.as.2
@@ -360,12 +360,12 @@ theorem hasInitial_of_isCoseparating [WellPowered C] [HasLimits C] {𝒢 : Set C
     (h𝒢 : IsCoseparating 𝒢) : HasInitial C :=
   by
   haveI := has_products_of_shape_of_small C 𝒢
-  haveI := fun A => hasProductsOfShape_of_small.{v₁} C (ΣG : 𝒢, A ⟶ (G : C))
+  haveI := fun A => hasProductsOfShape_of_small.{v₁} C (Σ G : 𝒢, A ⟶ (G : C))
   letI := completeLatticeOfCompleteSemilatticeInf (subobject (pi_obj (coe : 𝒢 → C)))
   suffices ∀ A : C, Unique (((⊥ : subobject (pi_obj (coe : 𝒢 → C))) : C) ⟶ A) by
     exact has_initial_of_unique ((⊥ : subobject (pi_obj (coe : 𝒢 → C))) : C)
   refine' fun A => ⟨⟨_⟩, fun f => _⟩
-  · let s := pi.lift fun f : ΣG : 𝒢, A ⟶ (G : C) => id (pi.π (coe : 𝒢 → C)) f.1
+  · let s := pi.lift fun f : Σ G : 𝒢, A ⟶ (G : C) => id (pi.π (coe : 𝒢 → C)) f.1
     let t := pi.lift (@Sigma.snd 𝒢 fun G => A ⟶ (G : C))
     haveI : mono t := (is_coseparating_iff_mono 𝒢).1 h𝒢 A
     exact subobject.of_le_mk _ (pullback.fst : pullback s t ⟶ _) bot_le ≫ pullback.snd
@@ -434,7 +434,7 @@ end Subobject
 theorem wellPowered_of_isDetecting [HasPullbacks C] {𝒢 : Set C} [Small.{v₁} 𝒢]
     (h𝒢 : IsDetecting 𝒢) : WellPowered C :=
   ⟨fun X =>
-    @small_of_injective _ _ _ (fun P : Subobject X => { f : ΣG : 𝒢, G.1 ⟶ X | P.Factors f.2 })
+    @small_of_injective _ _ _ (fun P : Subobject X => { f : Σ G : 𝒢, G.1 ⟶ X | P.Factors f.2 })
       fun P Q h => Subobject.eq_of_isDetecting h𝒢 _ _ (by simpa [Set.ext_iff] using h)⟩
 #align category_theory.well_powered_of_is_detecting CategoryTheory.wellPowered_of_isDetecting
 -/
@@ -685,7 +685,7 @@ theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
   · refine' h.def _ _ fun g => coprod.hom_ext _ _
     · simpa using huv G (by simp) (coprod.inl ≫ g)
     · simpa using huv H (by simp) (coprod.inr ≫ g)
-  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
+  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ 
     rcases hZ with (rfl | rfl)
     · simpa using coprod.inl ≫= huv (coprod.desc g 0)
     · simpa using coprod.inr ≫= huv (coprod.desc 0 g)
@@ -737,7 +737,7 @@ theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
   · refine' h.def _ _ fun g => prod.hom_ext _ _
     · simpa using huv G (by simp) (g ≫ limits.prod.fst)
     · simpa using huv H (by simp) (g ≫ limits.prod.snd)
-  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
+  · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ 
     rcases hZ with (rfl | rfl)
     · simpa using huv (prod.lift g 0) =≫ limits.prod.fst
     · simpa using huv (prod.lift 0 g) =≫ limits.prod.snd
@@ -787,7 +787,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
   refine'
     ⟨fun hG => ⟨fun X Y f hf => hG.def _ fun h => _⟩, fun h =>
       (is_detector_def _).2 fun X Y f hf => _⟩
-  · rw [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf
+  · rw [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf 
     exact hf h
   · suffices is_iso ((coyoneda.obj (op G)).map f) by
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (coyoneda.obj (op G)) _ h
@@ -799,7 +799,7 @@ theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
   by
   refine' ⟨fun hG => ⟨fun X Y f hf => _⟩, fun h => (is_codetector_def _).2 fun X Y f hf => _⟩
   · refine' (is_iso_unop_iff _).1 (hG.def _ _)
-    rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf
+    rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique] at hf 
   · rw [← is_iso_op_iff]
     suffices is_iso ((yoneda.obj G).map f.op) by
       exact @is_iso_of_reflects_iso _ _ _ _ _ _ _ (yoneda.obj G) _ h

9d2f0748

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -396,6 +396,7 @@ section WellPowered
 
 namespace Subobject
 
+#print CategoryTheory.Subobject.eq_of_le_of_isDetecting /-
 theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C} (P Q : Subobject X)
     (h₁ : P ≤ Q) (h₂ : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, Q.Factors f → P.Factors f) : P = Q :=
   by
@@ -408,6 +409,7 @@ theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C
     simp only [← cancel_mono (subobject.of_le _ _ h₁), ← cancel_mono Q.arrow, hg, category.assoc,
       of_le_arrow, factor_thru_arrow]
 #align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetecting
+-/
 
 theorem inf_eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f → Q.Factors f) : P ⊓ Q = P :=

9d2f0748

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -396,12 +396,6 @@ section WellPowered
 
 namespace Subobject
 
-/- warning: category_theory.subobject.eq_of_le_of_is_detecting -> CategoryTheory.Subobject.eq_of_le_of_isDetecting is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (LE.le.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Preorder.toHasLe.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (PartialOrder.toPreorder.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.partialOrder.{u2, u1} C _inst_1 X))) P Q) -> (forall (G : C), (Membership.Mem.{u2, u2} C (Set.{u2} C) (Set.hasMem.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f))) -> (Eq.{succ (max u2 u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) P Q))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (LE.le.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Preorder.toLE.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (PartialOrder.toPreorder.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.instPartialOrderSubobject.{u1, u2} C _inst_1 X))) P Q) -> (forall (G : C), (Membership.mem.{u2, u2} C (Set.{u2} C) (Set.instMembershipSet.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f))) -> (Eq.{max (succ u2) (succ u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) P Q))
-Case conversion may be inaccurate. Consider using '#align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetectingₓ'. -/
 theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C} (P Q : Subobject X)
     (h₁ : P ≤ Q) (h₂ : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, Q.Factors f → P.Factors f) : P = Q :=
   by
@@ -415,12 +409,6 @@ theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C
       of_le_arrow, factor_thru_arrow]
 #align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetecting
 
-/- warning: category_theory.subobject.inf_eq_of_is_detecting -> CategoryTheory.Subobject.inf_eq_of_isDetecting is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] [_inst_3 : CategoryTheory.Limits.HasPullbacks.{u1, u2} C _inst_1] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (forall (G : C), (Membership.Mem.{u2, u2} C (Set.{u2} C) (Set.hasMem.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f))) -> (Eq.{succ (max u2 u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Inf.inf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (SemilatticeInf.toHasInf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.semilatticeInf.{u1, u2} C _inst_1 _inst_3 X)) P Q) P))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] [_inst_3 : CategoryTheory.Limits.HasPullbacks.{u1, u2} C _inst_1] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (forall (G : C), (Membership.mem.{u2, u2} C (Set.{u2} C) (Set.instMembershipSet.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f))) -> (Eq.{max (succ u2) (succ u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Inf.inf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (SemilatticeInf.toInf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.semilatticeInf.{u1, u2} C _inst_1 _inst_3 X)) P Q) P))
-Case conversion may be inaccurate. Consider using '#align category_theory.subobject.inf_eq_of_is_detecting CategoryTheory.Subobject.inf_eq_of_isDetectingₓ'. -/
 theorem inf_eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f → Q.Factors f) : P ⊓ Q = P :=
   eq_of_le_of_isDetecting h𝒢 _ _ inf_le_left fun G hG f hf => (inf_factors _).2 ⟨hf, h _ hG hf⟩
@@ -455,12 +443,6 @@ namespace StructuredArrow
 
 variable (S : D) (T : C ⥤ D)
 
-/- warning: category_theory.structured_arrow.is_coseparating_proj_preimage -> CategoryTheory.StructuredArrow.isCoseparating_proj_preimage is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : D) (T : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) {𝒢 : Set.{u3} C}, (CategoryTheory.IsCoseparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsCoseparating.{max u2 u1, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.StructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (CategoryTheory.Functor.obj.{max u2 u1, u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.StructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.StructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T)) 𝒢))
-but is expected to have type
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : D) (T : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) {𝒢 : Set.{u3} C}, (CategoryTheory.IsCoseparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsCoseparating.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (Prefunctor.obj.{max (succ u1) (succ u2), succ u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CategoryStruct.toQuiver.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.Category.toCategoryStruct.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) C (CategoryTheory.CategoryStruct.toQuiver.{u1, u3} C (CategoryTheory.Category.toCategoryStruct.{u1, u3} C _inst_1)) (CategoryTheory.Functor.toPrefunctor.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.StructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) 𝒢))
-Case conversion may be inaccurate. Consider using '#align category_theory.structured_arrow.is_coseparating_proj_preimage CategoryTheory.StructuredArrow.isCoseparating_proj_preimageₓ'. -/
 theorem isCoseparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsCoseparating 𝒢) :
     IsCoseparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
@@ -474,12 +456,6 @@ namespace CostructuredArrow
 
 variable (S : C ⥤ D) (T : D)
 
-/- warning: category_theory.costructured_arrow.is_separating_proj_preimage -> CategoryTheory.CostructuredArrow.isSeparating_proj_preimage is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) (T : D) {𝒢 : Set.{u3} C}, (CategoryTheory.IsSeparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsSeparating.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CostructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (CategoryTheory.Functor.obj.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CostructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.CostructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T)) 𝒢))
-but is expected to have type
-  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) (T : D) {𝒢 : Set.{u3} C}, (CategoryTheory.IsSeparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsSeparating.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (Prefunctor.obj.{max (succ u1) (succ u2), succ u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CategoryStruct.toQuiver.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.Category.toCategoryStruct.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) C (CategoryTheory.CategoryStruct.toQuiver.{u1, u3} C (CategoryTheory.Category.toCategoryStruct.{u1, u3} C _inst_1)) (CategoryTheory.Functor.toPrefunctor.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.CostructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) 𝒢))
-Case conversion may be inaccurate. Consider using '#align category_theory.costructured_arrow.is_separating_proj_preimage CategoryTheory.CostructuredArrow.isSeparating_proj_preimageₓ'. -/
 theorem isSeparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) :
     IsSeparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
@@ -655,24 +631,12 @@ theorem IsCodetector.def {G : C} :
 #align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
 -/
 
-/- warning: category_theory.is_separator_iff_faithful_coyoneda_obj -> CategoryTheory.isSeparator_iff_faithful_coyoneda_obj is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsSeparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1) (Opposite.op.{succ u2} C G)))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsSeparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u2) (succ u1), u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.toCategoryStruct.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1))) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1)) (Opposite.op.{succ u2} C G)))
-Case conversion may be inaccurate. Consider using '#align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_objₓ'. -/
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
     IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
   ⟨fun hG => ⟨fun X Y f g hfg => hG.def _ _ (congr_fun hfg)⟩, fun h =>
     (isSeparator_def _).2 fun X Y f g hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 
-/- warning: category_theory.is_coseparator_iff_faithful_yoneda_obj -> CategoryTheory.isCoseparator_iff_faithful_yoneda_obj is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCoseparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1) G))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCoseparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u1) (succ u2), u2, max (succ u1) u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1)) G))
-Case conversion may be inaccurate. Consider using '#align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_objₓ'. -/
 theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
   ⟨fun hG => ⟨fun X Y f g hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun h =>
     (isCoseparator_def _).2 fun X Y f g hfg =>
@@ -815,12 +779,6 @@ theorem isCoseparator_pi_of_isCoseparator {β : Type w} (f : β → C) [HasProdu
 
 end ZeroMorphisms
 
-/- warning: category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj -> CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsDetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1) (Opposite.op.{succ u2} C G)))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsDetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u2) (succ u1), u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.toCategoryStruct.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1))) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1)) (Opposite.op.{succ u2} C G)))
-Case conversion may be inaccurate. Consider using '#align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_objₓ'. -/
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) :=
   by
@@ -834,12 +792,6 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique]
 #align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj
 
-/- warning: category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj -> CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj is a dubious translation:
-lean 3 declaration is
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCodetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1) G))
-but is expected to have type
-  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCodetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u1) (succ u2), u2, max (succ u1) u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1)) G))
-Case conversion may be inaccurate. Consider using '#align category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_objₓ'. -/
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) :=
   by

9d2f0748

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -373,10 +373,7 @@ theorem hasInitial_of_isCoseparating [WellPowered C] [HasLimits C] {𝒢 : Set C
     suffices is_split_epi (equalizer.ι f g) by exact eq_of_epi_equalizer
     exact
       is_split_epi.mk'
-        ⟨subobject.of_le_mk _ (equalizer.ι f g ≫ subobject.arrow _) bot_le,
-          by
-          ext
-          simp⟩
+        ⟨subobject.of_le_mk _ (equalizer.ι f g ≫ subobject.arrow _) bot_le, by ext; simp⟩
 #align category_theory.has_initial_of_is_coseparating CategoryTheory.hasInitial_of_isCoseparating
 -/
 
@@ -600,9 +597,7 @@ theorem IsCospearator.isCodetector [Balanced C] {G : C} : IsCoseparator G → Is
 theorem isSeparator_def (G : C) :
     IsSeparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   ⟨fun hG X Y f g hfg =>
-    hG _ _ fun H hH h => by
-      obtain rfl := Set.mem_singleton_iff.1 hH
-      exact hfg h,
+    hG _ _ fun H hH h => by obtain rfl := Set.mem_singleton_iff.1 hH; exact hfg h,
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
 -/
@@ -618,9 +613,7 @@ theorem IsSeparator.def {G : C} :
 theorem isCoseparator_def (G : C) :
     IsCoseparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   ⟨fun hG X Y f g hfg =>
-    hG _ _ fun H hH h => by
-      obtain rfl := Set.mem_singleton_iff.1 hH
-      exact hfg h,
+    hG _ _ fun H hH h => by obtain rfl := Set.mem_singleton_iff.1 hH; exact hfg h,
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
 -/
@@ -635,10 +628,7 @@ theorem IsCoseparator.def {G : C} :
 #print CategoryTheory.isDetector_def /-
 theorem isDetector_def (G : C) :
     IsDetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
-  ⟨fun hG X Y f hf =>
-    hG _ fun H hH h => by
-      obtain rfl := Set.mem_singleton_iff.1 hH
-      exact hf h,
+  ⟨fun hG X Y f hf => hG _ fun H hH h => by obtain rfl := Set.mem_singleton_iff.1 hH; exact hf h,
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
 -/
@@ -653,10 +643,7 @@ theorem IsDetector.def {G : C} :
 #print CategoryTheory.isCodetector_def /-
 theorem isCodetector_def (G : C) :
     IsCodetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
-  ⟨fun hG X Y f hf =>
-    hG _ fun H hH h => by
-      obtain rfl := Set.mem_singleton_iff.1 hH
-      exact hf h,
+  ⟨fun hG X Y f hf => hG _ fun H hH h => by obtain rfl := Set.mem_singleton_iff.1 hH; exact hf h,
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
 -/

9d2f0748

bump to nightly-2023-05-16-16

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

9cb92e8c

Diff

@@ -399,7 +399,12 @@ section WellPowered
 
 namespace Subobject
 
-#print CategoryTheory.Subobject.eq_of_le_of_isDetecting /-
+/- warning: category_theory.subobject.eq_of_le_of_is_detecting -> CategoryTheory.Subobject.eq_of_le_of_isDetecting is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (LE.le.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Preorder.toHasLe.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (PartialOrder.toPreorder.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.partialOrder.{u2, u1} C _inst_1 X))) P Q) -> (forall (G : C), (Membership.Mem.{u2, u2} C (Set.{u2} C) (Set.hasMem.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f))) -> (Eq.{succ (max u2 u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) P Q))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (LE.le.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Preorder.toLE.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (PartialOrder.toPreorder.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.instPartialOrderSubobject.{u1, u2} C _inst_1 X))) P Q) -> (forall (G : C), (Membership.mem.{u2, u2} C (Set.{u2} C) (Set.instMembershipSet.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f))) -> (Eq.{max (succ u2) (succ u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) P Q))
+Case conversion may be inaccurate. Consider using '#align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetectingₓ'. -/
 theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C} (P Q : Subobject X)
     (h₁ : P ≤ Q) (h₂ : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, Q.Factors f → P.Factors f) : P = Q :=
   by
@@ -412,7 +417,6 @@ theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C
     simp only [← cancel_mono (subobject.of_le _ _ h₁), ← cancel_mono Q.arrow, hg, category.assoc,
       of_le_arrow, factor_thru_arrow]
 #align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetecting
--/
 
 /- warning: category_theory.subobject.inf_eq_of_is_detecting -> CategoryTheory.Subobject.inf_eq_of_isDetecting is a dubious translation:
 lean 3 declaration is

9d2f0748

bump to nightly-2023-04-28-02

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

473bb540

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
 
 ! This file was ported from Lean 3 source module category_theory.generator
-! leanprover-community/mathlib commit f187f1074fa1857c94589cc653c786cadc4c35ff
+! leanprover-community/mathlib commit 9d2f0748e6c50d7a2657c564b1ff2c695b39148d
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -19,6 +19,9 @@ import Mathbin.Data.Set.Opposite
 /-!
 # Separating and detecting sets
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 There are several non-equivalent notions of a generator of a category. Here, we consider two of
 them:

f187f107

bump to nightly-2023-04-25-00

mathlib commit https://github.com/leanprover-community/mathlib/commit/09079525fd01b3dda35e96adaa08d2f943e1648c

f51daedd

Diff

@@ -65,33 +65,42 @@ namespace CategoryTheory
 
 variable {C : Type u₁} [Category.{v₁} C] {D : Type u₂} [Category.{v₂} D]
 
+#print CategoryTheory.IsSeparating /-
 /-- We say that `𝒢` is a separating set if the functors `C(G, -)` for `G ∈ 𝒢` are collectively
     faithful, i.e., if `h ≫ f = h ≫ g` for all `h` with domain in `𝒢` implies `f = g`. -/
 def IsSeparating (𝒢 : Set C) : Prop :=
   ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ G ∈ 𝒢, ∀ (h : G ⟶ X), h ≫ f = h ≫ g) → f = g
 #align category_theory.is_separating CategoryTheory.IsSeparating
+-/
 
+#print CategoryTheory.IsCoseparating /-
 /-- We say that `𝒢` is a coseparating set if the functors `C(-, G)` for `G ∈ 𝒢` are collectively
     faithful, i.e., if `f ≫ h = g ≫ h` for all `h` with codomain in `𝒢` implies `f = g`. -/
 def IsCoseparating (𝒢 : Set C) : Prop :=
   ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ G ∈ 𝒢, ∀ (h : Y ⟶ G), f ≫ h = g ≫ h) → f = g
 #align category_theory.is_coseparating CategoryTheory.IsCoseparating
+-/
 
+#print CategoryTheory.IsDetecting /-
 /-- We say that `𝒢` is a detecting set if the functors `C(G, -)` collectively reflect isomorphisms,
     i.e., if any `h` with domain in `𝒢` uniquely factors through `f`, then `f` is an isomorphism. -/
 def IsDetecting (𝒢 : Set C) : Prop :=
   ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ G ∈ 𝒢, ∀ (h : G ⟶ Y), ∃! h' : G ⟶ X, h' ≫ f = h) → IsIso f
 #align category_theory.is_detecting CategoryTheory.IsDetecting
+-/
 
+#print CategoryTheory.IsCodetecting /-
 /-- We say that `𝒢` is a codetecting set if the functors `C(-, G)` collectively reflect
     isomorphisms, i.e., if any `h` with codomain in `G` uniquely factors through `f`, then `f` is
     an isomorphism. -/
 def IsCodetecting (𝒢 : Set C) : Prop :=
   ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ G ∈ 𝒢, ∀ (h : X ⟶ G), ∃! h' : Y ⟶ G, f ≫ h' = h) → IsIso f
 #align category_theory.is_codetecting CategoryTheory.IsCodetecting
+-/
 
 section Dual
 
+#print CategoryTheory.isSeparating_op_iff /-
 theorem isSeparating_op_iff (𝒢 : Set C) : IsSeparating 𝒢.op ↔ IsCoseparating 𝒢 :=
   by
   refine' ⟨fun h𝒢 X Y f g hfg => _, fun h𝒢 X Y f g hfg => _⟩
@@ -100,7 +109,9 @@ theorem isSeparating_op_iff (𝒢 : Set C) : IsSeparating 𝒢.op ↔ IsCosepara
   · refine' Quiver.Hom.unop_inj (h𝒢 _ _ fun G hG h => Quiver.Hom.op_inj _)
     simpa only [op_comp, Quiver.Hom.op_unop] using hfg _ (Set.op_mem_op.2 hG) _
 #align category_theory.is_separating_op_iff CategoryTheory.isSeparating_op_iff
+-/
 
+#print CategoryTheory.isCoseparating_op_iff /-
 theorem isCoseparating_op_iff (𝒢 : Set C) : IsCoseparating 𝒢.op ↔ IsSeparating 𝒢 :=
   by
   refine' ⟨fun h𝒢 X Y f g hfg => _, fun h𝒢 X Y f g hfg => _⟩
@@ -109,15 +120,21 @@ theorem isCoseparating_op_iff (𝒢 : Set C) : IsCoseparating 𝒢.op ↔ IsSepa
   · refine' Quiver.Hom.unop_inj (h𝒢 _ _ fun G hG h => Quiver.Hom.op_inj _)
     simpa only [op_comp, Quiver.Hom.op_unop] using hfg _ (Set.op_mem_op.2 hG) _
 #align category_theory.is_coseparating_op_iff CategoryTheory.isCoseparating_op_iff
+-/
 
+#print CategoryTheory.isCoseparating_unop_iff /-
 theorem isCoseparating_unop_iff (𝒢 : Set Cᵒᵖ) : IsCoseparating 𝒢.unop ↔ IsSeparating 𝒢 := by
   rw [← is_separating_op_iff, Set.unop_op]
 #align category_theory.is_coseparating_unop_iff CategoryTheory.isCoseparating_unop_iff
+-/
 
+#print CategoryTheory.isSeparating_unop_iff /-
 theorem isSeparating_unop_iff (𝒢 : Set Cᵒᵖ) : IsSeparating 𝒢.unop ↔ IsCoseparating 𝒢 := by
   rw [← is_coseparating_op_iff, Set.unop_op]
 #align category_theory.is_separating_unop_iff CategoryTheory.isSeparating_unop_iff
+-/
 
+#print CategoryTheory.isDetecting_op_iff /-
 theorem isDetecting_op_iff (𝒢 : Set C) : IsDetecting 𝒢.op ↔ IsCodetecting 𝒢 :=
   by
   refine' ⟨fun h𝒢 X Y f hf => _, fun h𝒢 X Y f hf => _⟩
@@ -130,7 +147,9 @@ theorem isDetecting_op_iff (𝒢 : Set C) : IsDetecting 𝒢.op ↔ IsCodetectin
     refine' ⟨t.unop, Quiver.Hom.op_inj ht, fun y hy => Quiver.Hom.op_inj (ht' _ _)⟩
     exact Quiver.Hom.unop_inj (by simpa only using hy)
 #align category_theory.is_detecting_op_iff CategoryTheory.isDetecting_op_iff
+-/
 
+#print CategoryTheory.isCodetecting_op_iff /-
 theorem isCodetecting_op_iff (𝒢 : Set C) : IsCodetecting 𝒢.op ↔ IsDetecting 𝒢 :=
   by
   refine' ⟨fun h𝒢 X Y f hf => _, fun h𝒢 X Y f hf => _⟩
@@ -143,32 +162,42 @@ theorem isCodetecting_op_iff (𝒢 : Set C) : IsCodetecting 𝒢.op ↔ IsDetect
     refine' ⟨t.unop, Quiver.Hom.op_inj ht, fun y hy => Quiver.Hom.op_inj (ht' _ _)⟩
     exact Quiver.Hom.unop_inj (by simpa only using hy)
 #align category_theory.is_codetecting_op_iff CategoryTheory.isCodetecting_op_iff
+-/
 
+#print CategoryTheory.isDetecting_unop_iff /-
 theorem isDetecting_unop_iff (𝒢 : Set Cᵒᵖ) : IsDetecting 𝒢.unop ↔ IsCodetecting 𝒢 := by
   rw [← is_codetecting_op_iff, Set.unop_op]
 #align category_theory.is_detecting_unop_iff CategoryTheory.isDetecting_unop_iff
+-/
 
+#print CategoryTheory.isCodetecting_unop_iff /-
 theorem isCodetecting_unop_iff {𝒢 : Set Cᵒᵖ} : IsCodetecting 𝒢.unop ↔ IsDetecting 𝒢 := by
   rw [← is_detecting_op_iff, Set.unop_op]
 #align category_theory.is_codetecting_unop_iff CategoryTheory.isCodetecting_unop_iff
+-/
 
 end Dual
 
+#print CategoryTheory.IsDetecting.isSeparating /-
 theorem IsDetecting.isSeparating [HasEqualizers C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) :
     IsSeparating 𝒢 := fun X Y f g hfg =>
   have : IsIso (equalizer.ι f g) := h𝒢 _ fun G hG h => equalizer.existsUnique _ (hfg _ hG _)
   eq_of_epi_equalizer
 #align category_theory.is_detecting.is_separating CategoryTheory.IsDetecting.isSeparating
+-/
 
 section
 
+#print CategoryTheory.IsCodetecting.isCoseparating /-
 theorem IsCodetecting.isCoseparating [HasCoequalizers C] {𝒢 : Set C} :
     IsCodetecting 𝒢 → IsCoseparating 𝒢 := by
   simpa only [← is_separating_op_iff, ← is_detecting_op_iff] using is_detecting.is_separating
 #align category_theory.is_codetecting.is_coseparating CategoryTheory.IsCodetecting.isCoseparating
+-/
 
 end
 
+#print CategoryTheory.IsSeparating.isDetecting /-
 theorem IsSeparating.isDetecting [Balanced C] {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) : IsDetecting 𝒢 :=
   by
   intro X Y f hf
@@ -180,86 +209,118 @@ theorem IsSeparating.isDetecting [Balanced C] {𝒢 : Set C} (h𝒢 : IsSeparati
     obtain ⟨t, rfl, -⟩ := hf G hG i
     rw [category.assoc, hgh, category.assoc]
 #align category_theory.is_separating.is_detecting CategoryTheory.IsSeparating.isDetecting
+-/
 
 section
 
 attribute [local instance] balanced_opposite
 
+#print CategoryTheory.IsCoseparating.isCodetecting /-
 theorem IsCoseparating.isCodetecting [Balanced C] {𝒢 : Set C} :
     IsCoseparating 𝒢 → IsCodetecting 𝒢 := by
   simpa only [← is_detecting_op_iff, ← is_separating_op_iff] using is_separating.is_detecting
 #align category_theory.is_coseparating.is_codetecting CategoryTheory.IsCoseparating.isCodetecting
+-/
 
 end
 
+#print CategoryTheory.isDetecting_iff_isSeparating /-
 theorem isDetecting_iff_isSeparating [HasEqualizers C] [Balanced C] (𝒢 : Set C) :
     IsDetecting 𝒢 ↔ IsSeparating 𝒢 :=
   ⟨IsDetecting.isSeparating, IsSeparating.isDetecting⟩
 #align category_theory.is_detecting_iff_is_separating CategoryTheory.isDetecting_iff_isSeparating
+-/
 
+#print CategoryTheory.isCodetecting_iff_isCoseparating /-
 theorem isCodetecting_iff_isCoseparating [HasCoequalizers C] [Balanced C] {𝒢 : Set C} :
     IsCodetecting 𝒢 ↔ IsCoseparating 𝒢 :=
   ⟨IsCodetecting.isCoseparating, IsCoseparating.isCodetecting⟩
 #align category_theory.is_codetecting_iff_is_coseparating CategoryTheory.isCodetecting_iff_isCoseparating
+-/
 
 section Mono
 
+#print CategoryTheory.IsSeparating.mono /-
 theorem IsSeparating.mono {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) {ℋ : Set C} (h𝒢ℋ : 𝒢 ⊆ ℋ) :
     IsSeparating ℋ := fun X Y f g hfg => h𝒢 _ _ fun G hG h => hfg _ (h𝒢ℋ hG) _
 #align category_theory.is_separating.mono CategoryTheory.IsSeparating.mono
+-/
 
+#print CategoryTheory.IsCoseparating.mono /-
 theorem IsCoseparating.mono {𝒢 : Set C} (h𝒢 : IsCoseparating 𝒢) {ℋ : Set C} (h𝒢ℋ : 𝒢 ⊆ ℋ) :
     IsCoseparating ℋ := fun X Y f g hfg => h𝒢 _ _ fun G hG h => hfg _ (h𝒢ℋ hG) _
 #align category_theory.is_coseparating.mono CategoryTheory.IsCoseparating.mono
+-/
 
+#print CategoryTheory.IsDetecting.mono /-
 theorem IsDetecting.mono {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {ℋ : Set C} (h𝒢ℋ : 𝒢 ⊆ ℋ) :
     IsDetecting ℋ := fun X Y f hf => h𝒢 _ fun G hG h => hf _ (h𝒢ℋ hG) _
 #align category_theory.is_detecting.mono CategoryTheory.IsDetecting.mono
+-/
 
+#print CategoryTheory.IsCodetecting.mono /-
 theorem IsCodetecting.mono {𝒢 : Set C} (h𝒢 : IsCodetecting 𝒢) {ℋ : Set C} (h𝒢ℋ : 𝒢 ⊆ ℋ) :
     IsCodetecting ℋ := fun X Y f hf => h𝒢 _ fun G hG h => hf _ (h𝒢ℋ hG) _
 #align category_theory.is_codetecting.mono CategoryTheory.IsCodetecting.mono
+-/
 
 end Mono
 
 section Empty
 
+#print CategoryTheory.thin_of_isSeparating_empty /-
 theorem thin_of_isSeparating_empty (h : IsSeparating (∅ : Set C)) : Quiver.IsThin C := fun _ _ =>
   ⟨fun f g => h _ _ fun G => False.elim⟩
 #align category_theory.thin_of_is_separating_empty CategoryTheory.thin_of_isSeparating_empty
+-/
 
+#print CategoryTheory.isSeparating_empty_of_thin /-
 theorem isSeparating_empty_of_thin [Quiver.IsThin C] : IsSeparating (∅ : Set C) :=
   fun X Y f g hfg => Subsingleton.elim _ _
 #align category_theory.is_separating_empty_of_thin CategoryTheory.isSeparating_empty_of_thin
+-/
 
+#print CategoryTheory.thin_of_isCoseparating_empty /-
 theorem thin_of_isCoseparating_empty (h : IsCoseparating (∅ : Set C)) : Quiver.IsThin C :=
   fun _ _ => ⟨fun f g => h _ _ fun G => False.elim⟩
 #align category_theory.thin_of_is_coseparating_empty CategoryTheory.thin_of_isCoseparating_empty
+-/
 
+#print CategoryTheory.isCoseparating_empty_of_thin /-
 theorem isCoseparating_empty_of_thin [Quiver.IsThin C] : IsCoseparating (∅ : Set C) :=
   fun X Y f g hfg => Subsingleton.elim _ _
 #align category_theory.is_coseparating_empty_of_thin CategoryTheory.isCoseparating_empty_of_thin
+-/
 
+#print CategoryTheory.groupoid_of_isDetecting_empty /-
 theorem groupoid_of_isDetecting_empty (h : IsDetecting (∅ : Set C)) {X Y : C} (f : X ⟶ Y) :
     IsIso f :=
   h _ fun G => False.elim
 #align category_theory.groupoid_of_is_detecting_empty CategoryTheory.groupoid_of_isDetecting_empty
+-/
 
+#print CategoryTheory.isDetecting_empty_of_groupoid /-
 theorem isDetecting_empty_of_groupoid [∀ {X Y : C} (f : X ⟶ Y), IsIso f] :
     IsDetecting (∅ : Set C) := fun X Y f hf => inferInstance
 #align category_theory.is_detecting_empty_of_groupoid CategoryTheory.isDetecting_empty_of_groupoid
+-/
 
+#print CategoryTheory.groupoid_of_isCodetecting_empty /-
 theorem groupoid_of_isCodetecting_empty (h : IsCodetecting (∅ : Set C)) {X Y : C} (f : X ⟶ Y) :
     IsIso f :=
   h _ fun G => False.elim
 #align category_theory.groupoid_of_is_codetecting_empty CategoryTheory.groupoid_of_isCodetecting_empty
+-/
 
+#print CategoryTheory.isCodetecting_empty_of_groupoid /-
 theorem isCodetecting_empty_of_groupoid [∀ {X Y : C} (f : X ⟶ Y), IsIso f] :
     IsCodetecting (∅ : Set C) := fun X Y f hf => inferInstance
 #align category_theory.is_codetecting_empty_of_groupoid CategoryTheory.isCodetecting_empty_of_groupoid
+-/
 
 end Empty
 
+#print CategoryTheory.isSeparating_iff_epi /-
 theorem isSeparating_iff_epi (𝒢 : Set C)
     [∀ A : C, HasCoproduct fun f : ΣG : 𝒢, (G : C) ⟶ A => (f.1 : C)] :
     IsSeparating 𝒢 ↔ ∀ A : C, Epi (Sigma.desc (@Sigma.snd 𝒢 fun G => (G : C) ⟶ A)) :=
@@ -271,7 +332,9 @@ theorem isSeparating_iff_epi (𝒢 : Set C)
       (cancel_epi (sigma.desc (@Sigma.snd 𝒢 fun G => (G : C) ⟶ X))).1 (colimit.hom_ext fun j => _)
     simpa using hh j.as.1.1 j.as.1.2 j.as.2
 #align category_theory.is_separating_iff_epi CategoryTheory.isSeparating_iff_epi
+-/
 
+#print CategoryTheory.isCoseparating_iff_mono /-
 theorem isCoseparating_iff_mono (𝒢 : Set C)
     [∀ A : C, HasProduct fun f : ΣG : 𝒢, A ⟶ (G : C) => (f.1 : C)] :
     IsCoseparating 𝒢 ↔ ∀ A : C, Mono (Pi.lift (@Sigma.snd 𝒢 fun G => A ⟶ (G : C))) :=
@@ -282,7 +345,9 @@ theorem isCoseparating_iff_mono (𝒢 : Set C)
     refine' (cancel_mono (pi.lift (@Sigma.snd 𝒢 fun G => Y ⟶ (G : C)))).1 (limit.hom_ext fun j => _)
     simpa using hh j.as.1.1 j.as.1.2 j.as.2
 #align category_theory.is_coseparating_iff_mono CategoryTheory.isCoseparating_iff_mono
+-/
 
+#print CategoryTheory.hasInitial_of_isCoseparating /-
 /-- An ingredient of the proof of the Special Adjoint Functor Theorem: a complete well-powered
     category with a small coseparating set has an initial object.
 
@@ -310,7 +375,9 @@ theorem hasInitial_of_isCoseparating [WellPowered C] [HasLimits C] {𝒢 : Set C
           ext
           simp⟩
 #align category_theory.has_initial_of_is_coseparating CategoryTheory.hasInitial_of_isCoseparating
+-/
 
+#print CategoryTheory.hasTerminal_of_isSeparating /-
 /-- An ingredient of the proof of the Special Adjoint Functor Theorem: a cocomplete well-copowered
     category with a small separating set has a terminal object.
 
@@ -323,11 +390,13 @@ theorem hasTerminal_of_isSeparating [WellPowered Cᵒᵖ] [HasColimits C] {𝒢
   haveI : has_initial Cᵒᵖ := has_initial_of_is_coseparating ((is_coseparating_op_iff _).2 h𝒢)
   exact has_terminal_of_has_initial_op
 #align category_theory.has_terminal_of_is_separating CategoryTheory.hasTerminal_of_isSeparating
+-/
 
 section WellPowered
 
 namespace Subobject
 
+#print CategoryTheory.Subobject.eq_of_le_of_isDetecting /-
 theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C} (P Q : Subobject X)
     (h₁ : P ≤ Q) (h₂ : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, Q.Factors f → P.Factors f) : P = Q :=
   by
@@ -340,12 +409,20 @@ theorem eq_of_le_of_isDetecting {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C
     simp only [← cancel_mono (subobject.of_le _ _ h₁), ← cancel_mono Q.arrow, hg, category.assoc,
       of_le_arrow, factor_thru_arrow]
 #align category_theory.subobject.eq_of_le_of_is_detecting CategoryTheory.Subobject.eq_of_le_of_isDetecting
+-/
 
+/- warning: category_theory.subobject.inf_eq_of_is_detecting -> CategoryTheory.Subobject.inf_eq_of_isDetecting is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] [_inst_3 : CategoryTheory.Limits.HasPullbacks.{u1, u2} C _inst_1] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (forall (G : C), (Membership.Mem.{u2, u2} C (Set.{u2} C) (Set.hasMem.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f))) -> (Eq.{succ (max u2 u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Inf.inf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (SemilatticeInf.toHasInf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.semilatticeInf.{u1, u2} C _inst_1 _inst_3 X)) P Q) P))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] [_inst_3 : CategoryTheory.Limits.HasPullbacks.{u1, u2} C _inst_1] {𝒢 : Set.{u2} C}, (CategoryTheory.IsDetecting.{u1, u2} C _inst_1 𝒢) -> (forall {X : C} (P : CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Q : CategoryTheory.Subobject.{u1, u2} C _inst_1 X), (forall (G : C), (Membership.mem.{u2, u2} C (Set.{u2} C) (Set.instMembershipSet.{u2} C) G 𝒢) -> (forall {f : Quiver.Hom.{succ u1, u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) G X}, (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X P f) -> (CategoryTheory.Subobject.Factors.{u1, u2} C _inst_1 G X Q f))) -> (Eq.{max (succ u2) (succ u1)} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (Inf.inf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (SemilatticeInf.toInf.{max u2 u1} (CategoryTheory.Subobject.{u1, u2} C _inst_1 X) (CategoryTheory.Subobject.semilatticeInf.{u1, u2} C _inst_1 _inst_3 X)) P Q) P))
+Case conversion may be inaccurate. Consider using '#align category_theory.subobject.inf_eq_of_is_detecting CategoryTheory.Subobject.inf_eq_of_isDetectingₓ'. -/
 theorem inf_eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f → Q.Factors f) : P ⊓ Q = P :=
   eq_of_le_of_isDetecting h𝒢 _ _ inf_le_left fun G hG f hf => (inf_factors _).2 ⟨hf, h _ hG hf⟩
 #align category_theory.subobject.inf_eq_of_is_detecting CategoryTheory.Subobject.inf_eq_of_isDetecting
 
+#print CategoryTheory.Subobject.eq_of_isDetecting /-
 theorem eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 𝒢) {X : C}
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f ↔ Q.Factors f) : P = Q :=
   calc
@@ -354,9 +431,11 @@ theorem eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 
     _ = Q := inf_eq_of_isDetecting h𝒢 _ _ fun G hG f hf => (h G hG).2 hf
     
 #align category_theory.subobject.eq_of_is_detecting CategoryTheory.Subobject.eq_of_isDetecting
+-/
 
 end Subobject
 
+#print CategoryTheory.wellPowered_of_isDetecting /-
 /-- A category with pullbacks and a small detecting set is well-powered. -/
 theorem wellPowered_of_isDetecting [HasPullbacks C] {𝒢 : Set C} [Small.{v₁} 𝒢]
     (h𝒢 : IsDetecting 𝒢) : WellPowered C :=
@@ -364,6 +443,7 @@ theorem wellPowered_of_isDetecting [HasPullbacks C] {𝒢 : Set C} [Small.{v₁}
     @small_of_injective _ _ _ (fun P : Subobject X => { f : ΣG : 𝒢, G.1 ⟶ X | P.Factors f.2 })
       fun P Q h => Subobject.eq_of_isDetecting h𝒢 _ _ (by simpa [Set.ext_iff] using h)⟩
 #align category_theory.well_powered_of_is_detecting CategoryTheory.wellPowered_of_isDetecting
+-/
 
 end WellPowered
 
@@ -371,6 +451,12 @@ namespace StructuredArrow
 
 variable (S : D) (T : C ⥤ D)
 
+/- warning: category_theory.structured_arrow.is_coseparating_proj_preimage -> CategoryTheory.StructuredArrow.isCoseparating_proj_preimage is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : D) (T : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) {𝒢 : Set.{u3} C}, (CategoryTheory.IsCoseparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsCoseparating.{max u2 u1, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.StructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (CategoryTheory.Functor.obj.{max u2 u1, u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.StructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.StructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T)) 𝒢))
+but is expected to have type
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : D) (T : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) {𝒢 : Set.{u3} C}, (CategoryTheory.IsCoseparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsCoseparating.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (Prefunctor.obj.{max (succ u1) (succ u2), succ u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CategoryStruct.toQuiver.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.Category.toCategoryStruct.{max u1 u2, max u3 u2} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) C (CategoryTheory.CategoryStruct.toQuiver.{u1, u3} C (CategoryTheory.Category.toCategoryStruct.{u1, u3} C _inst_1)) (CategoryTheory.Functor.toPrefunctor.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.StructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryStructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.StructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) 𝒢))
+Case conversion may be inaccurate. Consider using '#align category_theory.structured_arrow.is_coseparating_proj_preimage CategoryTheory.StructuredArrow.isCoseparating_proj_preimageₓ'. -/
 theorem isCoseparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsCoseparating 𝒢) :
     IsCoseparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
@@ -384,6 +470,12 @@ namespace CostructuredArrow
 
 variable (S : C ⥤ D) (T : D)
 
+/- warning: category_theory.costructured_arrow.is_separating_proj_preimage -> CategoryTheory.CostructuredArrow.isSeparating_proj_preimage is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) (T : D) {𝒢 : Set.{u3} C}, (CategoryTheory.IsSeparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsSeparating.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CostructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (CategoryTheory.Functor.obj.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CostructuredArrow.category.{u2, u4, u3, u1} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.CostructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T)) 𝒢))
+but is expected to have type
+  forall {C : Type.{u3}} [_inst_1 : CategoryTheory.Category.{u1, u3} C] {D : Type.{u4}} [_inst_2 : CategoryTheory.Category.{u2, u4} D] (S : CategoryTheory.Functor.{u1, u2, u3, u4} C _inst_1 D _inst_2) (T : D) {𝒢 : Set.{u3} C}, (CategoryTheory.IsSeparating.{u1, u3} C _inst_1 𝒢) -> (CategoryTheory.IsSeparating.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (Set.preimage.{max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C (Prefunctor.obj.{max (succ u1) (succ u2), succ u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.CategoryStruct.toQuiver.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.Category.toCategoryStruct.{max u1 u2, max u3 u2} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) C (CategoryTheory.CategoryStruct.toQuiver.{u1, u3} C (CategoryTheory.Category.toCategoryStruct.{u1, u3} C _inst_1)) (CategoryTheory.Functor.toPrefunctor.{max u1 u2, u1, max u3 u2, u3} (CategoryTheory.CostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) (CategoryTheory.instCategoryCostructuredArrow.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T) C _inst_1 (CategoryTheory.CostructuredArrow.proj.{u1, u2, u3, u4} C _inst_1 D _inst_2 S T))) 𝒢))
+Case conversion may be inaccurate. Consider using '#align category_theory.costructured_arrow.is_separating_proj_preimage CategoryTheory.CostructuredArrow.isSeparating_proj_preimageₓ'. -/
 theorem isSeparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) :
     IsSeparating ((proj S T).obj ⁻¹' 𝒢) :=
   by
@@ -393,78 +485,111 @@ theorem isSeparating_proj_preimage {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) :
 
 end CostructuredArrow
 
+#print CategoryTheory.IsSeparator /-
 /-- We say that `G` is a separator if the functor `C(G, -)` is faithful. -/
 def IsSeparator (G : C) : Prop :=
   IsSeparating ({G} : Set C)
 #align category_theory.is_separator CategoryTheory.IsSeparator
+-/
 
+#print CategoryTheory.IsCoseparator /-
 /-- We say that `G` is a coseparator if the functor `C(-, G)` is faithful. -/
 def IsCoseparator (G : C) : Prop :=
   IsCoseparating ({G} : Set C)
 #align category_theory.is_coseparator CategoryTheory.IsCoseparator
+-/
 
+#print CategoryTheory.IsDetector /-
 /-- We say that `G` is a detector if the functor `C(G, -)` reflects isomorphisms. -/
 def IsDetector (G : C) : Prop :=
   IsDetecting ({G} : Set C)
 #align category_theory.is_detector CategoryTheory.IsDetector
+-/
 
+#print CategoryTheory.IsCodetector /-
 /-- We say that `G` is a codetector if the functor `C(-, G)` reflects isomorphisms. -/
 def IsCodetector (G : C) : Prop :=
   IsCodetecting ({G} : Set C)
 #align category_theory.is_codetector CategoryTheory.IsCodetector
+-/
 
 section Dual
 
+#print CategoryTheory.isSeparator_op_iff /-
 theorem isSeparator_op_iff (G : C) : IsSeparator (op G) ↔ IsCoseparator G := by
   rw [is_separator, is_coseparator, ← is_separating_op_iff, Set.singleton_op]
 #align category_theory.is_separator_op_iff CategoryTheory.isSeparator_op_iff
+-/
 
+#print CategoryTheory.isCoseparator_op_iff /-
 theorem isCoseparator_op_iff (G : C) : IsCoseparator (op G) ↔ IsSeparator G := by
   rw [is_separator, is_coseparator, ← is_coseparating_op_iff, Set.singleton_op]
 #align category_theory.is_coseparator_op_iff CategoryTheory.isCoseparator_op_iff
+-/
 
+#print CategoryTheory.isCoseparator_unop_iff /-
 theorem isCoseparator_unop_iff (G : Cᵒᵖ) : IsCoseparator (unop G) ↔ IsSeparator G := by
   rw [is_separator, is_coseparator, ← is_coseparating_unop_iff, Set.singleton_unop]
 #align category_theory.is_coseparator_unop_iff CategoryTheory.isCoseparator_unop_iff
+-/
 
+#print CategoryTheory.isSeparator_unop_iff /-
 theorem isSeparator_unop_iff (G : Cᵒᵖ) : IsSeparator (unop G) ↔ IsCoseparator G := by
   rw [is_separator, is_coseparator, ← is_separating_unop_iff, Set.singleton_unop]
 #align category_theory.is_separator_unop_iff CategoryTheory.isSeparator_unop_iff
+-/
 
+#print CategoryTheory.isDetector_op_iff /-
 theorem isDetector_op_iff (G : C) : IsDetector (op G) ↔ IsCodetector G := by
   rw [is_detector, is_codetector, ← is_detecting_op_iff, Set.singleton_op]
 #align category_theory.is_detector_op_iff CategoryTheory.isDetector_op_iff
+-/
 
+#print CategoryTheory.isCodetector_op_iff /-
 theorem isCodetector_op_iff (G : C) : IsCodetector (op G) ↔ IsDetector G := by
   rw [is_detector, is_codetector, ← is_codetecting_op_iff, Set.singleton_op]
 #align category_theory.is_codetector_op_iff CategoryTheory.isCodetector_op_iff
+-/
 
+#print CategoryTheory.isCodetector_unop_iff /-
 theorem isCodetector_unop_iff (G : Cᵒᵖ) : IsCodetector (unop G) ↔ IsDetector G := by
   rw [is_detector, is_codetector, ← is_codetecting_unop_iff, Set.singleton_unop]
 #align category_theory.is_codetector_unop_iff CategoryTheory.isCodetector_unop_iff
+-/
 
+#print CategoryTheory.isDetector_unop_iff /-
 theorem isDetector_unop_iff (G : Cᵒᵖ) : IsDetector (unop G) ↔ IsCodetector G := by
   rw [is_detector, is_codetector, ← is_detecting_unop_iff, Set.singleton_unop]
 #align category_theory.is_detector_unop_iff CategoryTheory.isDetector_unop_iff
+-/
 
 end Dual
 
+#print CategoryTheory.IsDetector.isSeparator /-
 theorem IsDetector.isSeparator [HasEqualizers C] {G : C} : IsDetector G → IsSeparator G :=
   IsDetecting.isSeparating
 #align category_theory.is_detector.is_separator CategoryTheory.IsDetector.isSeparator
+-/
 
+#print CategoryTheory.IsCodetector.isCoseparator /-
 theorem IsCodetector.isCoseparator [HasCoequalizers C] {G : C} : IsCodetector G → IsCoseparator G :=
   IsCodetecting.isCoseparating
 #align category_theory.is_codetector.is_coseparator CategoryTheory.IsCodetector.isCoseparator
+-/
 
+#print CategoryTheory.IsSeparator.isDetector /-
 theorem IsSeparator.isDetector [Balanced C] {G : C} : IsSeparator G → IsDetector G :=
   IsSeparating.isDetecting
 #align category_theory.is_separator.is_detector CategoryTheory.IsSeparator.isDetector
+-/
 
+#print CategoryTheory.IsCospearator.isCodetector /-
 theorem IsCospearator.isCodetector [Balanced C] {G : C} : IsCoseparator G → IsCodetector G :=
   IsCoseparating.isCodetecting
 #align category_theory.is_cospearator.is_codetector CategoryTheory.IsCospearator.isCodetector
+-/
 
+#print CategoryTheory.isSeparator_def /-
 theorem isSeparator_def (G : C) :
     IsSeparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   ⟨fun hG X Y f g hfg =>
@@ -473,12 +598,16 @@ theorem isSeparator_def (G : C) :
       exact hfg h,
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
+-/
 
+#print CategoryTheory.IsSeparator.def /-
 theorem IsSeparator.def {G : C} :
     IsSeparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   (isSeparator_def _).1
 #align category_theory.is_separator.def CategoryTheory.IsSeparator.def
+-/
 
+#print CategoryTheory.isCoseparator_def /-
 theorem isCoseparator_def (G : C) :
     IsCoseparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   ⟨fun hG X Y f g hfg =>
@@ -487,12 +616,16 @@ theorem isCoseparator_def (G : C) :
       exact hfg h,
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
+-/
 
+#print CategoryTheory.IsCoseparator.def /-
 theorem IsCoseparator.def {G : C} :
     IsCoseparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   (isCoseparator_def _).1
 #align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def
+-/
 
+#print CategoryTheory.isDetector_def /-
 theorem isDetector_def (G : C) :
     IsDetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   ⟨fun hG X Y f hf =>
@@ -501,12 +634,16 @@ theorem isDetector_def (G : C) :
       exact hf h,
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
+-/
 
+#print CategoryTheory.IsDetector.def /-
 theorem IsDetector.def {G : C} :
     IsDetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   (isDetector_def _).1
 #align category_theory.is_detector.def CategoryTheory.IsDetector.def
+-/
 
+#print CategoryTheory.isCodetector_def /-
 theorem isCodetector_def (G : C) :
     IsCodetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   ⟨fun hG X Y f hf =>
@@ -515,24 +652,40 @@ theorem isCodetector_def (G : C) :
       exact hf h,
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
+-/
 
+#print CategoryTheory.IsCodetector.def /-
 theorem IsCodetector.def {G : C} :
     IsCodetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   (isCodetector_def _).1
 #align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
+-/
 
+/- warning: category_theory.is_separator_iff_faithful_coyoneda_obj -> CategoryTheory.isSeparator_iff_faithful_coyoneda_obj is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsSeparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1) (Opposite.op.{succ u2} C G)))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsSeparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u2) (succ u1), u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.toCategoryStruct.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1))) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1)) (Opposite.op.{succ u2} C G)))
+Case conversion may be inaccurate. Consider using '#align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_objₓ'. -/
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
     IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
   ⟨fun hG => ⟨fun X Y f g hfg => hG.def _ _ (congr_fun hfg)⟩, fun h =>
     (isSeparator_def _).2 fun X Y f g hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 
+/- warning: category_theory.is_coseparator_iff_faithful_yoneda_obj -> CategoryTheory.isCoseparator_iff_faithful_yoneda_obj is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCoseparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1) G))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCoseparator.{u1, u2} C _inst_1 G) (CategoryTheory.Faithful.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u1) (succ u2), u2, max (succ u1) u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1)) G))
+Case conversion may be inaccurate. Consider using '#align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_objₓ'. -/
 theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
   ⟨fun hG => ⟨fun X Y f g hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun h =>
     (isCoseparator_def _).2 fun X Y f g hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
 #align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_obj
 
+#print CategoryTheory.isSeparator_iff_epi /-
 theorem isSeparator_iff_epi (G : C) [∀ A : C, HasCoproduct fun f : G ⟶ A => G] :
     IsSeparator G ↔ ∀ A : C, Epi (Sigma.desc fun f : G ⟶ A => f) :=
   by
@@ -543,7 +696,9 @@ theorem isSeparator_iff_epi (G : C) [∀ A : C, HasCoproduct fun f : G ⟶ A =>
     refine' (cancel_epi (sigma.desc fun f : G ⟶ X => f)).1 (colimit.hom_ext fun j => _)
     simpa using hh j.as
 #align category_theory.is_separator_iff_epi CategoryTheory.isSeparator_iff_epi
+-/
 
+#print CategoryTheory.isCoseparator_iff_mono /-
 theorem isCoseparator_iff_mono (G : C) [∀ A : C, HasProduct fun f : A ⟶ G => G] :
     IsCoseparator G ↔ ∀ A : C, Mono (Pi.lift fun f : A ⟶ G => f) :=
   by
@@ -554,11 +709,13 @@ theorem isCoseparator_iff_mono (G : C) [∀ A : C, HasProduct fun f : A ⟶ G =>
     refine' (cancel_mono (pi.lift fun f : Y ⟶ G => f)).1 (limit.hom_ext fun j => _)
     simpa using hh j.as
 #align category_theory.is_coseparator_iff_mono CategoryTheory.isCoseparator_iff_mono
+-/
 
 section ZeroMorphisms
 
 variable [HasZeroMorphisms C]
 
+#print CategoryTheory.isSeparator_coprod /-
 theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
     IsSeparator (G ⨿ H) ↔ IsSeparating ({G, H} : Set C) :=
   by
@@ -573,17 +730,23 @@ theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
     · simpa using coprod.inl ≫= huv (coprod.desc g 0)
     · simpa using coprod.inr ≫= huv (coprod.desc 0 g)
 #align category_theory.is_separator_coprod CategoryTheory.isSeparator_coprod
+-/
 
+#print CategoryTheory.isSeparator_coprod_of_isSeparator_left /-
 theorem isSeparator_coprod_of_isSeparator_left (G H : C) [HasBinaryCoproduct G H]
     (hG : IsSeparator G) : IsSeparator (G ⨿ H) :=
   (isSeparator_coprod _ _).2 <| IsSeparating.mono hG <| by simp
 #align category_theory.is_separator_coprod_of_is_separator_left CategoryTheory.isSeparator_coprod_of_isSeparator_left
+-/
 
+#print CategoryTheory.isSeparator_coprod_of_isSeparator_right /-
 theorem isSeparator_coprod_of_isSeparator_right (G H : C) [HasBinaryCoproduct G H]
     (hH : IsSeparator H) : IsSeparator (G ⨿ H) :=
   (isSeparator_coprod _ _).2 <| IsSeparating.mono hH <| by simp
 #align category_theory.is_separator_coprod_of_is_separator_right CategoryTheory.isSeparator_coprod_of_isSeparator_right
+-/
 
+#print CategoryTheory.isSeparator_sigma /-
 theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
     IsSeparator (∐ f) ↔ IsSeparating (Set.range f) :=
   by
@@ -595,12 +758,16 @@ theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using sigma.ι f b ≫= huv (sigma.desc (Pi.single b g))
 #align category_theory.is_separator_sigma CategoryTheory.isSeparator_sigma
+-/
 
+#print CategoryTheory.isSeparator_sigma_of_isSeparator /-
 theorem isSeparator_sigma_of_isSeparator {β : Type w} (f : β → C) [HasCoproduct f] (b : β)
     (hb : IsSeparator (f b)) : IsSeparator (∐ f) :=
   (isSeparator_sigma _).2 <| IsSeparating.mono hb <| by simp
 #align category_theory.is_separator_sigma_of_is_separator CategoryTheory.isSeparator_sigma_of_isSeparator
+-/
 
+#print CategoryTheory.isCoseparator_prod /-
 theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
     IsCoseparator (G ⨯ H) ↔ IsCoseparating ({G, H} : Set C) :=
   by
@@ -615,17 +782,23 @@ theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
     · simpa using huv (prod.lift g 0) =≫ limits.prod.fst
     · simpa using huv (prod.lift 0 g) =≫ limits.prod.snd
 #align category_theory.is_coseparator_prod CategoryTheory.isCoseparator_prod
+-/
 
+#print CategoryTheory.isCoseparator_prod_of_isCoseparator_left /-
 theorem isCoseparator_prod_of_isCoseparator_left (G H : C) [HasBinaryProduct G H]
     (hG : IsCoseparator G) : IsCoseparator (G ⨯ H) :=
   (isCoseparator_prod _ _).2 <| IsCoseparating.mono hG <| by simp
 #align category_theory.is_coseparator_prod_of_is_coseparator_left CategoryTheory.isCoseparator_prod_of_isCoseparator_left
+-/
 
+#print CategoryTheory.isCoseparator_prod_of_isCoseparator_right /-
 theorem isCoseparator_prod_of_isCoseparator_right (G H : C) [HasBinaryProduct G H]
     (hH : IsCoseparator H) : IsCoseparator (G ⨯ H) :=
   (isCoseparator_prod _ _).2 <| IsCoseparating.mono hH <| by simp
 #align category_theory.is_coseparator_prod_of_is_coseparator_right CategoryTheory.isCoseparator_prod_of_isCoseparator_right
+-/
 
+#print CategoryTheory.isCoseparator_pi /-
 theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
     IsCoseparator (∏ f) ↔ IsCoseparating (Set.range f) :=
   by
@@ -637,14 +810,23 @@ theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using huv (pi.lift (Pi.single b g)) =≫ pi.π f b
 #align category_theory.is_coseparator_pi CategoryTheory.isCoseparator_pi
+-/
 
+#print CategoryTheory.isCoseparator_pi_of_isCoseparator /-
 theorem isCoseparator_pi_of_isCoseparator {β : Type w} (f : β → C) [HasProduct f] (b : β)
     (hb : IsCoseparator (f b)) : IsCoseparator (∏ f) :=
   (isCoseparator_pi _).2 <| IsCoseparating.mono hb <| by simp
 #align category_theory.is_coseparator_pi_of_is_coseparator CategoryTheory.isCoseparator_pi_of_isCoseparator
+-/
 
 end ZeroMorphisms
 
+/- warning: category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj -> CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsDetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1) (Opposite.op.{succ u2} C G)))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsDetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u2) (succ u1), u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.toCategoryStruct.{u1, u2} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1))) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) (CategoryTheory.Functor.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} C _inst_1 Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.coyoneda.{u1, u2} C _inst_1)) (Opposite.op.{succ u2} C G)))
+Case conversion may be inaccurate. Consider using '#align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_objₓ'. -/
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) :=
   by
@@ -658,6 +840,12 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique]
 #align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj
 
+/- warning: category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj -> CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj is a dubious translation:
+lean 3 declaration is
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCodetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (CategoryTheory.Functor.obj.{u1, max u2 u1, u2, max u1 u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1) G))
+but is expected to have type
+  forall {C : Type.{u2}} [_inst_1 : CategoryTheory.Category.{u1, u2} C] (G : C), Iff (CategoryTheory.IsCodetector.{u1, u2} C _inst_1 G) (CategoryTheory.ReflectsIsomorphisms.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1} (Prefunctor.obj.{succ u1, max (succ u1) (succ u2), u2, max (succ u1) u2} C (CategoryTheory.CategoryStruct.toQuiver.{u1, u2} C (CategoryTheory.Category.toCategoryStruct.{u1, u2} C _inst_1)) (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Category.toCategoryStruct.{max u2 u1, max u2 (succ u1)} (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}))) (CategoryTheory.Functor.toPrefunctor.{u1, max u2 u1, u2, max u2 (succ u1)} C _inst_1 (CategoryTheory.Functor.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.Functor.category.{u1, u1, u2, succ u1} (Opposite.{succ u2} C) (CategoryTheory.Category.opposite.{u1, u2} C _inst_1) Type.{u1} CategoryTheory.types.{u1}) (CategoryTheory.yoneda.{u1, u2} C _inst_1)) G))
+Case conversion may be inaccurate. Consider using '#align category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_objₓ'. -/
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) :=
   by
@@ -670,9 +858,11 @@ theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     rwa [is_iso_iff_bijective, Function.bijective_iff_existsUnique]
 #align category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj
 
+#print CategoryTheory.wellPowered_of_isDetector /-
 theorem wellPowered_of_isDetector [HasPullbacks C] (G : C) (hG : IsDetector G) : WellPowered C :=
   wellPowered_of_isDetecting hG
 #align category_theory.well_powered_of_is_detector CategoryTheory.wellPowered_of_isDetector
+-/
 
 end CategoryTheory

f187f107

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

f187f107

chore: split Subsingleton,Nontrivial off of Data.Set.Basic (#11832)

Moves definition of and lemmas related to Set.Subsingleton and Set.Nontrivial to a new file, so that Basic can be shorter.

493a947e

Diff

@@ -10,7 +10,7 @@ import Mathlib.CategoryTheory.Limits.Shapes.ZeroMorphisms
 import Mathlib.CategoryTheory.Subobject.Lattice
 import Mathlib.CategoryTheory.Subobject.WellPowered
 import Mathlib.Data.Set.Opposite
-import Mathlib.Data.Set.Basic
+import Mathlib.Data.Set.Subsingleton
 
 #align_import category_theory.generator from "leanprover-community/mathlib"@"f187f1074fa1857c94589cc653c786cadc4c35ff"

f187f107

chore(CategoryTheory): move Full, Faithful, EssSurj, IsEquivalence and ReflectsIsomorphisms to the Functor namespace (#11985)

These notions on functors are now Functor.Full, Functor.Faithful, Functor.EssSurj, Functor.IsEquivalence, Functor.ReflectsIsomorphisms. Deprecated aliases are introduced for the previous names.

65b7affc

Diff

@@ -508,12 +508,12 @@ theorem IsCodetector.def {G : C} :
 #align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
 
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
-    IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
+    IsSeparator G ↔ (coyoneda.obj (op G)).Faithful :=
   ⟨fun hG => ⟨fun hfg => hG.def _ _ (congr_fun hfg)⟩, fun _ =>
     (isSeparator_def _).2 fun _ _ _ _ hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 
-theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
+theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ (yoneda.obj G).Faithful :=
   ⟨fun hG => ⟨fun hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun _ =>
     (isCoseparator_def _).2 fun _ _ _ _ hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
@@ -626,7 +626,7 @@ theorem isCoseparator_pi_of_isCoseparator {β : Type w} (f : β → C) [HasProdu
 end ZeroMorphisms
 
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
-    IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) := by
+    IsDetector G ↔ (coyoneda.obj (op G)).ReflectsIsomorphisms := by
   refine'
     ⟨fun hG => ⟨fun f hf => hG.def _ fun h => _⟩, fun h =>
       (isDetector_def _).2 fun X Y f hf => _⟩
@@ -638,7 +638,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
 #align category_theory.is_detector_iff_reflects_isomorphisms_coyoneda_obj CategoryTheory.isDetector_iff_reflectsIsomorphisms_coyoneda_obj
 
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
-    IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) := by
+    IsCodetector G ↔ (yoneda.obj G).ReflectsIsomorphisms := by
   refine' ⟨fun hG => ⟨fun f hf => _⟩, fun h => (isCodetector_def _).2 fun X Y f hf => _⟩
   · refine' (isIso_unop_iff _).1 (hG.def _ _)
     rwa [isIso_iff_bijective, Function.bijective_iff_existsUnique] at hf

f187f107

chore: rename IsRoot.definition back to IsRoot.def (#11999)

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

1f25ef62

Diff

@@ -460,12 +460,10 @@ theorem isSeparator_def (G : C) :
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
 
--- Adaptation note: 2024-03-15
--- Renamed to avoid the reserved name `IsSeparator.def`.
-theorem IsSeparator.def' {G : C} :
+theorem IsSeparator.def {G : C} :
     IsSeparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   (isSeparator_def _).1
-#align category_theory.is_separator.def CategoryTheory.IsSeparator.def'
+#align category_theory.is_separator.def CategoryTheory.IsSeparator.def
 
 theorem isCoseparator_def (G : C) :
     IsCoseparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
@@ -476,12 +474,10 @@ theorem isCoseparator_def (G : C) :
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
 
--- Adaptation note: 2024-03-15
--- Renamed to avoid the reserved name `IsCoseparator.def`.
-theorem IsCoseparator.def' {G : C} :
+theorem IsCoseparator.def {G : C} :
     IsCoseparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   (isCoseparator_def _).1
-#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def'
+#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def
 
 theorem isDetector_def (G : C) :
     IsDetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
@@ -492,12 +488,10 @@ theorem isDetector_def (G : C) :
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
 
--- Adaptation note: 2024-03-15
--- Renamed to avoid the reserved name `IsDetector.def`.
-theorem IsDetector.def' {G : C} :
+theorem IsDetector.def {G : C} :
     IsDetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   (isDetector_def _).1
-#align category_theory.is_detector.def CategoryTheory.IsDetector.def'
+#align category_theory.is_detector.def CategoryTheory.IsDetector.def
 
 theorem isCodetector_def (G : C) :
     IsCodetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
@@ -508,21 +502,19 @@ theorem isCodetector_def (G : C) :
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
 
--- Adaptation note: 2024-03-15
--- Renamed to avoid the reserved name `IsCodetector.def`.
-theorem IsCodetector.def' {G : C} :
+theorem IsCodetector.def {G : C} :
     IsCodetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   (isCodetector_def _).1
-#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def'
+#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
 
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
     IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
-  ⟨fun hG => ⟨fun hfg => hG.def' _ _ (congr_fun hfg)⟩, fun _ =>
+  ⟨fun hG => ⟨fun hfg => hG.def _ _ (congr_fun hfg)⟩, fun _ =>
     (isSeparator_def _).2 fun _ _ _ _ hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 
 theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
-  ⟨fun hG => ⟨fun hfg => Quiver.Hom.unop_inj (hG.def' _ _ (congr_fun hfg))⟩, fun _ =>
+  ⟨fun hG => ⟨fun hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun _ =>
     (isCoseparator_def _).2 fun _ _ _ _ hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
 #align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_obj
@@ -556,7 +548,7 @@ theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isSeparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def' _ _ fun g => coprod.hom_ext _ _
+  · refine' h.def _ _ fun g => coprod.hom_ext _ _
     · simpa using huv G (by simp) (coprod.inl ≫ g)
     · simpa using huv H (by simp) (coprod.inr ≫ g)
   · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
@@ -580,7 +572,7 @@ theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isSeparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def' _ _ fun g => colimit.hom_ext fun b => _
+  · refine' h.def _ _ fun g => colimit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (colimit.ι (Discrete.functor f) _ ≫ g)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using Sigma.ι f b ≫= huv (Sigma.desc (Pi.single b g))
@@ -596,7 +588,7 @@ theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isCoseparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def' _ _ fun g => prod.hom_ext _ _
+  · refine' h.def _ _ fun g => prod.hom_ext _ _
     · simpa using huv G (by simp) (g ≫ Limits.prod.fst)
     · simpa using huv H (by simp) (g ≫ Limits.prod.snd)
   · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
@@ -620,7 +612,7 @@ theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isCoseparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def' _ _ fun g => limit.hom_ext fun b => _
+  · refine' h.def _ _ fun g => limit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (g ≫ limit.π (Discrete.functor f) _)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using huv (Pi.lift (Pi.single b g)) =≫ Pi.π f b
@@ -636,7 +628,7 @@ end ZeroMorphisms
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) := by
   refine'
-    ⟨fun hG => ⟨fun f hf => hG.def' _ fun h => _⟩, fun h =>
+    ⟨fun hG => ⟨fun f hf => hG.def _ fun h => _⟩, fun h =>
       (isDetector_def _).2 fun X Y f hf => _⟩
   · rw [isIso_iff_bijective, Function.bijective_iff_existsUnique] at hf
     exact hf h
@@ -648,7 +640,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) := by
   refine' ⟨fun hG => ⟨fun f hf => _⟩, fun h => (isCodetector_def _).2 fun X Y f hf => _⟩
-  · refine' (isIso_unop_iff _).1 (hG.def' _ _)
+  · refine' (isIso_unop_iff _).1 (hG.def _ _)
     rwa [isIso_iff_bijective, Function.bijective_iff_existsUnique] at hf
   · rw [← isIso_op_iff]
     suffices IsIso ((yoneda.obj G).map f.op) by

f187f107

chore: rename away from 'def' (#11548)

This will become an error in 2024-03-16 nightly, possibly not permanently.

Co-authored-by: Scott Morrison <scott@tqft.net>

b505e8e9

Diff

@@ -460,10 +460,12 @@ theorem isSeparator_def (G : C) :
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_separator_def CategoryTheory.isSeparator_def
 
-theorem IsSeparator.def {G : C} :
+-- Adaptation note: 2024-03-15
+-- Renamed to avoid the reserved name `IsSeparator.def`.
+theorem IsSeparator.def' {G : C} :
     IsSeparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : G ⟶ X, h ≫ f = h ≫ g) → f = g :=
   (isSeparator_def _).1
-#align category_theory.is_separator.def CategoryTheory.IsSeparator.def
+#align category_theory.is_separator.def CategoryTheory.IsSeparator.def'
 
 theorem isCoseparator_def (G : C) :
     IsCoseparator G ↔ ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
@@ -474,10 +476,12 @@ theorem isCoseparator_def (G : C) :
     fun hG X Y f g hfg => hG _ _ fun h => hfg _ (Set.mem_singleton _) _⟩
 #align category_theory.is_coseparator_def CategoryTheory.isCoseparator_def
 
-theorem IsCoseparator.def {G : C} :
+-- Adaptation note: 2024-03-15
+-- Renamed to avoid the reserved name `IsCoseparator.def`.
+theorem IsCoseparator.def' {G : C} :
     IsCoseparator G → ∀ ⦃X Y : C⦄ (f g : X ⟶ Y), (∀ h : Y ⟶ G, f ≫ h = g ≫ h) → f = g :=
   (isCoseparator_def _).1
-#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def
+#align category_theory.is_coseparator.def CategoryTheory.IsCoseparator.def'
 
 theorem isDetector_def (G : C) :
     IsDetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
@@ -488,10 +492,12 @@ theorem isDetector_def (G : C) :
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_detector_def CategoryTheory.isDetector_def
 
-theorem IsDetector.def {G : C} :
+-- Adaptation note: 2024-03-15
+-- Renamed to avoid the reserved name `IsDetector.def`.
+theorem IsDetector.def' {G : C} :
     IsDetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : G ⟶ Y, ∃! h', h' ≫ f = h) → IsIso f :=
   (isDetector_def _).1
-#align category_theory.is_detector.def CategoryTheory.IsDetector.def
+#align category_theory.is_detector.def CategoryTheory.IsDetector.def'
 
 theorem isCodetector_def (G : C) :
     IsCodetector G ↔ ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
@@ -502,19 +508,21 @@ theorem isCodetector_def (G : C) :
     fun hG X Y f hf => hG _ fun h => hf _ (Set.mem_singleton _) _⟩
 #align category_theory.is_codetector_def CategoryTheory.isCodetector_def
 
-theorem IsCodetector.def {G : C} :
+-- Adaptation note: 2024-03-15
+-- Renamed to avoid the reserved name `IsCodetector.def`.
+theorem IsCodetector.def' {G : C} :
     IsCodetector G → ∀ ⦃X Y : C⦄ (f : X ⟶ Y), (∀ h : X ⟶ G, ∃! h', f ≫ h' = h) → IsIso f :=
   (isCodetector_def _).1
-#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def
+#align category_theory.is_codetector.def CategoryTheory.IsCodetector.def'
 
 theorem isSeparator_iff_faithful_coyoneda_obj (G : C) :
     IsSeparator G ↔ Faithful (coyoneda.obj (op G)) :=
-  ⟨fun hG => ⟨fun hfg => hG.def _ _ (congr_fun hfg)⟩, fun _ =>
+  ⟨fun hG => ⟨fun hfg => hG.def' _ _ (congr_fun hfg)⟩, fun _ =>
     (isSeparator_def _).2 fun _ _ _ _ hfg => (coyoneda.obj (op G)).map_injective (funext hfg)⟩
 #align category_theory.is_separator_iff_faithful_coyoneda_obj CategoryTheory.isSeparator_iff_faithful_coyoneda_obj
 
 theorem isCoseparator_iff_faithful_yoneda_obj (G : C) : IsCoseparator G ↔ Faithful (yoneda.obj G) :=
-  ⟨fun hG => ⟨fun hfg => Quiver.Hom.unop_inj (hG.def _ _ (congr_fun hfg))⟩, fun _ =>
+  ⟨fun hG => ⟨fun hfg => Quiver.Hom.unop_inj (hG.def' _ _ (congr_fun hfg))⟩, fun _ =>
     (isCoseparator_def _).2 fun _ _ _ _ hfg =>
       Quiver.Hom.op_inj <| (yoneda.obj G).map_injective (funext hfg)⟩
 #align category_theory.is_coseparator_iff_faithful_yoneda_obj CategoryTheory.isCoseparator_iff_faithful_yoneda_obj
@@ -548,7 +556,7 @@ theorem isSeparator_coprod (G H : C) [HasBinaryCoproduct G H] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isSeparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def _ _ fun g => coprod.hom_ext _ _
+  · refine' h.def' _ _ fun g => coprod.hom_ext _ _
     · simpa using huv G (by simp) (coprod.inl ≫ g)
     · simpa using huv H (by simp) (coprod.inr ≫ g)
   · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
@@ -572,7 +580,7 @@ theorem isSeparator_sigma {β : Type w} (f : β → C) [HasCoproduct f] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isSeparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def _ _ fun g => colimit.hom_ext fun b => _
+  · refine' h.def' _ _ fun g => colimit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (colimit.ι (Discrete.functor f) _ ≫ g)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using Sigma.ι f b ≫= huv (Sigma.desc (Pi.single b g))
@@ -588,7 +596,7 @@ theorem isCoseparator_prod (G H : C) [HasBinaryProduct G H] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isCoseparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def _ _ fun g => prod.hom_ext _ _
+  · refine' h.def' _ _ fun g => prod.hom_ext _ _
     · simpa using huv G (by simp) (g ≫ Limits.prod.fst)
     · simpa using huv H (by simp) (g ≫ Limits.prod.snd)
   · simp only [Set.mem_insert_iff, Set.mem_singleton_iff] at hZ
@@ -612,7 +620,7 @@ theorem isCoseparator_pi {β : Type w} (f : β → C) [HasProduct f] :
   refine'
     ⟨fun h X Y u v huv => _, fun h =>
       (isCoseparator_def _).2 fun X Y u v huv => h _ _ fun Z hZ g => _⟩
-  · refine' h.def _ _ fun g => limit.hom_ext fun b => _
+  · refine' h.def' _ _ fun g => limit.hom_ext fun b => _
     simpa using huv (f b.as) (by simp) (g ≫ limit.π (Discrete.functor f) _)
   · obtain ⟨b, rfl⟩ := Set.mem_range.1 hZ
     classical simpa using huv (Pi.lift (Pi.single b g)) =≫ Pi.π f b
@@ -628,7 +636,7 @@ end ZeroMorphisms
 theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
     IsDetector G ↔ ReflectsIsomorphisms (coyoneda.obj (op G)) := by
   refine'
-    ⟨fun hG => ⟨fun f hf => hG.def _ fun h => _⟩, fun h =>
+    ⟨fun hG => ⟨fun f hf => hG.def' _ fun h => _⟩, fun h =>
       (isDetector_def _).2 fun X Y f hf => _⟩
   · rw [isIso_iff_bijective, Function.bijective_iff_existsUnique] at hf
     exact hf h
@@ -640,7 +648,7 @@ theorem isDetector_iff_reflectsIsomorphisms_coyoneda_obj (G : C) :
 theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
     IsCodetector G ↔ ReflectsIsomorphisms (yoneda.obj G) := by
   refine' ⟨fun hG => ⟨fun f hf => _⟩, fun h => (isCodetector_def _).2 fun X Y f hf => _⟩
-  · refine' (isIso_unop_iff _).1 (hG.def _ _)
+  · refine' (isIso_unop_iff _).1 (hG.def' _ _)
     rwa [isIso_iff_bijective, Function.bijective_iff_existsUnique] at hf
   · rw [← isIso_op_iff]
     suffices IsIso ((yoneda.obj G).map f.op) by

f187f107

chore(Order): Make more arguments explicit (#11033)

Those lemmas have historically been very annoying to use in rw since all their arguments were implicit. One too many people complained about it on Zulip, so I'm changing them.

Downstream code broken by this change can fix it by adding appropriately many _s.

Also marks CauSeq.ext @[ext].

`Order.BoundedOrder`

top_sup_eq
sup_top_eq
bot_sup_eq
sup_bot_eq
top_inf_eq
inf_top_eq
bot_inf_eq
inf_bot_eq

`Order.Lattice`

sup_idem
sup_comm
sup_assoc
sup_left_idem
sup_right_idem
inf_idem
inf_comm
inf_assoc
inf_left_idem
inf_right_idem
sup_inf_left
sup_inf_right
inf_sup_left
inf_sup_right

`Order.MinMax`

max_min_distrib_left
max_min_distrib_right
min_max_distrib_left
min_max_distrib_right

Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

0eaff363

Diff

@@ -338,7 +338,7 @@ theorem eq_of_isDetecting [HasPullbacks C] {𝒢 : Set C} (h𝒢 : IsDetecting 
     (P Q : Subobject X) (h : ∀ G ∈ 𝒢, ∀ {f : G ⟶ X}, P.Factors f ↔ Q.Factors f) : P = Q :=
   calc
     P = P ⊓ Q := Eq.symm <| inf_eq_of_isDetecting h𝒢 _ _ fun G hG _ hf => (h G hG).1 hf
-    _ = Q ⊓ P := inf_comm
+    _ = Q ⊓ P := inf_comm ..
     _ = Q := inf_eq_of_isDetecting h𝒢 _ _ fun G hG _ hf => (h G hG).2 hf
 
 #align category_theory.subobject.eq_of_is_detecting CategoryTheory.Subobject.eq_of_isDetecting

f187f107

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

@@ -649,7 +649,7 @@ theorem isCodetector_iff_reflectsIsomorphisms_yoneda_obj (G : C) :
 #align category_theory.is_codetector_iff_reflects_isomorphisms_yoneda_obj CategoryTheory.isCodetector_iff_reflectsIsomorphisms_yoneda_obj
 
 theorem wellPowered_of_isDetector [HasPullbacks C] (G : C) (hG : IsDetector G) : WellPowered C :=
-  -- porting note: added the following `haveI` to prevent universe issues
+  -- Porting note: added the following `haveI` to prevent universe issues
   haveI := small_subsingleton ({G} : Set C)
   wellPowered_of_isDetecting hG
 #align category_theory.well_powered_of_is_detector CategoryTheory.wellPowered_of_isDetector

f187f107

chore(*): shake imports (#10199)

Remove Data.Set.Basic from scripts/noshake.json.
Remove an exception that was used by examples only, move these examples to a new test file.
Drop an exception for Order.Filter.Basic dependency on Control.Traversable.Instances, as the relevant parts were moved to Order.Filter.ListTraverse.
Run lake exe shake --fix.

c167d468

Diff

@@ -10,6 +10,7 @@ import Mathlib.CategoryTheory.Limits.Shapes.ZeroMorphisms
 import Mathlib.CategoryTheory.Subobject.Lattice
 import Mathlib.CategoryTheory.Subobject.WellPowered
 import Mathlib.Data.Set.Opposite
+import Mathlib.Data.Set.Basic
 
 #align_import category_theory.generator from "leanprover-community/mathlib"@"f187f1074fa1857c94589cc653c786cadc4c35ff"

f187f107

chore: cleanup some spaces (#7484)

Purely cosmetic PR.

c93575a3

Diff

@@ -291,7 +291,7 @@ theorem hasInitial_of_isCoseparating [WellPowered C] [HasLimits C] {𝒢 : Set C
     let t := Pi.lift (@Sigma.snd 𝒢 fun G => A ⟶ (G : C))
     haveI : Mono t := (isCoseparating_iff_mono 𝒢).1 h𝒢 A
     exact Subobject.ofLEMk _ (pullback.fst : pullback s t ⟶ _) bot_le ≫ pullback.snd
-  · suffices ∀ (g : Subobject.underlying.obj ⊥ ⟶ A ), f = g by
+  · suffices ∀ (g : Subobject.underlying.obj ⊥ ⟶ A), f = g by
       apply this
     intro g
     suffices IsSplitEpi (equalizer.ι f g) by exact eq_of_epi_equalizer

f187f107

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,11 +2,6 @@
 Copyright (c) 2022 Markus Himmel. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Markus Himmel
-
-! This file was ported from Lean 3 source module category_theory.generator
-! leanprover-community/mathlib commit f187f1074fa1857c94589cc653c786cadc4c35ff
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.CategoryTheory.Balanced
 import Mathlib.CategoryTheory.Limits.EssentiallySmall
@@ -16,6 +11,8 @@ import Mathlib.CategoryTheory.Subobject.Lattice
 import Mathlib.CategoryTheory.Subobject.WellPowered
 import Mathlib.Data.Set.Opposite
 
+#align_import category_theory.generator from "leanprover-community/mathlib"@"f187f1074fa1857c94589cc653c786cadc4c35ff"
+
 /-!
 # Separating and detecting sets

f187f107

chore: bye-bye, solo bys! (#3825)

This PR puts, with one exception, every single remaining by that lies all by itself on its own line to the previous line, thus matching the current behaviour of start-port.sh. The exception is when the by begins the second or later argument to a tuple or anonymous constructor; see https://github.com/leanprover-community/mathlib4/pull/3825#discussion_r1186702599.

Essentially this is s/\n *by$/ by/g, but with manual editing to satisfy the linter's max-100-char-line requirement. The Python style linter is also modified to catch these "isolated bys".

14167e48

Diff

@@ -165,8 +165,8 @@ theorem IsCodetecting.isCoseparating [HasCoequalizers C] {𝒢 : Set C} :
 
 end
 
-theorem IsSeparating.isDetecting [Balanced C] {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) : IsDetecting 𝒢 :=
-  by
+theorem IsSeparating.isDetecting [Balanced C] {𝒢 : Set C} (h𝒢 : IsSeparating 𝒢) :
+    IsDetecting 𝒢 := by
   intro X Y f hf
   refine'
     (isIso_iff_mono_and_epi _).2 ⟨⟨fun g h hgh => h𝒢 _ _ fun G hG i => _⟩, ⟨fun g h hgh => _⟩⟩

f187f107

feat: port CategoryTheory.Generator (#3623)

62dc4a1d

`category_theory.generator` ⟷ `Mathlib.CategoryTheory.Generator`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

`Order.BoundedOrder`

`Order.Lattice`

`Order.MinMax`

Dependencies 3 + 305

category_theory.generator ⟷ Mathlib.CategoryTheory.Generator

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Order.BoundedOrder

Order.Lattice

Order.MinMax

Dependencies 3 + 305

`category_theory.generator` ⟷ `Mathlib.CategoryTheory.Generator`

`Order.BoundedOrder`

`Order.Lattice`

`Order.MinMax`