proposition: Fact fol_vars_quant q A : fol_vars (fol_quant q A) = flat_map (fun n => match n with 0 => nil | S n => n::nil end) (fol_vars A).
proof: Proof. trivial. Qed.
imports: List Arith Lia 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) Undecidability.Shared.ListAutomation