proposition: Corollary gen_dec C : decidable (gen C).
proof: Proof. case: (gen_completeness C) => [|H]; first by left. right => /gen_correctness. apply. exact: ex_fc. Qed.
imports: Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.K(K_def demo)