proposition: Theorem eqp_refl : reflexive _ eqP.
proof: Proof. Proof using plusA multA minusA invA divA cs A1 A0. red in |- *. intros x; elim x; auto. intros a l H; change (eqP (pX a l) (pX a l)) in |- *; apply eqpP1; auto. Qed.
imports: Coq(Arith Compare_dec)