proposition: Lemma modz1 m : (m %% 1)%Z = 0.
proof: Proof. by case: m => n; rewrite (modNz_nat, modz_nat) ?modn1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq path) mathcomp(div choice fintype tuple finfun bigop prime order) mathcomp(ssralg poly ssrnum ssrint archimedean rat matrix) mathcomp(polydiv perm zmodp mxalgebra vector)