intros Q H'0.
apply ConfluentReduce0.
intros p H'1.
change
(ReduStarConfluent A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec
Q (s2p A A0 eqA n ltM (mks A A0 eqA n ltM p H'1)))
in |- *.
apply confl_restar with (1 := cs); auto.
Qed.

Theorem ConfluentReduce_imp_Grobner :
forall Q : list (poly A0 eqA ltM), ConfluentReduce Q -> Grobner Q.