proposition: Lemma DD_sat u L : u \in Fs DD -> L \in DD -> exists (M : fmodel) (w : M), forall s : sform, L |> s -> eval (interp' s) w.
proof: Proof. move => inFs inD. case: (DD_small_model inFs inD) => M _ ?. by exists M. Qed.
imports: Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base sltype) CompDecModal.CTL(CTL_def dags demo)