intros Q p q H' H'0 H'1; inversion H'1; auto.
apply CombLinear_reducestar with (q := q); auto.
rewrite <- H; auto.
Qed.
Inductive Grobner (Q : list (poly A0 eqA ltM)) : Prop :=
Grobner0 :
(forall p q : list (Term A n),
CombLinear Q p ->
reducestar A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec Q
p q -> eqP A eqA n q (pO A n)) -> Grobner Q.

Theorem Grobner_imp_SpolyQ :
forall Q : list (poly A0 eqA ltM),
Grobner Q ->
SpolyQ A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec Q.