proposition: Theorem invTerm_ltT_l : forall a c, ltT a c -> ltT (invTerm invA a) c.
proof: Proof. intros a b; case a; case b; unfold ltT in |- *; simpl in |- *; auto. Qed.
imports: Coq(Lexicographic_Exponentiation Relation_Definitions) Coq(Inverse_Image Inclusion List Relation_Operators) Buchberger(Relation_Operators_compat Monomials) Buchberger(Term CoefStructure OrderStructure)