proposition: Lemma modZp x : x %% p = x.
proof: Proof. by rewrite modn_small ?ltn_ord. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool choice eqtype ssrnat seq div) mathcomp(fintype bigop finset prime fingroup) mathcomp(ssralg finalg countalg)