proposition: Lemma to_binop_inv_inv {x y : PA} (f g : PA⟦x, y⟧) : to_binop _ _ (to_inv f) (to_inv g) = to_inv (to_binop _ _ f g).
proof: Proof. apply (to_rcan g). rewrite to_assoc. rewrite linvax. rewrite to_runax'. apply (to_rcan f). rewrite to_assoc. rewrite linvax. cbn. rewrite <- (linvax (to_binop x y f g)). apply maponpaths. apply to_commax'. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.Algebra.Monoids UniMath.Algebra.Groups UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.CategoriesWithBinOps UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Core.Functors