Definition Red (L : list (poly A0 eqA ltM)) : list (poly A0 eqA ltM) :=
  redacc L nil.

Theorem Red_grobner : forall L : list (poly A0 eqA ltM), Grobner A A0 A1 eqA plusA invA minusA multA divA eqA_dec n ltM ltM_dec L -> Grobner A A0 A1 eqA plusA invA minusA multA divA eqA_dec n ltM ltM_dec (Red L).