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. set F := ssub (s^+). have ? := @sfc_ssub (s^+). case: (@pruning_completeness F _ [fset s^+]) => //. - by rewrite powersetE fsub1 ssub_refl. - move => /href_of H. left. rewrite /ref in H. rewrite <- af1p in H. exact: H. - move => H. right. move: H => [M] [w] /(_ (s^+) (fset11 _)) /= ? S. exists M; last by exists w. apply: leq_trans S _. by rewrite leq_exp2l ?size_ssub. Qed.
imports: Relations Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def demo)