intros a b; case a; case b; simpl in |- *; auto.
intros a0 m a1 m0 nZ1 nZ2.
rewrite divA_rew with (1 := cs) (nZ2 := nZ2); auto.
Qed.
Inductive divP : Term A n -> Term A n -> Prop :=
divTerm_def :
forall a b : Term A n,
~ zeroP (A:=A) A0 eqA (n:=n) a ->
forall nZb : ~ zeroP (A:=A) A0 eqA (n:=n) b,
eqTerm (A:=A) eqA (n:=n) a
(multTerm (A:=A) multA (n:=n) (divTerm a nZb) b) ->
divP a b.

Theorem divP_inv1 :
forall a b : Term A n, divP a b -> ~ zeroP (A:=A) A0 eqA (n:=n) a.