intros a b p q H'; try assumption.
rewrite (minusP_inv2 a b p q (minuspf (pX a p) (pX b q))); auto.
Qed.

(* Specifications: *)
Theorem minuspf_inv3a_eq :
forall (a b : Term A n) (p q : list (Term A n)),
eqT a b ->
zeroP (A:=A) A0 eqA (n:=n) (minusTerm (A:=A) minusA (n:=n) a b) ->
minuspf p q = minuspf (pX a p) (pX b q).
Theorem minuspf_inv3a :
forall (a b : Term A n) (p q : list (Term A n)),
eqT a b ->
zeroP (A:=A) A0 eqA (n:=n) (minusTerm (A:=A) minusA (n:=n) a b) ->
eqP A eqA n (minuspf p q) (minuspf (pX a p) (pX b q)).