proposition: Lemma is_inverse_nat_trans_inv_from_pointwise_inv (C : precategory_data)(C' : precategory) (hs: has_homsets C') (F G : [C, C', hs]) (A : F --> G) (H : is_nat_iso A) : is_inverse_in_precat A (nat_trans_inv_from_pointwise_inv C C' _ F G A H).
proof: Proof. simpl; split; simpl. - apply nat_trans_eq. apply hs. intro x; simpl. set (T := iso_inv_after_iso (tpair _ (pr1 A x) (H x))). apply T. - apply nat_trans_eq. apply hs. intro x; simpl. set (T := iso_after_iso_inv (tpair _ (pr1 A x) (H x))). apply T. Qed.
imports: UniMath.Foundations.Propositions UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Univalence UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.TransportMorphisms UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence