proposition: Lemma XM_required : (forall s, prv s -> forall (M : sts) (w : M), satisfies s w) -> XM.
proof: Proof. exact: XM_required. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.CTL(CTL_def dags demo agreement hilbert hilbert_ref hilbert_LS hilbert_Eme90) CompDecModal.CTL(gen_def gen_dec gen_hsound gen_ref)