proposition: Lemma left_inverse_of_iso_is_inverse {C : precategory} {c c' : C} (f : c --> c') (g : c' --> c) (H : is_inverse_in_precat f g) (h : c' --> c) (HH : h · f = identity _) : h = g.
proof: Proof. refine (!id_right _ @ _). refine (maponpaths (fun z => h · z) (!is_inverse_in_precat1 H) @ _). refine (assoc _ _ _ @ _). refine (maponpaths (fun z => z · g) HH @ _). apply id_left. Qed.
imports: UniMath.Foundations.PartA UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories