Theorem: LO.FirstOrder.Completeness.semanticMainLemmaTop (Logic/FirstOrder/Completeness/SearchTree.lean)

State before:
L : Language
inst✝³ : (k : ℕ) → DecidableEq (L.Func k)
inst✝² : (k : ℕ) → DecidableEq (L.Rel k)
inst✝¹ : (k : ℕ) → Encodable (L.Func k)
inst✝ : (k : ℕ) → Encodable (L.Rel k)
T : Theory L
Γ : Sequent L
nwf : ¬WellFounded (SearchTree.Lt T Γ)
p : SyntacticFormula L
h : p ∈ Γ
⊢ p ∈ {x | x ∈ ⛓️[0]}
Tactic:
simp[chain, chainU, h]
State after:
no goals