Theorem: LO.FirstOrder.Rew.bex (Logic/FirstOrder/Basic/Syntax/Rew.lean)

State before:
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ₁ : Type u_2
ξ₂ : Type u_3
ξ₃ : Type u_4
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
ω : Rew L ξ₁ n₁ ξ₂ n₂
p q : Semiformula L ξ₁ (n₁ + 1)
⊢ ω.hom (∃[p] q) = ∃[ω.q.hom p] ω.q.hom q
Tactic:
simp[bex_eq]
State after:
no goals