intros Q a p H'; elim H'; auto.
Qed.

Lemma pick_inv_eqT_lem :
forall (Q : list (poly A0 eqA ltM)) (a : Term A n) (p : list (Term A n)),
pickinSetp a p Q ->
forall (b : Term A n) (q : list (Term A n)),
p = pX b q -> divP A A0 eqA multA divA n a b.