proposition: Lemma rpredD : {in S &, forall u v, u + v \in S}.
proof: Proof. by case: (@rpred0D _ S). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)