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

Theorem redacc_divp : forall (L1 L2 : list (poly A0 eqA ltM)) (p : poly A0 eqA ltM), ~ zerop A A0 eqA n ltM p -> In p (L1 ++ L2) -> exists q : poly A0 eqA ltM, In q (redacc L1 L2 ++ L2) /\ divp A A0 eqA multA divA n ltM p q /\ ~ zerop A A0 eqA n ltM q.