proposition: Theorem reducestar_cb1 : forall (a : poly A0 eqA ltM) (b : list (Term A n)) (Q : list (poly A0 eqA ltM)), reducestar A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec Q (s2p A A0 eqA n ltM a) b -> CombLinear (a :: Q) b.
proof: Proof. Proof using os cs. intros a b Q H'; inversion H'; auto. apply reduceplus_cb1; auto. Qed.