proposition: Lemma EF_strengthen (p1 p2 : X -> Prop) w : (forall v, p1 v -> p2 v) -> cEF p1 w -> cEF p2 w.
proof: Proof. move => H1. elim => {w} - w; first by move => ?; apply EF0; auto. move => v wv ? IH. by apply: EFs ; auto. Qed.
imports: Relations mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype)