intros a b; case a; case b; unfold eqT in |- *; simpl in |- *; auto.
intros b2 c b3 c0 H' H'0 H'1; rewrite H'1; auto.
rewrite mult_div_id; auto.
Qed.

Theorem divTerm_on_plusM_minusM :
forall a b : Term A n,
~ zeroP (A:=A) A0 eqA (n:=n) a ->
forall nZb : ~ zeroP (A:=A) A0 eqA (n:=n) b,
T2M a = mult_mon n (div_mon n (T2M a) (T2M b)) (T2M b) ->
eqTerm (A:=A) eqA (n:=n) a (multTerm (A:=A) multA (n:=n) (divTerm a nZb) b).