proposition: Lemma odivr_mulKr a b : a != 0 -> a * b %/? a = Some b.
proof: Proof. by move=> a0; rewrite mulrC odivr_mulrK. 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