-- Lean 4 proof step from Mathlib.Algebra.Homology.ShortComplex.PreservesHomology (goal)
Goal:
C : Type u_1
D : Type u_2
inst : Category.{v_1, u_1} C
inst_1 : Category.{v_2, u_2} D
inst_2 : HasZeroMorphisms.{v_1, u_1} C
inst_3 : HasZeroMorphisms.{v_2, u_2} D
S₁ S₂ : ShortComplex.{v_1, u_1} C
φ : S₁ ⟶ S₂
F : Functor.{v_1, v_2, u_1, u_2} C D
inst_4 : F.PreservesZeroMorphisms
inst_5 : S₁.HasLeftHomology
inst_6 : S₂.HasLeftHomology
inst_7 : F.PreservesLeftHomologyOf S₁
inst_8 : F.PreservesLeftHomologyOf S₂
rw :
  Eq (α := cycles (S₁.map F) ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := F.obj S₁.cycles) (Iso.hom (S₁.mapCyclesIso F))
        (CategoryStruct.comp (Y := F.obj S₂.cycles) (F.map (cyclesMap φ)) (Iso.inv (S₂.mapCyclesIso F))) :
      cycles (S₁.map F) ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := F.obj S₁.cycles) (Iso.hom (S₁.mapCyclesIso F))
        (CategoryStruct.comp (Y := cycles (S₁.map F))
          (Iso.inv (S₁.mapCyclesIso F) : F.obj S₁.cycles ⟶ cycles (S₁.map F))
          (cyclesMap (Functor.map F.mapShortComplex φ) :
            cycles (S₁.map F) ⟶ cycles (Functor.obj F.mapShortComplex S₂))) :
      cycles (S₁.map F) ⟶ cycles (S₂.map F))
rw₁ :
  Eq (α := cycles (S₁.map F) ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := cycles (Functor.obj F.mapShortComplex S₂))
        (cyclesMap (Functor.map F.mapShortComplex φ) :
          cycles (Functor.obj F.mapShortComplex S₁) ⟶ cycles (Functor.obj F.mapShortComplex S₂))
        (CategoryStruct.comp (Y := F.obj S₂.cycles) (Iso.hom (S₂.mapCyclesIso F)) (Iso.inv (S₂.mapCyclesIso F)) :
          cycles (Functor.obj F.mapShortComplex S₂) ⟶ cycles (S₂.map F)) :
      cycles (Functor.obj F.mapShortComplex S₁) ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := F.obj S₁.cycles) (Iso.hom (S₁.mapCyclesIso F))
      (CategoryStruct.comp (Y := cycles (S₁.map F)) (Iso.inv (S₁.mapCyclesIso F) : F.obj S₁.cycles ⟶ cycles (S₁.map F))
        (cyclesMap (Functor.map F.mapShortComplex φ) : cycles (S₁.map F) ⟶ cycles (Functor.obj F.mapShortComplex S₂))))
rw₂ :
  Eq (α := cycles (S₁.map F) ⟶ cycles (S₂.map F))
    (cyclesMap (Functor.map F.mapShortComplex φ) ≫ 𝟙 (cycles (Functor.obj F.mapShortComplex S₂)) :
      cycles (Functor.obj F.mapShortComplex S₁) ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := F.obj S₁.cycles) (Iso.hom (S₁.mapCyclesIso F))
        (CategoryStruct.comp (Y := cycles (S₁.map F))
          (Iso.inv (S₁.mapCyclesIso F) : F.obj S₁.cycles ⟶ cycles (S₁.map F))
          (cyclesMap (Functor.map F.mapShortComplex φ) :
            cycles (S₁.map F) ⟶ cycles (Functor.obj F.mapShortComplex S₂))) :
      cycles (S₁.map F) ⟶ cycles (S₂.map F))
rw₃ :
  Eq (α := cycles (S₁.map F) ⟶ cycles (S₂.map F))
    (cyclesMap (Functor.map F.mapShortComplex φ) :
      cycles (Functor.obj F.mapShortComplex S₁) ⟶ cycles (Functor.obj F.mapShortComplex S₂))
    (CategoryStruct.comp (Y := F.obj S₁.cycles) (Iso.hom (S₁.mapCyclesIso F))
      (CategoryStruct.comp (Y := cycles (S₁.map F)) (Iso.inv (S₁.mapCyclesIso F) : F.obj S₁.cycles ⟶ cycles (S₁.map F))
        (cyclesMap (Functor.map F.mapShortComplex φ) : cycles (S₁.map F) ⟶ cycles (Functor.obj F.mapShortComplex S₂))))
⊢ Eq (α := F.obj S₁.cycles ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := F.obj S₂.cycles) (F.map (cyclesMap φ)) (Iso.inv (S₂.mapCyclesIso F)) :
      F.obj S₁.cycles ⟶ cycles (S₂.map F))
    (CategoryStruct.comp (Y := cycles (S₁.map F)) (Iso.inv (S₁.mapCyclesIso F) : F.obj S₁.cycles ⟶ cycles (S₁.map F))
        (cyclesMap (Functor.map F.mapShortComplex φ) : cycles (S₁.map F) ⟶ cycles (Functor.obj F.mapShortComplex S₂)) :
      F.obj S₁.cycles ⟶ cycles (Functor.obj F.mapShortComplex S₂))
have rw₄ : Eq (α := cycles (S₁.map F) ⟶ cycles (S₂.map F))
  (cyclesMap (Functor.map F.mapShortComplex φ) :
    cycles (Functor.obj F.mapShortComplex S₁) ⟶ cycles (Functor.obj F.mapShortComplex S₂))
  (cyclesMap (Functor.map F.mapShortComplex φ))
Tactic: rw [← cancel_epi (S₁.mapCyclesIso F).hom, ← mapCyclesIso_hom_naturality_assoc,
    Iso.hom_inv_id, comp_id, Iso.hom_inv_id_assoc]