proposition: Lemma modz_small m d : 0 <= m < d -> (m %% d)%Z = m.
proof: Proof. by case: m d => //= m [] // d; rewrite modz_nat => /modn_small->. 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)