proposition: Lemma dmpAR (xm : XM) w : ~ pAR R P Q w -> pEU R (PredC P) (PredC Q) w.
proof: Proof. move => H. apply: (dn xm) => H'. apply: H => pi p1 p2 n. apply: (dn xm) => C. apply: H'. exists pi. by firstorder. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert) CompDecModal.CTL(CTL_def hilbert)