category_theory.linear.yoneda ⟷ Mathlib.CategoryTheory.Linear.Yoneda

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

@@ -148,7 +148,7 @@ instance full_linearYoneda : CategoryTheory.Functor.Full (linearYoneda R C) :=
   let yoneda_full :
     CategoryTheory.Functor.Full
       (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
-    Yoneda.yonedaFull
+    Yoneda.yoneda_full
   full.of_comp_faithful (linear_yoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_yoneda_full CategoryTheory.full_linearYoneda
@@ -159,7 +159,7 @@ instance full_linearCoyoneda : CategoryTheory.Functor.Full (linearCoyoneda R C)
   let coyoneda_full :
     CategoryTheory.Functor.Full
       (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
-    Coyoneda.coyonedaFull
+    Coyoneda.coyoneda_full
   full.of_comp_faithful (linear_coyoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_coyoneda_full CategoryTheory.full_linearCoyoneda

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

@@ -144,9 +144,10 @@ theorem whiskering_linearCoyoneda₂ :
 -/
 
 #print CategoryTheory.full_linearYoneda /-
-instance full_linearYoneda : Full (linearYoneda R C) :=
+instance full_linearYoneda : CategoryTheory.Functor.Full (linearYoneda R C) :=
   let yoneda_full :
-    Full (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
+    CategoryTheory.Functor.Full
+      (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
     Yoneda.yonedaFull
   full.of_comp_faithful (linear_yoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
@@ -154,9 +155,10 @@ instance full_linearYoneda : Full (linearYoneda R C) :=
 -/
 
 #print CategoryTheory.full_linearCoyoneda /-
-instance full_linearCoyoneda : Full (linearCoyoneda R C) :=
+instance full_linearCoyoneda : CategoryTheory.Functor.Full (linearCoyoneda R C) :=
   let coyoneda_full :
-    Full (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
+    CategoryTheory.Functor.Full
+      (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
     Coyoneda.coyonedaFull
   full.of_comp_faithful (linear_coyoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
@@ -164,14 +166,14 @@ instance full_linearCoyoneda : Full (linearCoyoneda R C) :=
 -/
 
 #print CategoryTheory.faithful_linearYoneda /-
-instance faithful_linearYoneda : Faithful (linearYoneda R C) :=
-  Faithful.of_comp_eq (whiskering_linearYoneda R C)
+instance faithful_linearYoneda : CategoryTheory.Functor.Faithful (linearYoneda R C) :=
+  CategoryTheory.Functor.Faithful.of_comp_eq (whiskering_linearYoneda R C)
 #align category_theory.linear_yoneda_faithful CategoryTheory.faithful_linearYoneda
 -/
 
 #print CategoryTheory.faithful_linearCoyoneda /-
-instance faithful_linearCoyoneda : Faithful (linearCoyoneda R C) :=
-  Faithful.of_comp_eq (whiskering_linearCoyoneda R C)
+instance faithful_linearCoyoneda : CategoryTheory.Functor.Faithful (linearCoyoneda R C) :=
+  CategoryTheory.Functor.Faithful.of_comp_eq (whiskering_linearCoyoneda R C)
 #align category_theory.linear_coyoneda_faithful CategoryTheory.faithful_linearCoyoneda
 -/
 

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

@@ -3,7 +3,7 @@ Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 -/
-import Algebra.Category.Module.Basic
+import Algebra.Category.ModuleCat.Basic
 import CategoryTheory.Linear.Basic
 import CategoryTheory.Preadditive.Yoneda.Basic
 

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

@@ -3,9 +3,9 @@ Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 -/
-import Mathbin.Algebra.Category.Module.Basic
-import Mathbin.CategoryTheory.Linear.Basic
-import Mathbin.CategoryTheory.Preadditive.Yoneda.Basic
+import Algebra.Category.Module.Basic
+import CategoryTheory.Linear.Basic
+import CategoryTheory.Preadditive.Yoneda.Basic
 
 #align_import category_theory.linear.yoneda from "leanprover-community/mathlib"@"9d2f0748e6c50d7a2657c564b1ff2c695b39148d"
 

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

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.linear.yoneda
-! 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.Algebra.Category.Module.Basic
 import Mathbin.CategoryTheory.Linear.Basic
 import Mathbin.CategoryTheory.Preadditive.Yoneda.Basic
 
+#align_import category_theory.linear.yoneda from "leanprover-community/mathlib"@"9d2f0748e6c50d7a2657c564b1ff2c695b39148d"
+
 /-!
 # The Yoneda embedding for `R`-linear categories
 

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

@@ -101,31 +101,42 @@ def linearCoyoneda : Cᵒᵖ ⥤ C ⥤ ModuleCat R
 #align category_theory.linear_coyoneda CategoryTheory.linearCoyoneda
 -/
 
+#print CategoryTheory.linearYoneda_obj_additive /-
 instance linearYoneda_obj_additive (X : C) : ((linearYoneda R C).obj X).Additive where
 #align category_theory.linear_yoneda_obj_additive CategoryTheory.linearYoneda_obj_additive
+-/
 
+#print CategoryTheory.linearCoyoneda_obj_additive /-
 instance linearCoyoneda_obj_additive (Y : Cᵒᵖ) : ((linearCoyoneda R C).obj Y).Additive where
 #align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additive
+-/
 
+#print CategoryTheory.whiskering_linearYoneda /-
 @[simp]
 theorem whiskering_linearYoneda :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = yoneda :=
   rfl
 #align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYoneda
+-/
 
+#print CategoryTheory.whiskering_linearYoneda₂ /-
 @[simp]
 theorem whiskering_linearYoneda₂ :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget₂ (ModuleCat.{v} R) AddCommGroupCat.{v}) =
       preadditiveYoneda :=
   rfl
 #align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂
+-/
 
+#print CategoryTheory.whiskering_linearCoyoneda /-
 @[simp]
 theorem whiskering_linearCoyoneda :
     linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = coyoneda :=
   rfl
 #align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyoneda
+-/
 
+#print CategoryTheory.whiskering_linearCoyoneda₂ /-
 @[simp]
 theorem whiskering_linearCoyoneda₂ :
     linearCoyoneda R C ⋙
@@ -133,6 +144,7 @@ theorem whiskering_linearCoyoneda₂ :
       preadditiveCoyoneda :=
   rfl
 #align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂
+-/
 
 #print CategoryTheory.full_linearYoneda /-
 instance full_linearYoneda : Full (linearYoneda R C) :=

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

@@ -101,36 +101,18 @@ def linearCoyoneda : Cᵒᵖ ⥤ C ⥤ ModuleCat R
 #align category_theory.linear_coyoneda CategoryTheory.linearCoyoneda
 -/
 
-/- warning: category_theory.linear_yoneda_obj_additive -> CategoryTheory.linearYoneda_obj_additive is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (X : C), CategoryTheory.Functor.Additive.{u3, max u1 (succ u2), u2, u2} (Opposite.{succ u3} C) (ModuleCat.{u2, u1} R _inst_1) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (CategoryTheory.Opposite.preadditive.{u3, u2} C _inst_2 _inst_3) (ModuleCat.CategoryTheory.preadditive.{u2, u1} R _inst_1) (CategoryTheory.Functor.obj.{u2, max u3 u2, u3, max u2 u3 u1 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) X)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (X : C), CategoryTheory.Functor.Additive.{u3, max (succ u2) u1, u2, u2} (Opposite.{succ u3} C) (ModuleCat.{u2, u1} R _inst_1) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (CategoryTheory.instPreadditiveOppositeOpposite.{u3, u2} C _inst_2 _inst_3) (ModuleCat.instPreadditiveModuleCatModuleCategory.{u2, u1} R _inst_1) (Prefunctor.obj.{succ u2, max (succ u3) (succ u2), u3, max (max u3 (succ u2)) u1} C (CategoryTheory.CategoryStruct.toQuiver.{u2, u3} C (CategoryTheory.Category.toCategoryStruct.{u2, u3} C _inst_2)) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.CategoryStruct.toQuiver.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Category.toCategoryStruct.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)))) (CategoryTheory.Functor.toPrefunctor.{u2, max u3 u2, u3, max (max u3 (succ u2)) u1} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4)) X)
-Case conversion may be inaccurate. Consider using '#align category_theory.linear_yoneda_obj_additive CategoryTheory.linearYoneda_obj_additiveₓ'. -/
 instance linearYoneda_obj_additive (X : C) : ((linearYoneda R C).obj X).Additive where
 #align category_theory.linear_yoneda_obj_additive CategoryTheory.linearYoneda_obj_additive
 
-/- warning: category_theory.linear_coyoneda_obj_additive -> CategoryTheory.linearCoyoneda_obj_additive is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (Y : Opposite.{succ u3} C), CategoryTheory.Functor.Additive.{u3, max u1 (succ u2), u2, u2} C (ModuleCat.{u2, u1} R _inst_1) _inst_2 (ModuleCat.moduleCategory.{u2, u1} R _inst_1) _inst_3 (ModuleCat.CategoryTheory.preadditive.{u2, u1} R _inst_1) (CategoryTheory.Functor.obj.{u2, max u3 u2, u3, max u2 u3 u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) Y)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (Y : Opposite.{succ u3} C), CategoryTheory.Functor.Additive.{u3, max (succ u2) u1, u2, u2} C (ModuleCat.{u2, u1} R _inst_1) _inst_2 (ModuleCat.moduleCategory.{u2, u1} R _inst_1) _inst_3 (ModuleCat.instPreadditiveModuleCatModuleCategory.{u2, u1} R _inst_1) (Prefunctor.obj.{succ u2, max (succ u3) (succ u2), u3, max (max u3 (succ u2)) u1} (Opposite.{succ u3} C) (CategoryTheory.CategoryStruct.toQuiver.{u2, u3} (Opposite.{succ u3} C) (CategoryTheory.Category.toCategoryStruct.{u2, u3} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2))) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.CategoryStruct.toQuiver.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Category.toCategoryStruct.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)))) (CategoryTheory.Functor.toPrefunctor.{u2, max u3 u2, u3, max (max u3 (succ u2)) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4)) Y)
-Case conversion may be inaccurate. Consider using '#align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additiveₓ'. -/
 instance linearCoyoneda_obj_additive (Y : Cᵒᵖ) : ((linearCoyoneda R C).obj Y).Additive where
 #align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additive
 
