proposition: Lemma mulr0 : right_zero zero mul.
proof: Proof. by move=> x; rewrite mulrC mul0r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)