l3lab/ntp-mathlib huggingface dataset:
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    

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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (α_ X.X M₁.X N₁.X).inv ≫
      ((𝟙 X.X ⊗ f.hom) ≫ M₂.actLeft ⊗ g.hom) ≫
        colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
          WalkingParallelPair.one =
    (𝟙 X.X ⊗ coequalizer.π (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))) ≫
      (𝟙 X.X ⊗
          colimMap
            (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))
              (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom)
              (f.hom ⊗ g.hom)
              (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
              (_ :
                ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
                  ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))) ≫
        TensorBimod.actLeft M₂ N₂

Next tactic:
slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| (𝟙 X.X ⊗ coequalizer.π (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))) ≫
    (𝟙 X.X ⊗
      colimMap
        (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) (M₂.actRight ⊗ 𝟙 N₂.X)
          ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
          (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
          (_ :
            ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
              ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| TensorBimod.actLeft M₂ N₂

Next tactic:
rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    

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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (α_ X.X M₁.X N₁.X).inv ≫
      ((𝟙 X.X ⊗ f.hom) ≫ M₂.actLeft ⊗ g.hom) ≫
        colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
          WalkingParallelPair.one =
    ((𝟙 X.X ⊗ f.hom ⊗ g.hom) ≫
        (𝟙 X.X ⊗
          colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
            WalkingParallelPair.one)) ≫
      TensorBimod.actLeft M₂ N₂

Next tactic:
slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => 

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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| (𝟙 X.X ⊗
      colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
        WalkingParallelPair.one) ≫
    TensorBimod.actLeft M₂ N₂
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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| 𝟙 X.X ⊗ f.hom ⊗ g.hom

Next tactic:
rw [TensorBimod.id_tensor_π_actLeft]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    

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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (α_ X.X M₁.X N₁.X).inv ≫
      ((𝟙 X.X ⊗ f.hom) ≫ M₂.actLeft ⊗ g.hom) ≫
        colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
          WalkingParallelPair.one =
    (𝟙 X.X ⊗ f.hom ⊗ g.hom) ≫
      (α_ X.X M₂.X N₂.X).inv ≫
        (M₂.actLeft ⊗ 𝟙 N₂.X) ≫ coequalizer.π (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))

Next tactic:
slice_rhs 1 2 => rw [associator_inv_naturality]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_rhs 1 2 => 

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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| (𝟙 X.X ⊗ f.hom ⊗ g.hom) ≫ (α_ X.X M₂.X N₂.X).inv
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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| M₂.actLeft ⊗ 𝟙 N₂.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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| coequalizer.π (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))

Next tactic:
rw [associator_inv_naturality]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_rhs 1 2 => rw [associator_inv_naturality]
    

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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (α_ X.X M₁.X N₁.X).inv ≫
      ((𝟙 X.X ⊗ f.hom) ≫ M₂.actLeft ⊗ g.hom) ≫
        colimit.ι (parallelPair (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)))
          WalkingParallelPair.one =
    (((α_ X.X M₁.X N₁.X).inv ≫ ((𝟙 X.X ⊗ f.hom) ⊗ g.hom)) ≫ (M₂.actLeft ⊗ 𝟙 N₂.X)) ≫
      coequalizer.π (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))

Next tactic:
slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_rhs 1 2 => rw [associator_inv_naturality]
    slice_rhs 2 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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| ((𝟙 X.X ⊗ f.hom) ⊗ g.hom) ≫ (M₂.actLeft ⊗ 𝟙 N₂.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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| coequalizer.π (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.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)
X Y Z : Mon_ C
M₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
| (α_ X.X M₁.X N₁.X).inv

Next tactic:
rw [← tensor_comp, Category.comp_id]
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_rhs 1 2 => rw [associator_inv_naturality]
    slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]
  right_act_hom := 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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (tensorBimod M₁ N₁).actRight ≫
      colimMap
        (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) (M₂.actRight ⊗ 𝟙 N₂.X)
          ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
          (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
          (_ :
            ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
              ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))) =
    (colimMap
          (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))
            (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom)
            (f.hom ⊗ g.hom)
            (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
            (_ :
              ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
                ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))) ⊗
        𝟙 Z.X) ≫
      (tensorBimod M₂ N₂).actRight

Next tactic:
refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
/-- Tensor product of two morphisms of bimodule objects. -/
@[simps]
noncomputable def tensorHom {X Y Z : Mon_ C} {M₁ M₂ : Bimod X Y} {N₁ N₂ : Bimod Y Z} (f : M₁ ⟶ M₂)
    (g : N₁ ⟶ N₂) : M₁.tensorBimod N₁ ⟶ M₂.tensorBimod N₂ where
  hom :=
    colimMap
      (parallelPairHom _ _ _ _ ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) (f.hom ⊗ g.hom)
        (by
          rw [← tensor_comp, ← tensor_comp, Hom.right_act_hom, Category.id_comp, Category.comp_id])
        (by
          slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
          slice_rhs 1 2 => rw [associator_naturality]
          slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]))
  left_act_hom := by
    refine' (cancel_epi ((tensorLeft _).map (coequalizer.π _ _))).1 _
    dsimp
    slice_lhs 1 2 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
    slice_lhs 2 3 => rw [← tensor_comp, Hom.left_act_hom, Category.id_comp]
    slice_rhs 1 2 => rw [← id_tensor_comp, ι_colimMap, parallelPairHom_app_one, id_tensor_comp]
    slice_rhs 2 3 => rw [TensorBimod.id_tensor_π_actLeft]
    slice_rhs 1 2 => rw [associator_inv_naturality]
    slice_rhs 2 3 => rw [← tensor_comp, Category.comp_id]
  right_act_hom := by
    refine' (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 _
    

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₁ M₂ : Bimod X Y
N₁ N₂ : Bimod Y Z
f : M₁ ⟶ M₂
g : N₁ ⟶ N₂
⊢ (tensorRight Z.X).map (coequalizer.π (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))) ≫
      (tensorBimod M₁ N₁).actRight ≫
        colimMap
          (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))
            (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom)
            (f.hom ⊗ g.hom)
            (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
            (_ :
              ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
                ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))) =
    (tensorRight Z.X).map (coequalizer.π (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))) ≫
      (colimMap
            (parallelPairHom (M₁.actRight ⊗ 𝟙 N₁.X) ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft))
              (M₂.actRight ⊗ 𝟙 N₂.X) ((α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft)) ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom)
              (f.hom ⊗ g.hom)
              (_ : (M₁.actRight ⊗ 𝟙 N₁.X) ≫ (f.hom ⊗ g.hom) = ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (M₂.actRight ⊗ 𝟙 N₂.X))
              (_ :
                ((α_ M₁.X Y.X N₁.X).hom ≫ (𝟙 M₁.X ⊗ N₁.actLeft)) ≫ (f.hom ⊗ g.hom) =
                  ((f.hom ⊗ 𝟙 Y.X) ⊗ g.hom) ≫ (α_ M₂.X Y.X N₂.X).hom ≫ (𝟙 M₂.X ⊗ N₂.actLeft))) ⊗
          𝟙 Z.X) ≫
        (tensorBimod M₂ N₂).actRight

Next tactic:
dsimp