proposition: Theorem BPCP_kprv : PCPb R <-> nil ⊢I (F R).
proof: Proof. rewrite PCPb_iff_dPCPb. split. - apply BPCP_prv'. - intros H % ksoundness'. rewrite <- PCPb_iff_dPCPb. now apply (BPCP_valid R), kvalid_valid. Qed.
imports: Undecidability.PCP(PCP Util.PCP_facts) Undecidability.FOL(Deduction.FragmentNDFacts Semantics.Tarski.FragmentFacts Syntax.Facts) Undecidability.FOL.Semantics.Kripke(FragmentCore FragmentSoundness FragmentToTarski) Undecidability.FOL(FOL) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ReducibilityFacts MoreReducibilityFacts) Undecidability.PCP.Reductions.PCPb_iff_dPCPb Undecidability.FOL.Reductions.PCPb_to_FOL Undecidability(Shared.ListAutomation)