proposition: Lemma eqd_lcml a b c : a %= b -> lcmr c a %= lcmr c b.
proof: Proof. move=> Hab. rewrite (eqd_trans (lcmrC _ _)) // (eqd_trans _ (lcmrC _ _)) //. by rewrite eqd_lcmr // eqd_sym. 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