proposition: Theorem FIN_DEC_EQ_SAT_FIN_DEC_SAT : FSATEQ e He ⪯ᵢ FSAT Σ.
proof: Proof. exists (fun A => Σ_noeq (fol_syms A) (e::fol_rels A) _ He A). intros A; split. + intros (X & HX); exists X; revert HX. apply Σ_noeq_sound. + apply Σ_noeq_complete; cbv; 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 )