fact: Fixpoint fol_sem φ A : Prop := match A with | ⊥ => False | fol_atom _ v => fom_rels M _ (vec_map (fun t => ⟦t⟧ φ) v) | fol_bin b A B => fol_bin_sem b (⟪A⟫ φ) (⟪B⟫ φ) | fol_quant q A => fol_quant_sem q (fun x => ⟪A⟫ x·φ) end where "⟪ A ⟫" := (fun φ => fol_sem φ A).
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