proposition: Fact fol_congruence_syms : fol_syms fol_congruence ⊑ ls.
proof: Proof. unfold fol_congruence. rewrite fol_syms_bin, fol_equivalence_syms, app_nil_r. apply fol_congruent_syms. Qed.
imports: List Arith Lia Relations 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 fo_sig fo_terms fo_logic) Undecidability.Shared.ListAutomation