proposition: Theorem reducestar_trans : forall (Q : list (poly A0 eqA ltM)) (x y z : list (Term A n)), canonical A0 eqA ltM x -> reduceplus A A0 A1 eqA invA minusA multA divA eqA_dec n ltM ltM_dec Q x y -> reducestar Q y z -> reducestar Q x z.
proof: Proof. Proof using plusA os cs. intros Q x y z H' H'0 H'1; inversion H'1. apply reducestar0; auto. apply reduceplus_trans with (1 := cs) (y := y); auto. Qed.