Theorem: LO.FirstOrder.Semiterm.val_bShift' (Logic/FirstOrder/Basic/Semantics/Semantics.lean)

State before:
n n₁ n₂ : ℕ
L : Language
μ : Type v
μ₁ : Type v₁
μ₂ : Type v₂
M : Type w
s : Structure L M
e✝ : Fin n → M
e₁ : Fin n₁ → M
e₂ : Fin n₂ → M
ε : μ → M
ε₁ : μ₁ → M
ε₂ : μ₂ → M
e : Fin (n + 1) → M
t : Semiterm L μ n
⊢ val s e ε (Rew.bShift t) = val s (fun x => e x.succ) ε t
Tactic:
simp [val_rew, Function.comp]
State after:
no goals