proposition: Lemma Σbpcp_model_interpreted x y : fom_rels Σbpcp_model Σbpcp_eq (x##y##ø) <-> x = y.
proof: Proof. reflexivity. Qed.
imports: List Arith Bool Lia Undecidability.PCP(PCP Util.PCP_facts) Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite) Undecidability.FOL.TRAKHTENBROT(notations utils bpcp fol_ops fo_sig fo_terms fo_logic fo_sat)