Theorem: LO.FirstOrder.Semiformula.eval_toS (Logic/FirstOrder/Basic/Semantics/Semantics.lean)

State before:
n₂ : ℕ
L : Language
μ : Type v
μ₁ : Type v₁
μ₂ : Type v₂
M : Type w
s : Structure L M
n : ℕ
e✝ : Fin n → M
e₂ : Fin n₂ → M
ε✝ : μ → M
ε₂ : μ₂ → M
e : Fin n → M
ε : Empty → M
p : Formula L (Fin n)
⊢ (Eval s e ε) (Rew.toS.hom p) ↔ (Eval s ![] e) p
Tactic:
simp [Rew.toS, eval_rew, Function.comp, Matrix.empty_eq]
State after:
no goals