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_imp_left {A} `{agA : ageable A}:  forall B (p: B -> pred A) q,
(exp p --> q)%pred = allp (fun x => p x --> q)%pred.