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

Theorem Red_cb : forall (L : list (poly A0 eqA ltM)) (p : poly A0 eqA ltM), In p (Red L) -> Cb A A0 eqA plusA multA eqA_dec n ltM ltM_dec p L.