proposition: Lemma dvd0r a : (0 %| a) = (a == 0) :> bool.
proof: Proof. apply/idP/idP; last by move/eqP->. by case/dvdrP=> x; rewrite mulr0=> ->. 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