proposition: Lemma mulrS x n : x *+ n.+1 = x + x *+ n.
proof: Proof. by case: n => //=; rewrite addr0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)