proposition: Lemma Zp_mul1z : left_id Zp1 Zp_mul.
proof: Proof. by move=> x; apply: val_inj; rewrite /= modnMml mul1n modZp. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool choice eqtype ssrnat seq div) mathcomp(fintype bigop finset prime fingroup) mathcomp(ssralg finalg countalg)