proposition: Theorem reducetop_sp : forall (Q : list (poly A0 eqA ltM)) (a b : Term A n) (nZb : ~ zeroP (A:=A) A0 eqA (n:=n) b) (p q : list (Term A n)), inPolySet (pX b q) Q -> divP A A0 eqA multA divA n a b -> reduce Q (pX a p) (spminusf A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec a b nZb p q).
proof: Proof. Proof using plusA cs. intros Q a b nZb p q H' H'0. apply reducetop with (b := b) (nZb := nZb) (q := q); auto. Qed.