proposition: Lemma rpredN1 (S : smulClosed R) : -1 \in S.
proof: Proof. by rewrite rpredN rpred1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)