Theorem: LO.FirstOrder.Semiformula.eval_bShift' (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 + 1) → M
p : Semiformula L μ n
⊢ (Eval s e' ε) (Rew.bShift.hom p) ↔ (Eval s (fun x => e' x.succ) ε) p
Tactic:
simp [eval_rew, Function.comp]
State after:
no goals