proposition: Lemma natr_Zp (x : 'I_p) : x%:R = x.
proof: Proof. by rewrite Zp_nat valZpK. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool choice eqtype ssrnat seq div) mathcomp(fintype bigop finset prime fingroup) mathcomp(ssralg finalg countalg)