l3lab/ntp-mathlib huggingface dataset:
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => 

Proof state:
case a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| colimit.ι
      (parallelPair (M.actRight ⊗ 𝟙 (coequalizer (N.actRight ⊗ 𝟙 P'.X) ((α_ N.X Y.X P'.X).hom ≫ (𝟙 N.X ⊗ P'.actLeft))))
        ((α_ M.X X.X (coequalizer (N.actRight ⊗ 𝟙 P'.X) ((α_ N.X Y.X P'.X).hom ≫ (𝟙 N.X ⊗ P'.actLeft)))).hom ≫
          (𝟙 M.X ⊗ TensorBimod.actLeft N P')))
      WalkingParallelPair.one ≫
    coequalizer.desc (AssociatorBimod.invAux M N P')
      (_ :
        (M.actRight ⊗ 𝟙 (tensorBimod N P').X) ≫ AssociatorBimod.invAux M N P' =
          ((α_ M.X X.X (tensorBimod N P').X).hom ≫ (𝟙 M.X ⊗ (tensorBimod N P').actLeft)) ≫
            AssociatorBimod.invAux M N P')
case a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| (α_ M.X N.X P.X).hom
case a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| 𝟙 M.X ⊗
    (𝟙 N.X ⊗ f.hom) ≫
      colimit.ι (parallelPair (N.actRight ⊗ 𝟙 P'.X) ((α_ N.X Y.X P'.X).hom ≫ (𝟙 N.X ⊗ P'.actLeft)))
        WalkingParallelPair.one

Next tactic:
rw [coequalizer.π_desc]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  

Proof state:
case h.h
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
⊢ (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P.X) ≫
      (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ f.hom) ≫
        colimit.ι
          (parallelPair (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
            ((α_ (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) Y.X P'.X).hom ≫
              (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ P'.actLeft)))
          WalkingParallelPair.one =
    (α_ M.X N.X P.X).hom ≫
      (𝟙 M.X ⊗
          (𝟙 N.X ⊗ f.hom) ≫
            colimit.ι (parallelPair (N.actRight ⊗ 𝟙 P'.X) ((α_ N.X Y.X P'.X).hom ≫ (𝟙 N.X ⊗ P'.actLeft)))
              WalkingParallelPair.one) ≫
        AssociatorBimod.invAux M N P'

Next tactic:
dsimp [AssociatorBimod.invAux]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  

Proof state:
case h.h
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
⊢ (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P.X) ≫
      (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ f.hom) ≫
        colimit.ι
          (parallelPair (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
            ((α_ (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) Y.X P'.X).hom ≫
              (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ P'.actLeft)))
          WalkingParallelPair.one =
    (α_ M.X N.X P.X).hom ≫
      (𝟙 M.X ⊗ 𝟙 N.X ⊗ f.hom) ≫
        (α_ M.X N.X P'.X).inv ≫
          (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P'.X) ≫
            coequalizer.π (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
              ((α_ (TensorBimod.X M N) Y.X P'.X).hom ≫ (𝟙 (TensorBimod.X M N) ⊗ P'.actLeft))

Next tactic:
slice_rhs 2 3 => rw [associator_inv_naturality]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  slice_rhs 2 3 => 

Proof state:
case a.a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| (𝟙 M.X ⊗ 𝟙 N.X ⊗ f.hom) ≫ (α_ M.X N.X P'.X).inv
case a.a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P'.X
case a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| coequalizer.π (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
    ((α_ (TensorBimod.X M N) Y.X P'.X).hom ≫ (𝟙 (TensorBimod.X M N) ⊗ P'.actLeft))
case a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| (α_ M.X N.X P.X).hom

Next tactic:
rw [associator_inv_naturality]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  slice_rhs 2 3 => rw [associator_inv_naturality]
  

Proof state:
case h.h
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
⊢ (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P.X) ≫
      (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ f.hom) ≫
        colimit.ι
          (parallelPair (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
            ((α_ (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) Y.X P'.X).hom ≫
              (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ P'.actLeft)))
          WalkingParallelPair.one =
    (α_ M.X N.X P.X).hom ≫
      (((α_ M.X N.X P.X).inv ≫ ((𝟙 M.X ⊗ 𝟙 N.X) ⊗ f.hom)) ≫
          (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P'.X)) ≫
        coequalizer.π (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
          ((α_ (TensorBimod.X M N) Y.X P'.X).hom ≫ (𝟙 (TensorBimod.X M N) ⊗ P'.actLeft))

Next tactic:
slice_rhs 1 3 => rw [Iso.hom_inv_id_assoc, MonoidalCategory.tensor_id]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  slice_rhs 2 3 => rw [associator_inv_naturality]
  slice_rhs 1 3 => 

Proof state:
case a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| (α_ M.X N.X P.X).hom ≫ (α_ M.X N.X P.X).inv ≫ ((𝟙 M.X ⊗ 𝟙 N.X) ⊗ f.hom)
case a.a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P'.X
case a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| coequalizer.π (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
    ((α_ (TensorBimod.X M N) Y.X P'.X).hom ≫ (𝟙 (TensorBimod.X M N) ⊗ P'.actLeft))

Next tactic:
rw [Iso.hom_inv_id_assoc, MonoidalCategory.tensor_id]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  slice_rhs 2 3 => rw [associator_inv_naturality]
  slice_rhs 1 3 => rw [Iso.hom_inv_id_assoc, MonoidalCategory.tensor_id]
  

Proof state:
case h.h
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
⊢ (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P.X) ≫
      (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ f.hom) ≫
        colimit.ι
          (parallelPair (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
            ((α_ (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) Y.X P'.X).hom ≫
              (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ P'.actLeft)))
          WalkingParallelPair.one =
    ((𝟙 (M.X ⊗ N.X) ⊗ f.hom) ≫
        (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P'.X)) ≫
      coequalizer.π (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
        ((α_ (TensorBimod.X M N) Y.X P'.X).hom ≫ (𝟙 (TensorBimod.X M N) ⊗ P'.actLeft))

Next tactic:
slice_lhs 1 2 => rw [tensor_id_comp_id_tensor, ← id_tensor_comp_tensor_id]
theorem comp_whisker_left_bimod {W X Y Z : Mon_ C} (M : Bimod W X) (N : Bimod X Y)
    {P P' : Bimod Y Z} (f : P ⟶ P') :
    tensorHom (𝟙 (M.tensorBimod N)) f =
      (associatorBimod M N P).hom ≫
        tensorHom (𝟙 M) (tensorHom (𝟙 N) f) ≫ (associatorBimod M N P').inv := by
  dsimp [tensorHom, tensorBimod, associatorBimod]
  ext
  apply coequalizer.hom_ext
  dsimp
  slice_lhs 1 2 => rw [ι_colimMap, parallelPairHom_app_one]
  dsimp [TensorBimod.X, AssociatorBimod.hom]
  slice_rhs 1 2 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.homAux, AssociatorBimod.inv]
  refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
  rw [tensorRight_map]
  slice_rhs 1 3 => rw [π_tensor_id_preserves_coequalizer_inv_desc]
  slice_rhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
  slice_rhs 2 3 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one]
  slice_rhs 3 4 => rw [coequalizer.π_desc]
  dsimp [AssociatorBimod.invAux]
  slice_rhs 2 2 => rw [id_tensor_comp]
  slice_rhs 3 5 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
  slice_rhs 2 3 => rw [associator_inv_naturality]
  slice_rhs 1 3 => rw [Iso.hom_inv_id_assoc, MonoidalCategory.tensor_id]
  slice_lhs 1 2 => 

Proof state:
case a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| (coequalizer.π (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft)) ⊗ 𝟙 P.X) ≫
    (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ f.hom)
case a
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
W X Y Z : Mon_ C
M : Bimod W X
N : Bimod X Y
P P' : Bimod Y Z
f : P ⟶ P'
| colimit.ι
    (parallelPair (TensorBimod.actRight M N ⊗ 𝟙 P'.X)
      ((α_ (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) Y.X P'.X).hom ≫
        (𝟙 (coequalizer (M.actRight ⊗ 𝟙 N.X) ((α_ M.X X.X N.X).hom ≫ (𝟙 M.X ⊗ N.actLeft))) ⊗ P'.actLeft)))
    WalkingParallelPair.one

Next tactic:
rw [tensor_id_comp_id_tensor, ← id_tensor_comp_tensor_id]
theorem comp_whisker_right_bimod {X Y Z : Mon_ C} {M N P : Bimod X Y} (f : M ⟶ N) (g : N ⟶ P)
    (Q : Bimod Y Z) : tensorHom (f ≫ g) (𝟙 Q) = tensorHom f (𝟙 Q) ≫ tensorHom g (𝟙 Q) := by
  

Proof state:
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon_ C
M N P : Bimod X Y
f : M ⟶ N
g : N ⟶ P
Q : Bimod Y Z
⊢ tensorHom (f ≫ g) (𝟙 Q) = tensorHom f (𝟙 Q) ≫ tensorHom g (𝟙 Q)

Next tactic:
rw [← tensor_comp, Category.comp_id]
theorem whisker_right_id_bimod {X Y : Mon_ C} {M N : Bimod X Y} (f : M ⟶ N) :
    tensorHom f (𝟙 (regular Y)) = (rightUnitorBimod M).hom ≫ f ≫ (rightUnitorBimod N).inv := by
  

Proof state:
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y : Mon_ C
M N : Bimod X Y
f : M ⟶ N
⊢ tensorHom f (𝟙 (regular Y)) = (rightUnitorBimod M).hom ≫ f ≫ (rightUnitorBimod N).inv

Next tactic:
dsimp [tensorHom, regular, rightUnitorBimod]
theorem whisker_right_id_bimod {X Y : Mon_ C} {M N : Bimod X Y} (f : M ⟶ N) :
    tensorHom f (𝟙 (regular Y)) = (rightUnitorBimod M).hom ≫ f ≫ (rightUnitorBimod N).inv := by
  dsimp [tensorHom, regular, rightUnitorBimod]
  

Proof state:
C : Type u₁
inst✝⁴ : Category.{v₁, u₁} C
inst✝³ : MonoidalCategory C
A B : Mon_ C
M✝ : Bimod A B
inst✝² : HasCoequalizers C
inst✝¹ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst✝ : (X : C) → PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y : Mon_ C
M N : Bimod X Y
f : M ⟶ N
⊢ Hom.mk
      (colimMap
        (parallelPairHom (M.actRight ⊗ 𝟙 Y.X) ((α_ M.X Y.X Y.X).hom ≫ (𝟙 M.X ⊗ Y.mul)) (N.actRight ⊗ 𝟙 Y.X)
          ((α_ N.X Y.X Y.X).hom ≫ (𝟙 N.X ⊗ Y.mul)) ((f.hom ⊗ 𝟙 Y.X) ⊗ 𝟙 Y.X) (f.hom ⊗ 𝟙 Y.X)
          (_ :
            (M.actRight ⊗ 𝟙 (mk Y.X Y.mul Y.mul).X) ≫ (f.hom ⊗ (𝟙 (mk Y.X Y.mul Y.mul)).hom) =
              ((f.hom ⊗ 𝟙 Y.X) ⊗ (𝟙 (mk Y.X Y.mul Y.mul)).hom) ≫ (N.actRight ⊗ 𝟙 (mk Y.X Y.mul Y.mul).X))
          (_ :
            ((α_ M.X Y.X (mk Y.X Y.mul Y.mul).X).hom ≫ (𝟙 M.X ⊗ (mk Y.X Y.mul Y.mul).actLeft)) ≫
                (f.hom ⊗ (𝟙 (mk Y.X Y.mul Y.mul)).hom) =
              ((f.hom ⊗ 𝟙 Y.X) ⊗ (𝟙 (mk Y.X Y.mul Y.mul)).hom) ≫
                (α_ N.X Y.X (mk Y.X Y.mul Y.mul).X).hom ≫ (𝟙 N.X ⊗ (mk Y.X Y.mul Y.mul).actLeft)))) =
    (isoOfIso (Iso.mk (RightUnitorBimod.hom M) (RightUnitorBimod.inv M))
          (_ :
            (tensorBimod M (regular Y)).actLeft ≫ RightUnitorBimod.hom M = (𝟙 X.X ⊗ RightUnitorBimod.hom M) ≫ M.actLeft)
          (_ :
            (tensorBimod M (regular Y)).actRight ≫ RightUnitorBimod.hom M =
              (RightUnitorBimod.hom M ⊗ 𝟙 Y.X) ≫ M.actRight)).hom ≫
      f ≫
        (isoOfIso (Iso.mk (RightUnitorBimod.hom N) (RightUnitorBimod.inv N))
            (_ :
              (tensorBimod N (regular Y)).actLeft ≫ RightUnitorBimod.hom N =
                (𝟙 X.X ⊗ RightUnitorBimod.hom N) ≫ N.actLeft)
            (_ :
              (tensorBimod N (regular Y)).actRight ≫ RightUnitorBimod.hom N =
                (RightUnitorBimod.hom N ⊗ 𝟙 Y.X) ≫ N.actRight)).inv

Next tactic:
ext