proposition: Lemma valZpK x : inZp x = x.
proof: Proof. by apply: val_inj; rewrite /= modZp. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool choice eqtype ssrnat seq div) mathcomp(fintype bigop finset prime fingroup) mathcomp(ssralg finalg countalg)