Definition eqPf :
  forall pq, {eqP (fst pq) (snd pq)} + {~ eqP (fst pq) (snd pq)}.Definition seqP : poly A0 eqA ltM -> poly A0 eqA ltM -> Prop.

(* Specifications: *)
Theorem seqp_dec : forall p q : poly A0 eqA ltM, {seqP p q} + {~ seqP p q}.
Theorem seqp_refl : reflexive (poly A0 eqA ltM) seqP.
Theorem seqp_sym : symmetric (poly A0 eqA ltM) seqP.
Theorem seqp_trans : transitive (poly A0 eqA ltM) seqP.