proposition: Lemma funsat2 (M : fmodel) C C1 C2 a : (forall w:M, satC w C -> satC w C1 || satC w C2) -> funsat M (C1,a) -> funsat M (C2,a) -> funsat M (C,a).
proof: Proof. move => H U1 U2 [w] [/= w1 w2]. case/orP: (H _ w1) => Hw; [apply U1|apply U2]; by exists w. Qed.
imports: Relations mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def)