proposition: Lemma modr0 a : a %% 0 = a.
proof: Proof. by case: edivP=> q r; rewrite mulr0 add0r=> ->. 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