proposition: Lemma z_iso_comp_right_isweq {C : precategory} {a b : ob C} (h : z_iso a b) (c : C) : isweq (fun f : b --> c => h · f).
proof: Proof. intros. apply (isweq_iso _ (λ g, inv_from_z_iso h · g)). { intros f. use (_ @ maponpaths (λ m, m · f) (pr2 (pr2 (pr2 h))) @ _). { apply assoc. } { apply id_left. } } { intros g. use (_ @ maponpaths (λ m, m · g) (pr1 (pr2 (pr2 h))) @ _). { apply assoc. } { apply id_left. } } Defined.
imports: UniMath.Foundations.PartA UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories