proposition: Lemma cancel_precomposition_z_iso {C : precategory} {a b c : C} (f : z_iso a b) (g h : b --> c) : f · g = f · h -> g = h.
proof: Proof. use pre_comp_with_z_iso_is_inj. - exact (pr1 (pr2 f)). - exact (pr2 (pr2 f)). Qed.
imports: UniMath.Foundations.PartA UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories