Definition redbuch (L : list (poly A0 eqA ltM)) : list (poly A0 eqA ltM) :=
  Red
    (buch A A0 A1 eqA plusA invA minusA multA divA cs eqA_dec n ltM ltM_dec
       os L).

(* Specifications: *)
Theorem redbuch_stable : forall P : list (poly A0 eqA ltM), stable A A0 eqA plusA multA eqA_dec n ltM ltM_dec P (redbuch P).
Theorem redbuch_Grobner : forall P : list (poly A0 eqA ltM), Grobner A A0 A1 eqA plusA invA minusA multA divA eqA_dec n ltM ltM_dec (redbuch P).