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

Theorem Red_divp : forall (L : list (poly A0 eqA ltM)) (p : poly A0 eqA ltM), In p L -> ~ zerop A A0 eqA n ltM p -> exists q : poly A0 eqA ltM, In q (Red L) /\ divp A A0 eqA multA divA n ltM p q /\ ~ zerop A A0 eqA n ltM q.