proposition: Lemma transport_compose' {C : precategory} {x y z w : ob C} (f : x --> y) (g : y --> z) (e : y = w) : (transportf (precategory_morphisms x) e f) · (transportf (λ x' : ob C, precategory_morphisms x' z) e g) = f · g.
proof: Proof. induction e. apply idpath. Qed.
imports: UniMath.Foundations.PartA UniMath.Foundations.UnivalenceAxiom UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos