proposition: Lemma Bezoutz m n : {u : int & {v : int | u * m + v * n = gcdz m n}}.
proof: Proof. by exists (egcdz m n).1, (egcdz m n).2; case: egcdzP. 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)