-/- warning: category_theory.whiskering_linear_yoneda -> CategoryTheory.whiskering_linearYoneda is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYonedaₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = yoneda :=
   rfl
 #align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYoneda
 
-/- warning: category_theory.whiskering_linear_yoneda₂ -> CategoryTheory.whiskering_linearYoneda₂ is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda₂ :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget₂ (ModuleCat.{v} R) AddCommGroupCat.{v}) =
@@ -138,18 +120,12 @@ theorem whiskering_linearYoneda₂ :
   rfl
 #align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂
 
-/- warning: category_theory.whiskering_linear_coyoneda -> CategoryTheory.whiskering_linearCoyoneda is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyonedaₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda :
     linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = coyoneda :=
   rfl
 #align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyoneda
 
-/- warning: category_theory.whiskering_linear_coyoneda₂ -> CategoryTheory.whiskering_linearCoyoneda₂ is a dubious translation:
-<too large>
-Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda₂ :
     linearCoyoneda R C ⋙

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

@@ -120,10 +120,7 @@ instance linearCoyoneda_obj_additive (Y : Cᵒᵖ) : ((linearCoyoneda R C).obj Y
 #align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additive
 
 /- warning: category_theory.whiskering_linear_yoneda -> CategoryTheory.whiskering_linearYoneda is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.forget.{max u1 (succ u2), u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.yoneda.{u2, u3} C _inst_2)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.forget.{max (succ u2) u1, u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.yoneda.{u2, u3} C _inst_2)
+<too large>
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYonedaₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda :
@@ -132,10 +129,7 @@ theorem whiskering_linearYoneda :
 #align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYoneda
 
 /- warning: category_theory.whiskering_linear_yoneda₂ -> CategoryTheory.whiskering_linearYoneda₂ is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) instAddCommGroupCatLargeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
