proposition: Lemma rpredZnat (S : addrClosed V) n : {in S, forall u, n%:R *: u \in S}.
proof: Proof. by move=> u Su; rewrite /= scaler_nat rpredMn. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)