proposition: Lemma mulrn_char x : x *+ p = 0.
proof: Proof. by rewrite -mulr_natl charf0 mul0r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)