proposition: Lemma mod0r : forall a, 0 %% a = 0.
proof: Proof. exact: (Dvd.mod0r 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