proposition: Theorem ltT_not_refl : forall x : Term A n, ~ ltT x x.
proof: Proof. Proof using os. intros x; unfold ltT in |- *; apply ltM_nonrefl with (1 := os). Qed.
imports: Coq(Lexicographic_Exponentiation Relation_Definitions) Coq(Inverse_Image Inclusion List Relation_Operators) Buchberger(Relation_Operators_compat Monomials) Buchberger(Term CoefStructure OrderStructure)