intros a1 m1 a2 m2 H1; case H1; intros H2 H3; auto.
rewrite H3; auto.
unfold eqT in |- *; simpl in |- *; apply sym_eq; unfold M1 in |- *;
apply mult_mon_zero_l.
Qed.

Theorem eqTerm_T1_eqT : forall a : Term, eqTerm a T1 -> eqT a T1.
intros a; case a; simpl in |- *; auto.