proposition: Lemma isaprop_isapunop {X : tightapSet} (op :unop X) : isaprop (isapunop op).
proof: Proof. intros ap. apply impred_isaprop ; intro x. apply impred_isaprop ; intro y. apply isapropimpl. now apply pr2. Qed.
imports: UniMath.Algebra.BinaryOperations UniMath.Foundations.Propositions UniMath.MoreFoundations.Sets UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.DecidablePropositions