proposition: Lemma mulr_gcdl a b c : gcdr a b * c %= gcdr (a * c) (b * c).
proof: Proof. by rewrite eqd_sym gcdr_mul2r. 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