Lemma transport_source_path {C : precategory} {x y z : ob C} (f g : y --> z) (e : y = x) : transportf (λ x' : ob C, precategory_morphisms x' z) e f = transportf (λ x' : ob C, precategory_morphisms x' z) e g -> f = g. Proof. induction e. intros H. apply H. Qed.
Require Import UniMath.Foundations.PartA. Require Import UniMath.Foundations.UnivalenceAxiom. Require Import UniMath.MoreFoundations.Tactics. Require Import UniMath.CategoryTheory.Core.Categories. Require Import UniMath.CategoryTheory.Core.Isos.