intros a p q H'; elim H'; simpl in |- *; auto.
intros x y p0 q0 H'0; simpl in |- *; apply ltP_hd; auto.
apply multTerm_ltT_l with (1 := os); auto.
Qed.

Theorem multlm_comp_canonical :
forall (p : list (Term A n)) (a b : Term A n),
canonical A0 eqA ltM (pX a p) ->
~ zeroP (A:=A) A0 eqA (n:=n) b ->
canonical A0 eqA ltM (pX (multTerm (A:=A) multA (n:=n) b a) (mults b p)).