Definition tmults : Term A n -> list (Term A n) -> list (Term A n).

Theorem mults_comp : forall (a b : Term A n) (p q : list (Term A n)), eqTerm (A:=A) eqA (n:=n) a b -> eqP A eqA n p q -> eqP A eqA n (mults a p) (mults b q).