awhecmu/canonical-drafter-extract-mathlib huggingface dataset:
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
⊢ (M₁.tensorBimod N).actRight ≫
      colimMap
        (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
          (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) =
    colimMap
          (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
            (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) ▷
        Z.X ≫
      (M₂.tensorBimod N).actRight
have refine : Eq (α :=
  Functor.obj.{v₁, v₁, u₁, u₁} (tensorRight Z.X) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) ⟶ (M₂.tensorBimod N).X)
  (CategoryTheory.Functor.map (tensorRight Z.X)
      (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft)) ≫
    (M₁.tensorBimod N).actRight ≫
      colimMap
        (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
          (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) sorry sorry))
  (CategoryStruct.comp (Y :=
    Functor.obj.{v₁, v₁, u₁, u₁} (tensorRight Z.X)
      (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft)))
    (CategoryTheory.Functor.map (tensorRight Z.X)
      (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft)))
    (colimMap
          (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
            (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) sorry sorry) ▷
        Z.X ≫
      (M₂.tensorBimod N).actRight))
Tactic: refine (cancel_epi ((tensorRight _).map (coequalizer.π _ _))).1 ?_
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
| coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X ≫ TensorBimod.actRight M₁ N
have a : Iso.hom (α_ M₁.X N.X Z.X) ≫
  M₁.X ◁ N.actRight ≫ coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft)
