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.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.

(* Specifications: *)
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.