proposition: Lemma eqd_trans : transitive (@eqd R).
proof: Proof. move=> a b c; rewrite !eqd_def; case/andP=> ba ab; case/andP=> ac ca. by rewrite (dvdr_trans ba) // (dvdr_trans ca). 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