Definition Cb : poly A0 eqA ltM -> list (poly A0 eqA ltM) -> Prop.

Theorem inPolySet_addEnd : forall (a : list (Term A n)) (p : poly A0 eqA ltM) (l : list (poly A0 eqA ltM)), inPolySet A A0 eqA n ltM a (addEnd p l) -> a = s2p A A0 eqA n ltM p \/ inPolySet A A0 eqA n ltM a l.