proposition: Lemma Qdiv_lazy_Qdiv : forall (x y : Q) (Hy : y <> Zero), Qdiv_lazy x y Hy = Qdiv x y.
proof: Proof. intros x y Hy. unfold Qdiv_lazy in |- *. rewrite quadratic in |- *. unfold spec_q in |- *. change (Z_to_Q 1) with Qone in |- *. unfold Z_to_Q in |- *. field. trivial. Defined.
imports: Coq(Eqdep_dec)