proposition: Lemma GCDP : forall d a b, d %| GCD a b = (d %| a) && (d %| b).
proof: Proof. by rewrite /GCD => d a b; apply: acc_gcdP. 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