Lemma transport_target_path {C : precategory} {x y z : ob C} (f g : x --> y) (e : y = z) : transportf (precategory_morphisms x) e f = transportf (precategory_morphisms x) 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.