proposition: Lemma abgr_univalence_isweq (X Y : abgr) : isweq (abgr_univalence_map X Y).
proof: Proof. use isweqhomot. - exact (weqcomp (abgr_univalence_weq1' X Y) (weqcomp (abgr_univalence_weq2 X Y) (abgr_univalence_weq3 X Y))). - intros e. induction e. use (pathscomp0 weqcomp_to_funcomp_app). use weqcomp_to_funcomp_app. - use weqproperty. Defined.
imports: UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Subtypes UniMath.Algebra.BinaryOperations UniMath.Algebra.Monoids