+<too large>
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda₂ :
@@ -145,10 +139,7 @@ theorem whiskering_linearYoneda₂ :
 #align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂
 
 /- warning: category_theory.whiskering_linear_coyoneda -> CategoryTheory.whiskering_linearCoyoneda is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.forget.{max u1 (succ u2), u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.coyoneda.{u2, u3} C _inst_2)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.forget.{max (succ u2) u1, u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.coyoneda.{u2, u3} C _inst_2)
+<too large>
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyonedaₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda :
@@ -157,10 +148,7 @@ theorem whiskering_linearCoyoneda :
 #align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyoneda
 
 /- warning: category_theory.whiskering_linear_coyoneda₂ -> CategoryTheory.whiskering_linearCoyoneda₂ is a dubious translation:
-lean 3 declaration is
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
-but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) instAddCommGroupCatLargeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
+<too large>
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda₂ :

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

@@ -135,7 +135,7 @@ theorem whiskering_linearYoneda :
 lean 3 declaration is
   forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
 but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) instAddCommGroupCatLargeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda₂ :
@@ -160,7 +160,7 @@ theorem whiskering_linearCoyoneda :
 lean 3 declaration is
   forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
 but is expected to have type
-  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} instAddCommGroupCatLargeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) instAddCommGroupCatLargeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
 Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂ₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda₂ :

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

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 
 ! This file was ported from Lean 3 source module category_theory.linear.yoneda
-! leanprover-community/mathlib commit 09f981f72d43749f1fa072deade828d9c1e185bb
+! leanprover-community/mathlib commit 9d2f0748e6c50d7a2657c564b1ff2c695b39148d
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.CategoryTheory.Preadditive.Yoneda.Basic
 /-!
 # The Yoneda embedding for `R`-linear categories
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 The Yoneda embedding for `R`-linear categories `C`,
 sends an object `X : C` to the `Module R`-valued presheaf on `C`,
 with value on `Y : Cᵒᵖ` given by `Module.of R (unop Y ⟶ X)`.

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

@@ -32,6 +32,7 @@ namespace CategoryTheory
 
 variable (R : Type w) [Ring R] (C : Type u) [Category.{v} C] [Preadditive C] [Linear R C]
 
+#print CategoryTheory.linearYoneda /-
 /-- The Yoneda embedding for `R`-linear categories `C`,
 sending an object `X : C` to the `Module R`-valued presheaf on `C`,
 with value on `Y : Cᵒᵖ` given by `Module.of R (unop Y ⟶ X)`. -/
@@ -62,7 +63,9 @@ def linearYoneda : C ⥤ Cᵒᵖ ⥤ ModuleCat R
           simp only [category.assoc, linear.right_comp_apply, nat_trans.comp_app,
             ModuleCat.coe_comp, Function.comp_apply]
 #align category_theory.linear_yoneda CategoryTheory.linearYoneda
+-/
 
+#print CategoryTheory.linearCoyoneda /-
 /-- The Yoneda embedding for `R`-linear categories `C`,
 sending an object `Y : Cᵒᵖ` to the `Module R`-valued copresheaf on `C`,
 with value on `X : C` given by `Module.of R (unop Y ⟶ X)`. -/
@@ -93,63 +96,108 @@ def linearCoyoneda : Cᵒᵖ ⥤ C ⥤ ModuleCat R
           simp only [category.assoc, ModuleCat.coe_comp, Function.comp_apply,
             linear.left_comp_apply, unop_comp, nat_trans.comp_app]
 #align category_theory.linear_coyoneda CategoryTheory.linearCoyoneda
+-/
 
+/- warning: category_theory.linear_yoneda_obj_additive -> CategoryTheory.linearYoneda_obj_additive is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (X : C), CategoryTheory.Functor.Additive.{u3, max u1 (succ u2), u2, u2} (Opposite.{succ u3} C) (ModuleCat.{u2, u1} R _inst_1) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (CategoryTheory.Opposite.preadditive.{u3, u2} C _inst_2 _inst_3) (ModuleCat.CategoryTheory.preadditive.{u2, u1} R _inst_1) (CategoryTheory.Functor.obj.{u2, max u3 u2, u3, max u2 u3 u1 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) X)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (X : C), CategoryTheory.Functor.Additive.{u3, max (succ u2) u1, u2, u2} (Opposite.{succ u3} C) (ModuleCat.{u2, u1} R _inst_1) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (CategoryTheory.instPreadditiveOppositeOpposite.{u3, u2} C _inst_2 _inst_3) (ModuleCat.instPreadditiveModuleCatModuleCategory.{u2, u1} R _inst_1) (Prefunctor.obj.{succ u2, max (succ u3) (succ u2), u3, max (max u3 (succ u2)) u1} C (CategoryTheory.CategoryStruct.toQuiver.{u2, u3} C (CategoryTheory.Category.toCategoryStruct.{u2, u3} C _inst_2)) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.CategoryStruct.toQuiver.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Category.toCategoryStruct.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)))) (CategoryTheory.Functor.toPrefunctor.{u2, max u3 u2, u3, max (max u3 (succ u2)) u1} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4)) X)
+Case conversion may be inaccurate. Consider using '#align category_theory.linear_yoneda_obj_additive CategoryTheory.linearYoneda_obj_additiveₓ'. -/
 instance linearYoneda_obj_additive (X : C) : ((linearYoneda R C).obj X).Additive where
 #align category_theory.linear_yoneda_obj_additive CategoryTheory.linearYoneda_obj_additive
 
+/- warning: category_theory.linear_coyoneda_obj_additive -> CategoryTheory.linearCoyoneda_obj_additive is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (Y : Opposite.{succ u3} C), CategoryTheory.Functor.Additive.{u3, max u1 (succ u2), u2, u2} C (ModuleCat.{u2, u1} R _inst_1) _inst_2 (ModuleCat.moduleCategory.{u2, u1} R _inst_1) _inst_3 (ModuleCat.CategoryTheory.preadditive.{u2, u1} R _inst_1) (CategoryTheory.Functor.obj.{u2, max u3 u2, u3, max u2 u3 u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) Y)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3] (Y : Opposite.{succ u3} C), CategoryTheory.Functor.Additive.{u3, max (succ u2) u1, u2, u2} C (ModuleCat.{u2, u1} R _inst_1) _inst_2 (ModuleCat.moduleCategory.{u2, u1} R _inst_1) _inst_3 (ModuleCat.instPreadditiveModuleCatModuleCategory.{u2, u1} R _inst_1) (Prefunctor.obj.{succ u2, max (succ u3) (succ u2), u3, max (max u3 (succ u2)) u1} (Opposite.{succ u3} C) (CategoryTheory.CategoryStruct.toQuiver.{u2, u3} (Opposite.{succ u3} C) (CategoryTheory.Category.toCategoryStruct.{u2, u3} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2))) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.CategoryStruct.toQuiver.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Category.toCategoryStruct.{max u3 u2, max (max u3 (succ u2)) u1} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)))) (CategoryTheory.Functor.toPrefunctor.{u2, max u3 u2, u3, max (max u3 (succ u2)) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4)) Y)
+Case conversion may be inaccurate. Consider using '#align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additiveₓ'. -/
 instance linearCoyoneda_obj_additive (Y : Cᵒᵖ) : ((linearCoyoneda R C).obj Y).Additive where
 #align category_theory.linear_coyoneda_obj_additive CategoryTheory.linearCoyoneda_obj_additive
 
+/- warning: category_theory.whiskering_linear_yoneda -> CategoryTheory.whiskering_linearYoneda is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.forget.{max u1 (succ u2), u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.yoneda.{u2, u3} C _inst_2)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.forget.{max (succ u2) u1, u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.yoneda.{u2, u3} C _inst_2)
+Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYonedaₓ'. -/
 @[simp]
 theorem whiskering_linearYoneda :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = yoneda :=
   rfl
 #align category_theory.whiskering_linear_yoneda CategoryTheory.whiskering_linearYoneda
 
+/- warning: category_theory.whiskering_linear_yoneda₂ -> CategoryTheory.whiskering_linearYoneda₂ is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} C _inst_2 (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearYoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveYoneda.{u2, u3} C _inst_2 _inst_3)
+Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂ₓ'. -/
 @[simp]
-theorem whiskering_linear_yoneda₂ :
+theorem whiskering_linearYoneda₂ :
     linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget₂ (ModuleCat.{v} R) AddCommGroupCat.{v}) =
       preadditiveYoneda :=
   rfl
-#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linear_yoneda₂
-
+#align category_theory.whiskering_linear_yoneda₂ CategoryTheory.whiskering_linearYoneda₂
+
+/- warning: category_theory.whiskering_linear_coyoneda -> CategoryTheory.whiskering_linearCoyoneda is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.forget.{max u1 (succ u2), u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.coyoneda.{u2, u3} C _inst_2)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) Type.{u2} CategoryTheory.types.{u2})) (CategoryTheory.forget.{max (succ u2) u1, u2, u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1)))) (CategoryTheory.coyoneda.{u2, u3} C _inst_2)
+Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyonedaₓ'. -/
 @[simp]
 theorem whiskering_linearCoyoneda :
     linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)) = coyoneda :=
   rfl
 #align category_theory.whiskering_linear_coyoneda CategoryTheory.whiskering_linearCoyoneda
 
+/- warning: category_theory.whiskering_linear_coyoneda₂ -> CategoryTheory.whiskering_linearCoyoneda₂ is a dubious translation:
+lean 3 declaration is
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{succ (max u2 (max u3 u2) u3 u2 u3 (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (CategoryTheory.Functor.obj.{max (max u1 (succ u2)) u2, max (max u2 u3 u1 (succ u2)) u3 u2, max u2 u1 (succ u2), max (max u3 u2) (max u2 u3 u1 (succ u2)) u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max u1 (succ u2), succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max u2 u3 u1 (succ u2), max u2 u3 (succ u2)} (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max u1 (succ u2), u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.forget₂.{max u1 (succ u2), succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
+but is expected to have type
+  forall (R : Type.{u1}) [_inst_1 : Ring.{u1} R] (C : Type.{u3}) [_inst_2 : CategoryTheory.Category.{u2, u3} C] [_inst_3 : CategoryTheory.Preadditive.{u2, u3} C _inst_2] [_inst_4 : CategoryTheory.Linear.{u1, u2, u3} R (Ring.toSemiring.{u1} R _inst_1) C _inst_2 _inst_3], Eq.{max (succ u3) (succ (succ u2))} (CategoryTheory.Functor.{u2, max u3 u2, u3, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.comp.{u2, max u3 u2, max u3 u2, u3, max (max u3 (succ u2)) u1, max (max u3 u2) (succ u2)} (Opposite.{succ u3} C) (CategoryTheory.Category.opposite.{u2, u3} C _inst_2) (CategoryTheory.Functor.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max u1 (succ u2)} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.linearCoyoneda.{u1, u2, u3} R _inst_1 C _inst_2 _inst_3 _inst_4) (Prefunctor.obj.{max (succ u2) (succ (max (succ u2) u1)), max (max (succ u2) (succ (max (succ u2) u1))) (succ u3), max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.CategoryStruct.toQuiver.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Category.toCategoryStruct.{max u2 (succ u2) u1, max (succ u2) u1} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}))) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.CategoryStruct.toQuiver.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Category.toCategoryStruct.{max (max u2 (succ u2) u1) u3, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})))) (CategoryTheory.Functor.toPrefunctor.{max u2 (succ u2) u1, max (max u2 (succ u2) u1) u3, max (succ u2) u1, max (max (max (succ u2) u1) u2) u3} (CategoryTheory.Functor.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, max (succ u2) u1, succ u2} (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.{max u3 u2, max u3 u2, max (max (max (succ u2) u1) u3) u2, max (max (succ u2) u3) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.Functor.category.{max u3 u2, max u3 u2, max (max u3 (succ u2) u1) u2, max (max u3 (succ u2)) u2} (CategoryTheory.Functor.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.category.{u2, u2, u3, max (succ u2) u1} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1)) (CategoryTheory.Functor.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2}) (CategoryTheory.Functor.category.{u2, u2, u3, succ u2} C _inst_2 AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.whiskeringRight.{u3, u2, max (succ u2) u1, u2, succ u2, u2} C _inst_2 (ModuleCat.{u2, u1} R _inst_1) (ModuleCat.moduleCategory.{u2, u1} R _inst_1) AddCommGroupCat.{u2} AddCommGroupCat.largeCategory.{u2})) (CategoryTheory.forget₂.{max (succ u2) u1, succ u2, u2, u2, u2} (ModuleCat.{u2, u1} R _inst_1) AddCommGroupCat.{u2} (ModuleCat.moduleCategory.{u2, u1} R _inst_1) (ModuleCat.moduleConcreteCategory.{u2, u1} R _inst_1) AddCommGroupCat.largeCategory.{u2} AddCommGroupCat.concreteCategory.{u2} (ModuleCat.hasForgetToAddCommGroup.{u1, u2} R _inst_1)))) (CategoryTheory.preadditiveCoyoneda.{u2, u3} C _inst_2 _inst_3)
+Case conversion may be inaccurate. Consider using '#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂ₓ'. -/
 @[simp]
-theorem whiskering_linear_coyoneda₂ :
+theorem whiskering_linearCoyoneda₂ :
     linearCoyoneda R C ⋙
         (whiskeringRight _ _ _).obj (forget₂ (ModuleCat.{v} R) AddCommGroupCat.{v}) =
       preadditiveCoyoneda :=
   rfl
-#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linear_coyoneda₂
+#align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂
 
-instance linearYonedaFull : Full (linearYoneda R C) :=
+#print CategoryTheory.full_linearYoneda /-
+instance full_linearYoneda : Full (linearYoneda R C) :=
   let yoneda_full :
     Full (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
     Yoneda.yonedaFull
   full.of_comp_faithful (linear_yoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
-#align category_theory.linear_yoneda_full CategoryTheory.linearYonedaFull
+#align category_theory.linear_yoneda_full CategoryTheory.full_linearYoneda
+-/
 
-instance linearCoyonedaFull : Full (linearCoyoneda R C) :=
+#print CategoryTheory.full_linearCoyoneda /-
+instance full_linearCoyoneda : Full (linearCoyoneda R C) :=
   let coyoneda_full :
     Full (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
     Coyoneda.coyonedaFull
   full.of_comp_faithful (linear_coyoneda R C)
     ((whiskering_right _ _ _).obj (forget (ModuleCat.{v} R)))
-#align category_theory.linear_coyoneda_full CategoryTheory.linearCoyonedaFull
+#align category_theory.linear_coyoneda_full CategoryTheory.full_linearCoyoneda
+-/
 
-instance linearYoneda_faithful : Faithful (linearYoneda R C) :=
+#print CategoryTheory.faithful_linearYoneda /-
+instance faithful_linearYoneda : Faithful (linearYoneda R C) :=
   Faithful.of_comp_eq (whiskering_linearYoneda R C)
-#align category_theory.linear_yoneda_faithful CategoryTheory.linearYoneda_faithful
+#align category_theory.linear_yoneda_faithful CategoryTheory.faithful_linearYoneda
+-/
 
-instance linearCoyoneda_faithful : Faithful (linearCoyoneda R C) :=
+#print CategoryTheory.faithful_linearCoyoneda /-
+instance faithful_linearCoyoneda : Faithful (linearCoyoneda R C) :=
   Faithful.of_comp_eq (whiskering_linearCoyoneda R C)
-#align category_theory.linear_coyoneda_faithful CategoryTheory.linearCoyoneda_faithful
+#align category_theory.linear_coyoneda_faithful CategoryTheory.faithful_linearCoyoneda
+-/
 
 end CategoryTheory
 

mathlib commit https://github.com/leanprover-community/mathlib/commit/21e3562c5e12d846c7def5eff8cdbc520d7d4936

@@ -4,13 +4,13 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
 
 ! This file was ported from Lean 3 source module category_theory.linear.yoneda
-! leanprover-community/mathlib commit 829895f162a1f29d0133f4b3538f4cd1fb5bffd3
+! leanprover-community/mathlib commit 09f981f72d43749f1fa072deade828d9c1e185bb
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.Category.Module.Basic
 import Mathbin.CategoryTheory.Linear.Basic
-import Mathbin.CategoryTheory.Preadditive.Yoneda
+import Mathbin.CategoryTheory.Preadditive.Yoneda.Basic
 
 /-!
 # The Yoneda embedding for `R`-linear categories

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

Before this PR, Functor.Full contained the data of the preimage of maps by a full functor F. This PR makes Functor.Full a proposition. This is to prevent any diamond to appear.

The lemma Functor.image_preimage is also renamed Functor.map_preimage.

Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>

@@ -94,17 +94,15 @@ theorem whiskering_linearCoyoneda₂ :
 
 instance full_linearYoneda : (linearYoneda R C).Full :=
   let _ :  Functor.Full (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj
-    (forget (ModuleCat.{v} R))) :=
-    Yoneda.yonedaFull
-  Functor.Full.ofCompFaithful (linearYoneda R C)
+    (forget (ModuleCat.{v} R))) := Yoneda.yoneda_full
+  Functor.Full.of_comp_faithful (linearYoneda R C)
     ((whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_yoneda_full CategoryTheory.full_linearYoneda
 
 instance full_linearCoyoneda : (linearCoyoneda R C).Full :=
   let _ : Functor.Full (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj
-    (forget (ModuleCat.{v} R))) :=
-    Coyoneda.coyonedaFull
-  Functor.Full.ofCompFaithful (linearCoyoneda R C)
+    (forget (ModuleCat.{v} R))) := Coyoneda.coyoneda_full
+  Functor.Full.of_comp_faithful (linearCoyoneda R C)
     ((whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_coyoneda_full CategoryTheory.full_linearCoyoneda
 

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

@@ -92,26 +92,28 @@ theorem whiskering_linearCoyoneda₂ :
   rfl
 #align category_theory.whiskering_linear_coyoneda₂ CategoryTheory.whiskering_linearCoyoneda₂
 
-instance full_linearYoneda : Full (linearYoneda R C) :=
-  let _ :  Full (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
+instance full_linearYoneda : (linearYoneda R C).Full :=
+  let _ :  Functor.Full (linearYoneda R C ⋙ (whiskeringRight _ _ _).obj
+    (forget (ModuleCat.{v} R))) :=
     Yoneda.yonedaFull
-  Full.ofCompFaithful (linearYoneda R C)
+  Functor.Full.ofCompFaithful (linearYoneda R C)
     ((whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_yoneda_full CategoryTheory.full_linearYoneda
 
-instance full_linearCoyoneda : Full (linearCoyoneda R C) :=
-  let _ : Full (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R))) :=
+instance full_linearCoyoneda : (linearCoyoneda R C).Full :=
+  let _ : Functor.Full (linearCoyoneda R C ⋙ (whiskeringRight _ _ _).obj
+    (forget (ModuleCat.{v} R))) :=
     Coyoneda.coyonedaFull
-  Full.ofCompFaithful (linearCoyoneda R C)
+  Functor.Full.ofCompFaithful (linearCoyoneda R C)
     ((whiskeringRight _ _ _).obj (forget (ModuleCat.{v} R)))
 #align category_theory.linear_coyoneda_full CategoryTheory.full_linearCoyoneda
 
-instance faithful_linearYoneda : Faithful (linearYoneda R C) :=
-  Faithful.of_comp_eq (whiskering_linearYoneda R C)
+instance faithful_linearYoneda : (linearYoneda R C).Faithful :=
+  Functor.Faithful.of_comp_eq (whiskering_linearYoneda R C)
 #align category_theory.linear_yoneda_faithful CategoryTheory.faithful_linearYoneda
 
-instance faithful_linearCoyoneda : Faithful (linearCoyoneda R C) :=
-  Faithful.of_comp_eq (whiskering_linearCoyoneda R C)
+instance faithful_linearCoyoneda : (linearCoyoneda R C).Faithful :=
+  Functor.Faithful.of_comp_eq (whiskering_linearCoyoneda R C)
 #align category_theory.linear_coyoneda_faithful CategoryTheory.faithful_linearCoyoneda
 
 end CategoryTheory

Empty lines were removed by executing the following Python script twice

import os
import re


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

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

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

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

@@ -28,7 +28,6 @@ open Opposite
 namespace CategoryTheory
 
 variable (R : Type w) [Ring R] {C : Type u} [Category.{v} C] [Preadditive C] [Linear R C]
-
 variable (C)
 
 -- Porting note: inserted specific `ModuleCat.ofHom` in the definition of `linearYoneda`

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".

@@ -31,7 +31,7 @@ variable (R : Type w) [Ring R] {C : Type u} [Category.{v} C] [Preadditive C] [Li
 
 variable (C)
 
--- porting note: inserted specific `ModuleCat.ofHom` in the definition of `linearYoneda`
+-- Porting note: inserted specific `ModuleCat.ofHom` in the definition of `linearYoneda`
 -- and similarly in `linearCoyoneda`, otherwise many simp lemmas are not triggered automatically.
 -- Eventually, doing so allows more proofs to be automatic!
 /-- The Yoneda embedding for `R`-linear categories `C`,

• depends on: #5966

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

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Scott Morrison
-
-! This file was ported from Lean 3 source module category_theory.linear.yoneda
-! leanprover-community/mathlib commit 09f981f72d43749f1fa072deade828d9c1e185bb
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.Category.ModuleCat.Basic
 import Mathlib.CategoryTheory.Linear.Basic
 import Mathlib.CategoryTheory.Preadditive.Yoneda.Basic
 
+#align_import category_theory.linear.yoneda from "leanprover-community/mathlib"@"09f981f72d43749f1fa072deade828d9c1e185bb"
+
 /-!
 # The Yoneda embedding for `R`-linear categories