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

Theorem mults_invTerm : forall (p : list (Term A n)) (a : Term A n), eqTerm (A:=A) eqA (n:=n) a (T1 A1 n) -> eqP A eqA n (pluspf (A:=A) A0 (eqA:=eqA) plusA eqA_dec (n:=n) (ltM:=ltM) ltM_dec p (mults (invTerm (A:=A) invA (n:=n) a) p)) (pO A n).