Lemma isasetmodulefun {R : ring} (M N : module R) : isaset (R-mod(M, N)). Proof. intros. apply (isasetsubset (@pr1modulefun R M N)). - change (isofhlevel 2 (M -> N)). apply impred. intro. apply (setproperty N). - refine (isinclpr1 _ _). intro. apply isapropismodulefun. Defined.
Require Import UniMath.MoreFoundations.Tactics. Require Import UniMath.Algebra.RigsAndRings. Require Import UniMath.Algebra.Groups. Require Import UniMath.Algebra.Monoids.