intros a b H; inversion H; auto.
Qed.

(* Specifications: *)
Theorem divP_inv2 :
forall a b : Term A n, divP a b -> ~ zeroP (A:=A) A0 eqA (n:=n) b.
Theorem divP_inv3 :
forall (a b : Term A n) (nZb : ~ zeroP (A:=A) A0 eqA (n:=n) b),
divP a b ->
eqTerm (A:=A) eqA (n:=n) a (multTerm (A:=A) multA (n:=n) (divTerm a nZb) b).