proposition: Lemma submodClosedP (modS : submodClosed V) : submod_closed modS.
proof: Proof. split; first exact rpred0D.1. by move=> a u v uS vS; apply: rpredD; first exact: rpredZ. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)