Theorem: LO.FirstOrder.Semiformula.eval_shift (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
ε : ℕ → M
a : M
p : SyntacticSemiformula L n
⊢ (Eval s e (a :>ₙ ε)) ((Rew.hom ⇑) p) ↔ (Eval s e ε) p
Tactic:
simp [eval_rew, Function.comp]
State after:
no goals