intros a b; case a; case b; simpl in |- *; auto.
Qed.

(* Specifications: *)
Theorem plusTerm_eqT1 :
forall m1 m2 : Term, eqT m1 m2 -> eqT (plusTerm m1 m2) m1.
Theorem plusTerm_eqT2 :
forall m1 m2 : Term, eqT m1 m2 -> eqT (plusTerm m1 m2) m2.
Theorem plusTerm_assoc :
forall a a0 A1 : Term,
eqT A1 a0 ->
eqT a a0 ->
eqTerm (plusTerm (plusTerm A1 a0) a) (plusTerm A1 (plusTerm a0 a)).
Theorem zeroP_minusTerm : forall a : Term, zeroP (minusTerm a a).
intros a; apply zeroP_comp_eqTerm with (a := plusTerm a (invTerm a)); auto.
Theorem divTerm_rew :
forall (a b : Term A n) (nZ1 nZ2 : ~ zeroP (A:=A) A0 eqA (n:=n) b),
divTerm a nZ1 = divTerm a nZ2.