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
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 := TensorBimod.X P (Q.tensorBimod L))
      (coequalizer.π (P.actRight ▷ TensorBimod.X Q L)
          (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L) :
        tensorObj.{v₁, u₁} (𝒞 := inst) P.X
            (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)) ⟶
          coequalizer (X := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) P.X S.X) (TensorBimod.X Q L))
            (P.actRight ▷ TensorBimod.X Q L) (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L))
      (coequalizer.desc
        (CategoryStruct.comp (Y :=
          coequalizer (X :=
            tensorObj.{v₁, u₁} (𝒞 := inst) P.X
              (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
            (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (Iso.inv
            (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (coequalizer.desc
            (Iso.inv (α_ P.X Q.X L.X) ≫
              coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
                coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
                  (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
            ⋯))
        ⋯) :
    tensorObj.{v₁, u₁} (𝒞 := inst) P.X (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)) ⟶
      TensorBimod.X (P.tensorBimod Q) L)
have a : CategoryStruct.comp (Y :=
  coequalizer (X :=
    tensorObj.{v₁, u₁} (𝒞 := inst) P.X (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
    (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
  (Iso.inv (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
  (coequalizer.desc
    (Iso.inv (α_ P.X Q.X L.X) ≫
      coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
        coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
          (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
    sorry)
Tactic: rw [coequalizer.π_desc]
-- 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
| CategoryStruct.comp (Y :=
    tensorObj.{v₁, u₁} (𝒞 := inst) P.X (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
    (P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft))
    (CategoryStruct.comp (Y :=
      coequalizer (X :=
        tensorObj.{v₁, u₁} (𝒞 := inst) P.X
          (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
        (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
      (Iso.inv
        (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
      (coequalizer.desc
        (Iso.inv (α_ P.X Q.X L.X) ≫
          coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
            coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
              (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
        ⋯))
have a : Iso.inv (α_ P.X Q.X L.X) ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
      (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft)
Tactic: rw [id_tensor_π_preserves_coequalizer_inv_desc]
-- 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
⊢ Iso.hom (α_ P.X Q.X L.X) ≫
      CategoryStruct.comp (Y :=
        tensorObj.{v₁, u₁} (𝒞 := inst) P.X
          (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
        (P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft))
        (CategoryStruct.comp (Y :=
          coequalizer (X :=
            tensorObj.{v₁, u₁} (𝒞 := inst) P.X
              (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
            (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (Iso.inv
            (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (coequalizer.desc
            (Iso.inv (α_ P.X Q.X L.X) ≫
              coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
                coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
                  (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
            ⋯)) =
    coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
      coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
          (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
        𝟙 (TensorBimod.X (P.tensorBimod Q) L)
have h : Iso.hom (α_ P.X Q.X L.X) ≫
    Iso.inv (α_ P.X Q.X L.X) ≫
      coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
        coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
          (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft) =
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
        (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
      𝟙 (TensorBimod.X (P.tensorBimod Q) L)
Tactic: slice_lhs 2 4 => rw [id_tensor_π_preserves_coequalizer_inv_desc]
-- 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
| Iso.hom (α_ P.X Q.X L.X) ≫
    Iso.inv (α_ P.X Q.X L.X) ≫ coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X
have a : coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X
Tactic: rw [Iso.hom_inv_id_assoc]
-- 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
⊢ Iso.hom (α_ P.X Q.X L.X) ≫
      Iso.inv (α_ P.X Q.X L.X) ≫
        coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
          coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
            (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft) =
    coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
      coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
          (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
        𝟙 (TensorBimod.X (P.tensorBimod Q) L)
have h : coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
      (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft) =
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
        (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
      𝟙 (TensorBimod.X (P.tensorBimod Q) L)
Tactic: slice_lhs 1 3 => rw [Iso.hom_inv_id_assoc]
-- 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 ≫
      coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
        (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft) =
    coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
      coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
          (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
        𝟙 (TensorBimod.X (P.tensorBimod Q) L)
have h : CategoryStruct.comp (Y :=
    tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) L.X)
    (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) P.X Q.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)
    (coequalizer.π (TensorBimod.actRight P Q ▷ 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) ≫
          coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ◁ L.actLeft) :
      tensorObj.{v₁, u₁} (𝒞 := inst) (coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft)) L.X ⟶
        coequalizer (TensorBimod.actRight P Q ▷ 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) ≫
            coequalizer (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ◁ L.actLeft)) =
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π ((P.tensorBimod Q).actRight ▷ L.X)
        (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft) ≫
      𝟙
        (coequalizer ((P.tensorBimod Q).actRight ▷ L.X)
          (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft))
Tactic: dsimp only [TensorBimod.X]
-- 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) ≫
    𝟙
      (coequalizer ((P.tensorBimod Q).actRight ▷ L.X)
        (Iso.hom (α_ (P.tensorBimod Q).X T.X L.X) ≫ (P.tensorBimod Q).X ◁ L.actLeft))
have a : 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 [Category.comp_id]
-- 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
| CategoryStruct.comp (Y :=
    coequalizer (P.actRight ▷ (Q.tensorBimod L).X)
      (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft))
    (coequalizer.π (P.actRight ▷ (Q.tensorBimod L).X)
      (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft))
    (coequalizer.desc
      (CategoryStruct.comp (Y :=
        coequalizer (X :=
          tensorObj.{v₁, u₁} (𝒞 := inst) P.X
            (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
          (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
        (Iso.inv
          (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
        (coequalizer.desc
          (Iso.inv (α_ P.X Q.X L.X) ≫
            coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
              coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
                (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
          ⋯))
      ⋯)
have a : CategoryStruct.comp (Y :=
  coequalizer (X :=
    tensorObj.{v₁, u₁} (𝒞 := inst) P.X (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
    (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
  (Iso.inv (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
  (coequalizer.desc
    (Iso.inv (α_ P.X Q.X L.X) ≫
      coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
        coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
          (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
    sorry)
Tactic: rw [coequalizer.π_desc]
-- 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
| CategoryStruct.comp (Y :=
    Functor.obj.{v₁, v₁, u₁, u₁} (tensorLeft P.X)
      (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
    (P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft))
    (CategoryStruct.comp (Y :=
      coequalizer (X :=
        tensorObj.{v₁, u₁} (𝒞 := inst) P.X
          (tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X T.X) L.X))
        (P.X ◁ Q.actRight ▷ L.X) (P.X ◁ (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
      (Iso.inv
        (PreservesCoequalizer.iso (tensorLeft P.X) (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
      (coequalizer.desc
        (Iso.inv (α_ P.X Q.X L.X) ≫
          coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
            coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
              (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft))
        ⋯))
have a : Iso.inv (α_ P.X Q.X L.X) ≫
  coequalizer.π (P.actRight ▷ Q.X) (Iso.hom (α_ P.X S.X Q.X) ≫ P.X ◁ Q.actLeft) ▷ L.X ≫
    coequalizer.π (TensorBimod.actRight P Q ▷ L.X)
      (Iso.hom (α_ (TensorBimod.X P Q) T.X L.X) ≫ TensorBimod.X P Q ◁ L.actLeft)
Tactic: rw [id_tensor_π_preserves_coequalizer_inv_desc]
-- 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
| Iso.inv (α_ P.X Q.X L.X) ≫
    Iso.hom (α_ P.X Q.X 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 ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)
Tactic: rw [Iso.inv_hom_id_assoc]
-- 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
⊢ Iso.inv (α_ P.X Q.X L.X) ≫
      Iso.hom (α_ P.X Q.X L.X) ≫
        CategoryStruct.comp (Y :=
          tensorObj.{v₁, u₁} (𝒞 := inst) P.X
            (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft) :
            tensorObj.{v₁, u₁} (𝒞 := inst) P.X (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X L.X) ⟶
              tensorObj.{v₁, u₁} (𝒞 := inst) P.X
                (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
          (coequalizer.π (P.actRight ▷ TensorBimod.X Q L)
              (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L) :
            tensorObj.{v₁, u₁} (𝒞 := inst) P.X
                (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)) ⟶
              coequalizer (X :=
                tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) P.X S.X) (TensorBimod.X Q L))
                (P.actRight ▷ TensorBimod.X Q L)
                (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L)) =
    P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft) ≫
      coequalizer.π (P.actRight ▷ (Q.tensorBimod L).X)
          (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft) ≫
        𝟙 (TensorBimod.X P (Q.tensorBimod L))
have h : CategoryStruct.comp (Y :=
    tensorObj.{v₁, u₁} (𝒞 := inst) P.X (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
    (P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft) :
      tensorObj.{v₁, u₁} (𝒞 := inst) P.X (tensorObj.{v₁, u₁} (𝒞 := inst) Q.X L.X) ⟶
        tensorObj.{v₁, u₁} (𝒞 := inst) P.X
          (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)))
    (coequalizer.π (P.actRight ▷ TensorBimod.X Q L)
        (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L) :
      tensorObj.{v₁, u₁} (𝒞 := inst) P.X (coequalizer (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft)) ⟶
        coequalizer (X := tensorObj.{v₁, u₁} (𝒞 := inst) (tensorObj.{v₁, u₁} (𝒞 := inst) P.X S.X) (TensorBimod.X Q L))
          (P.actRight ▷ TensorBimod.X Q L) (Iso.hom (α_ P.X S.X (TensorBimod.X Q L)) ≫ P.X ◁ TensorBimod.actLeft Q L)) =
  P.X ◁ coequalizer.π (Q.actRight ▷ L.X) (Iso.hom (α_ Q.X T.X L.X) ≫ Q.X ◁ L.actLeft) ≫
    coequalizer.π (P.actRight ▷ (Q.tensorBimod L).X)
        (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft) ≫
      𝟙 (TensorBimod.X P (Q.tensorBimod L))
Tactic: slice_lhs 1 3 => rw [Iso.inv_hom_id_assoc]
-- 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.tensorBimod L).X)
      (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft) ≫
    𝟙
      (coequalizer (P.actRight ▷ (Q.tensorBimod L).X)
        (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft))
have a : coequalizer.π (P.actRight ▷ (Q.tensorBimod L).X)
  (Iso.hom (α_ P.X S.X (Q.tensorBimod L).X) ≫ P.X ◁ (Q.tensorBimod L).actLeft)
Tactic: rw [Category.comp_id]
-- 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
R S : Mon.{v₁, u₁} C
P : Bimod R S
⊢ (regular R).actRight ▷ P.X ≫ P.actLeft = (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft) ≫ P.actLeft
have dsimp : μ ▷ P.X ≫ P.actLeft = (Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft) ≫ P.actLeft
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
A B : Mon.{v₁, u₁} C
M : Bimod A B
inst_2 : HasCoequalizers.{v₁, u₁} C
R S : Mon.{v₁, u₁} C
P : Bimod R S
⊢ μ ▷ P.X ≫ P.actLeft = (Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft) ≫ P.actLeft
have rw : μ ▷ P.X ≫ P.actLeft = Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft ≫ P.actLeft
Tactic: rw [Category.assoc, left_assoc]
-- 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
R S : Mon.{v₁, u₁} C
P : Bimod R S
rw : μ ▷ P.X ≫ P.actLeft = Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft ≫ P.actLeft
⊢ μ ▷ P.X ≫ P.actLeft = (Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft) ≫ P.actLeft
have rw₁ : Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft ≫ P.actLeft = Iso.hom (α_ R.X R.X P.X) ≫ R.X ◁ P.actLeft ≫ P.actLeft
Tactic: rw [Category.assoc, left_assoc]
-- 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
R S : Mon.{v₁, u₁} C
P : Bimod R S
⊢ hom P ≫ inv P = 𝟙 (TensorBimod.X (regular R) P)
have dsimp : coequalizer.desc P.actLeft sorry ≫
    Iso.inv (λ_ P.X) ≫
      η ▷ P.X ≫
        coequalizer.π ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft) =
  𝟙 (coequalizer ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft))
Tactic: dsimp only [hom, inv, TensorBimod.X]
-- 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
R S : Mon.{v₁, u₁} C
P : Bimod R S
⊢ coequalizer.desc P.actLeft ⋯ ≫
      Iso.inv (λ_ P.X) ≫
        η ▷ P.X ≫
          coequalizer.π ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft) =
    𝟙 (coequalizer ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft))
have h : CategoryStruct.comp (Y :=
    coequalizer ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft))
    (coequalizer.π ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft))
    (coequalizer.desc P.actLeft sorry ≫
      Iso.inv (λ_ P.X) ≫
        η ▷ P.X ≫
          coequalizer.π ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft)) =
  coequalizer.π ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft) ≫
    𝟙 (coequalizer ((regular R).actRight ▷ P.X) (Iso.hom (α_ (regular R).X R.X P.X) ≫ (regular R).X ◁ P.actLeft))
Tactic: ext