proposition: Theorem Cb_trans_cons : forall (L : list (poly A0 eqA ltM)) (p q : poly A0 eqA ltM), Cb A A0 eqA plusA multA eqA_dec n ltM ltM_dec q (p :: L) -> Cb A A0 eqA plusA multA eqA_dec n ltM ltM_dec p L -> Cb A A0 eqA plusA multA eqA_dec n ltM ltM_dec q L.
proof: Proof. Proof using os minusA invA divA cs A1. intros L p q H H0. apply Cb_trans with (1 := cs) (b := p); auto. apply Cb_cons_addEnd; auto. Qed.
imports: Buchberger(Buch)