proposition: Theorem genPcP_incl : forall (i : poly A0 eqA ltM) (L L1 L2 : list _), genPcP i L1 L L2 -> incl L L2.
proof: Proof. intros i L L1 L2 H'; elim H'; simpl in |- *; auto with datatypes. intros L0 L3 L4 L5 a i0 H'0 H'1 H'2. unfold incl in |- *; simpl in |- *; auto. Qed.
imports: Coq(Arith Inclusion Inverse_Image Wf_nat Relation_Definitions) Coq(Relation_Operators Lexicographic_Product) Buchberger(Relation_Operators_compat LetP)