intros a0 b0 c0 H'0 H'1 H'2 H'3.
replace b0 with (b0 - a0); auto.
rewrite H'3; auto with arith.
intros a0 b0 c0 H'0 H'1 H'2 H'3.
apply H'2; auto.
rewrite H'3; auto.
Qed.

(* Specifications: *)
Theorem gcd_inv_Ol : forall a b : nat, gcd_spec 0 a b -> a = b.
intros a b H'.