Theorem: LO.FirstOrder.Semiformula.eval_embSubsts (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
k : ℕ
w : Fin k → Semiterm L μ n
σ : Semisentence L k
⊢ (Eval s e ε) ((Rew.embSubsts w).hom σ) ↔ (Evalb s fun x => Semiterm.val s e ε (w x)) σ
Tactic:
simp [eval_rew, Function.comp, Empty.eq_elim]
State after:
no goals