proposition: Lemma Fp_nat_mod m : (m %% p)%:R = m%:R :> 'F_p.
proof: Proof. by apply: ord_inj; rewrite !val_Fp_nat // modn_mod. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool choice eqtype ssrnat seq div) mathcomp(fintype bigop finset prime fingroup) mathcomp(ssralg finalg countalg)