Definition gcdZ (a b : Z) := pi1 Z (is_gcdZ a b) (gcdZ_exists a b).

(* Specifications: *)
Theorem gcdZ_correct : forall a b : Z, is_gcdZ a b (gcdZ a b).
Lemma positive_is_gcdZ : forall a b d : Z, is_gcdZ a b d -> (0 <= d)%Z.
Lemma unicity_is_gcdZ :
forall a b c d : Z, is_gcdZ a b c -> is_gcdZ a b d -> d = c.
Lemma gcdZ_is_gcdZ : forall a b d : Z, is_gcdZ a b d -> d = gcdZ a b.
Lemma gcd_modZ :
forall a b q r : Z,
b <> 0%Z -> (0 <= r < Zabs b)%Z -> a = (b * q + r)%Z -> gcdZ r b = gcdZ b a.