proposition: 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).
proof: Proof. Proof using plusA minusA invA eqA_dec cs A1. intros a H' p; elim p; simpl in |- *; auto. Qed.