proposition: Lemma mod_eq0 a b : (a %% b == 0) = (b %| a).
proof: Proof. exact: (Dvd.mod_eq0 norm_mul edivP). Qed.
imports: HB(structures) Coq(ssreflect ssrfun ssrbool Arith.Wf_nat) mathcomp(eqtype ssrnat div seq path) mathcomp(ssralg fintype perm tuple choice generic_quotient) mathcomp(matrix bigop zmodp mxalgebra poly) stronglydiscrete