Tactic: rw [TensorBimod.π_tensor_id_actRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
⊢ Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (CategoryStruct.comp (Y := TensorBimod.X M₁ N)
        (Iso.hom (α_ M₁.X N.X Z.X) ≫
          M₁.X ◁ N.actRight ≫ coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
        (colimMap
          (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
            (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯)) :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (CategoryStruct.comp (Y :=
        tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
          Z.X)
        (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
        (colimMap
              (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
                (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) ▷
            Z.X ≫
          TensorBimod.actRight M₂ N) :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
have slice_lhs : Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (Iso.hom (α_ M₁.X N.X Z.X) ≫
      M₁.X ◁ N.actRight ≫
        f.hom ▷ N.X ≫
          colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
            WalkingParallelPair.one :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (CategoryStruct.comp (Y :=
      tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
        Z.X)
      (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
      (colimMap
            (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
              (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) sorry sorry) ▷
          Z.X ≫
        TensorBimod.actRight M₂ N) :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
Tactic: slice_lhs 3 4 => rw [ι_colimMap, parallelPairHom_app_one]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
| M₁.X ◁ N.actRight ≫ f.hom ▷ N.X
have a : f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight
Tactic: rw [whisker_exchange]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
⊢ Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (Iso.hom (α_ M₁.X N.X Z.X) ≫
        M₁.X ◁ N.actRight ≫
          f.hom ▷ N.X ≫
            colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
              WalkingParallelPair.one :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (CategoryStruct.comp (Y :=
        tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
          Z.X)
        (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
        (colimMap
              (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
                (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) ▷
            Z.X ≫
          TensorBimod.actRight M₂ N) :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
have slice_lhs : Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (Iso.hom (α_ M₁.X N.X Z.X) ≫
      (f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight) ≫
        colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
          WalkingParallelPair.one :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (CategoryStruct.comp (Y :=
      tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
        Z.X)
      (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
      (colimMap
            (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
              (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) sorry sorry) ▷
          Z.X ≫
        TensorBimod.actRight M₂ N) :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
Tactic: slice_lhs 2 3 => rw [whisker_exchange]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
| CategoryStruct.comp (Y :=
    tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft)) Z.X)
    (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
    (colimMap
        (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
          (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) ▷
      Z.X)
have a : f.hom ▷ N.X ▷ Z.X ≫
  colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft)) WalkingParallelPair.one ▷
    Z.X
Tactic: rw [← comp_whiskerRight, ι_colimMap, parallelPairHom_app_one,
      comp_whiskerRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
⊢ Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (Iso.hom (α_ M₁.X N.X Z.X) ≫
        (f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight) ≫
          colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
            WalkingParallelPair.one :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (CategoryStruct.comp (Y :=
        tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft))
          Z.X)
        (coequalizer.π (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) ▷ Z.X)
        (colimMap
              (parallelPairHom (M₁.actRight ▷ N.X) (Iso.hom (α_ M₁.X Y.X N.X) ≫ M₁.X ◁ N.actLeft) (M₂.actRight ▷ N.X)
                (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft) (f.hom ▷ Y.X ▷ N.X) (f.hom ▷ N.X) ⋯ ⋯) ▷
            Z.X ≫
          TensorBimod.actRight M₂ N) :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
have slice_rhs : Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (Iso.hom (α_ M₁.X N.X Z.X) ≫
      (f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight) ≫
        colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
          WalkingParallelPair.one :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  ((f.hom ▷ N.X ▷ Z.X ≫
        colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
            WalkingParallelPair.one ▷
          Z.X) ≫
      TensorBimod.actRight M₂ N :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
Tactic: slice_rhs 1 2 => rw [← comp_whiskerRight, ι_colimMap, parallelPairHom_app_one,
      comp_whiskerRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
| colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft)) WalkingParallelPair.one ▷
      Z.X ≫
    TensorBimod.actRight M₂ N
have a : Iso.hom (α_ M₂.X N.X Z.X) ≫
  M₂.X ◁ N.actRight ≫ coequalizer.π (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft)
Tactic: rw [TensorBimod.π_tensor_id_actRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
X Y Z : Mon.{v₁, u₁} C
M₁ M₂ : Bimod X Y
f : M₁ ⟶ M₂
N : Bimod Y Z
⊢ Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    (Iso.hom (α_ M₁.X N.X Z.X) ≫
        (f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight) ≫
          colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
            WalkingParallelPair.one :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
    ((f.hom ▷ N.X ▷ Z.X ≫
          colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
              WalkingParallelPair.one ▷
            Z.X) ≫
        TensorBimod.actRight M₂ N :
      tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
have slice_rhs : Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) M₁.X N.X) Z.X ⟶ TensorBimod.X M₂ N)
  (Iso.hom (α_ M₁.X N.X Z.X) ≫
    (f.hom ▷ tensorObj.{v₁, u₁} (𝒞 := inst) N.X Z.X ≫ M₂.X ◁ N.actRight) ≫
      colimit.ι (parallelPair (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
        WalkingParallelPair.one)
  (f.hom ▷ N.X ▷ Z.X ≫
    Iso.hom (α_ M₂.X N.X Z.X) ≫
      M₂.X ◁ N.actRight ≫ coequalizer.π (M₂.actRight ▷ N.X) (Iso.hom (α_ M₂.X Y.X N.X) ≫ M₂.X ◁ N.actLeft))
Tactic: slice_rhs 2 3 => rw [TensorBimod.π_tensor_id_actRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| (CategoryStruct.comp (Y :=
      tensorObj.{v₁, u₁} (𝒞 := inst)
        (tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft))
          T.X)
        L.X)
      (coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ T.X ▷ L.X :
        tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X) T.X)
            L.X ⟶
          tensorObj.{v₁, u₁} (𝒞 := inst)
            (tensorObj.{v₁, u₁} (𝒞 := inst)
              (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) T.X)
            L.X)
      (TensorBimod.actRight P Q ▷ L.X :
        tensorObj.{v₁, u₁} (𝒞 := inst)
            (tensorObj.{v₁, u₁} (𝒞 := inst)
              (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) T.X)
            L.X ⟶
          tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft))
            L.X) :
    tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X) T.X) L.X ⟶
      tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) L.X)
have a : Iso.hom (α_ P.X Q.X T.X) ▷ L.X ≫
  (P.X ◁ Q.actRight) ▷ L.X ≫ coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X
Tactic: rw [← comp_whiskerRight, TensorBimod.π_tensor_id_actRight,
        comp_whiskerRight, comp_whiskerRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| (P.X ◁ Q.actRight) ▷ L.X ≫ Iso.hom (α_ P.X Q.X L.X)
have a : Iso.hom (α_ P.X (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X) ≫ P.X ◁ Q.actRight ▷ L.X
Tactic: rw [associator_naturality_middle]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| P.X ◁ Q.actRight ▷ L.X ≫ P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)
have a : (P.X ◁ Iso.hom (α_ Q.X T.X L.X) ≫ P.X ◁ Q.X ◁ L.actLeft) ≫
  P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)
Tactic: rw [← whiskerLeft_comp, coequalizer.condition,
          whiskerLeft_comp, whiskerLeft_comp]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ T.X ▷ L.X ≫
    Iso.hom (α_ (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) T.X L.X)
have a : Iso.hom (α_ (tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X) T.X L.X) ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ tensorObj.{v₁, u₁} (𝒞 := inst) T.X L.X
Tactic: rw [associator_naturality_left]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷
      tensorObj.{v₁, u₁} (𝒞 := inst) T.X L.X ≫
    coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ◁ L.actLeft
have a : tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X ◁ L.actLeft ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X
Tactic: rw [← whisker_exchange]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
⊢ ((P.tensorBimod Q).tensorBimod L).actRight ≫ hom P Q L = hom P Q L ▷ U.X ≫ (P.tensorBimod (Q.tensorBimod L)).actRight
have dsimp : Eq (α := tensorObj.{v₁, u₁} (𝒞 := inst) (TensorBimod.X (P.tensorBimod Q) L) U.X ⟶ TensorBimod.X P (Q.tensorBimod L))
  (TensorBimod.actRight (P.tensorBimod Q) L ≫ hom P Q L) (hom P Q L ▷ U.X ≫ TensorBimod.actRight P (Q.tensorBimod L))
Tactic: dsimp
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
        (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ▷
      U.X ≫
    TensorBimod.actRight (P.tensorBimod Q) L
have a : Iso.hom (α_ (P.tensorBimod Q).X L.X U.X) ≫
  (P.tensorBimod Q).X ◁ L.actRight ≫
    coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
      (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft)
Tactic: rw [TensorBimod.π_tensor_id_actRight]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ▷ U.X ≫
    Iso.hom (α_ (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) L.X U.X)
have a : Iso.hom (α_ (tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X) L.X U.X) ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ tensorObj.{v₁, u₁} (𝒞 := inst) L.X U.X
Tactic: rw [associator_naturality_left]
-- Lean 4 proof step from Mathlib.CategoryTheory.Monoidal.Bimod (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
inst_1 : MonoidalCategory.{v₁, u₁} C
inst_2 : HasCoequalizers.{v₁, u₁} C
inst_3 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorLeft X)
inst_4 : ∀ (X : C), PreservesColimitsOfSize.{0, 0, v₁, v₁, u₁, u₁} (tensorRight X)
R S T U : Mon.{v₁, u₁} C
P : Bimod R S
Q : Bimod S T
L : Bimod T U
| coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷
      tensorObj.{v₁, u₁} (𝒞 := inst) L.X U.X ≫
    coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ◁ L.actRight
have a : tensorObj.{v₁, u₁} (𝒞 := inst) P.X Q.X ◁ L.actRight ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X
Tactic: rw [← whisker_exchange]