proposition: Theorem BPCP_BPCP_problem_eq R : BPCP_problem R <-> BPCP R.
proof: Proof. split; intros (u & Hu). + constructor 1 with u; auto. + exists u; auto. Qed.
imports: List Undecidability.Synthetic(Definitions ReducibilityFacts InformativeDefinitions InformativeReducibilityFacts) Undecidability.PCP(PCP) Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.FOL.TRAKHTENBROT(notations bpcp fo_sig fo_terms fo_logic fo_sat Sig_discrete Sig_noeq )