proposition: Lemma coprimezMr p m n : coprimez p (m * n) = coprimez p m && coprimez p n.
proof: Proof. by rewrite -coprimeMr -abszM. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq path) mathcomp(div choice fintype tuple finfun bigop prime order) mathcomp(ssralg poly ssrnum ssrint archimedean rat matrix) mathcomp(polydiv perm zmodp mxalgebra vector)