intros a b; case a; case b; simpl in |- *; auto.
split; auto.
apply divA_invA_r with (1 := cs); auto.
Qed.

Theorem eqT_divTerm :
forall (a b c d : Term A n) (nZc : ~ zeroP (A:=A) A0 eqA (n:=n) c)
(nZd : ~ zeroP (A:=A) A0 eqA (n:=n) d),
eqT a b -> eqT c d -> eqT (divTerm a nZc) (divTerm b nZd).