proposition: Theorem fa_fun_bool_decidable : decidable (forall P, K P).
proof: Proof. Proof using HK H2 H1 Dec. assert (H : decidable (forall P, T P)). { apply fa_fun_pos_bool_decidable; auto. } destruct H as [ H | H ]; [ left | right ]. + intros P. generalize (H (fun p => P (j p))). apply HK; intro; rewrite Hji; auto. + contradict H; intros P; 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)