proposition: Theorem fa_fun_pos_bool_decidable : decidable (forall P, K P).
proof: Proof. Proof using HK Dfa. destruct Dfa as [ H | H ]. + left. intros P; generalize (H (vec_set_pos P)). apply HK; intro; rew vec. + right; contradict H. intro; apply H. Qed.
imports: List Arith Bool Eqdep_dec Undecidability.Synthetic.Definitions Undecidability.Synthetic.ReducibilityFacts Undecidability.Synthetic.InformativeDefinitions Undecidability.Synthetic.InformativeReducibilityFacts Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.FOL.TRAKHTENBROT(notations utils fol_ops)