Program Definition exactly {A} `{ageable A} (x: A) : pred A := necR x.
Next Obligation.
constructor 3 with a; auto.
constructor 1; auto.
Qed.

Lemma exp_andp2 {A} `{HA: ageable A}:
forall B p (q: B -> pred A), (p && exp q)%pred = (exp (fun x => p && q x))%pred.