unfold eqT in |- *; unfold ltT in |- *; intros a b c H; rewrite H; auto.
Qed.

(* Specifications: *)
Lemma eqT_compat_ltTl :
forall a b c : Term A n, eqT b c -> ltT b a -> ltT c a.
Theorem eqT_dec : forall x y : Term A n, {eqT x y} + {~ eqT x y}.
intros x y; unfold eqT in |- *; simpl in |- *; auto.