intros a b nZb H'0 H'1; auto.
apply divP_eqT with (a := multTerm (A:=A) multA (n:=n) (divTerm a nZb) b);
auto.
apply (eqT_sym A n); auto.
Qed.
Hint Resolve eqT_nzero_divP.

Theorem eqT_nzero_eqT_divP :
forall (a b c : Term A n) (nZb : ~ zeroP (A:=A) A0 eqA (n:=n) b),
eqT c (multTerm (A:=A) multA (n:=n) (divTerm c nZb) b) ->
~ zeroP (A:=A) A0 eqA (n:=n) a -> eqT a c -> divP a b.