Definition divPp : Term A n -> list (Term A n) -> Prop.Definition divpf :
  forall (a : Term A n) (nZa : ~ zeroP (A:=A) A0 eqA (n:=n) a),
  list (Term A n) -> list (Term A n).

Theorem divpf_canonical : forall (a : Term A n) (p : list (Term A n)) (nZa : ~ zeroP (A:=A) A0 eqA (n:=n) a), canonical A0 eqA ltM p -> canonical A0 eqA ltM (divpf a nZa p).