proposition: Theorem informative_completeness s : prv (fImp s fF) + (exists2 M:fmodel, #|M| <= 2^(2 * f_size s) & exists w:M, eval s w).
proof: Proof. exact: informative_completeness s. 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)