proposition: Theorem stable_trans : forall Q y R : list (poly A0 eqA ltM), stable Q y -> stable y R -> stable Q R.
proof: Proof. intros Q y R H' H'0; inversion H'; inversion H'0; auto. Qed.
imports: Coq(Arith Inclusion Inverse_Image Wf_nat Relation_Definitions) Coq(Relation_Operators Lexicographic_Product) Buchberger(Relation_Operators_compat LetP)