Definition Dmult :
  forall (a : Term A n) (nZa : ~ zeroP (A:=A) A0 eqA (n:=n) a),
  list (Term A n) -> list (Term A n) -> list (Term A n).

Theorem divPp_mults1 : forall a : Term A n, ~ zeroP (A:=A) A0 eqA (n:=n) a -> forall p : list (Term A n), (forall b : Term A n, In b p -> ~ zeroP (A:=A) A0 eqA (n:=n) b) -> divPp a (mults (A:=A) multA (n:=n) a p).