(** Proof independence of Qquadratic_Qpositive_to_Qpositive: *)

Scheme quadraticAcc_ind_dep := Induction for quadraticAcc Sort Prop.

Lemma Qquadratic_Qpositive_to_Qpositive_1 : forall (a b c d e f g h : Z) (p1 p2 : Qpositive) (hyp : quadraticAcc a b c d e f g h p1 p2), p1 <> One -> p2 <> One -> quadratic_top_more a b c d e f g h -> forall hyp_rec : quadraticAcc (a - e) (b - f) (c - g) (d - h) e f g h p1 p2, Qquadratic_Qpositive_to_Qpositive a b c d e f g h p1 p2 hyp = nR (Qquadratic_Qpositive_to_Qpositive (a - e) (b - f) (c - g) (d - h) e f g h p1 p2 hyp_rec).