intros a b p q H' H'0; elim H'0; simpl in |- *; auto.
Qed.

Theorem mults_ltP_comp :
forall (a : Term A n) (p q : list (Term A n)),
ltP (A:=A) (n:=n) ltM p q -> ltP (A:=A) (n:=n) ltM (mults a p) (mults a q).