proposition: Lemma gen_completeness C : gen (C,aVoid) + (exists M : fmodel, sat M C).
proof: Proof. exact: gen_completeness. Qed.
imports: Relations Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def demo hilbert_ref gen_def gen_ref)