intros a b; case a; case b; simpl in |- *; auto.
intros x c x0 H' Q H'0 H'1.
apply
CombLinear_trans1
with
(R := addEnd
(exist (fun l : list (Term A n) => canonical A0 eqA ltM l) x c) Q)
(b := exist (fun l : list (Term A n) => canonical A0 eqA ltM l) x c);
auto.
Qed.

Theorem Cb_incl :
forall (a : poly A0 eqA ltM) (P Q : list (poly A0 eqA ltM)),
(forall a : poly A0 eqA ltM, In a P -> In a Q) -> Cb a P -> Cb a Q.