intros L p H' H'0.
lapply (redacc_divp L nil p); auto.
simpl in |- *; auto.
rewrite <- app_nil_end; auto.
rewrite <- app_nil_end; auto.
Qed.

(* Specifications: *)
Theorem red_grobner : forall L : list poly, grobner L -> grobner (red L).
intros L H'.
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).