Theorem: LO.FirstOrder.Semiformula.eval_map (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
n₁ : ℕ
b : Fin n₁ → Fin n₂
f : μ₁ → μ₂
e : Fin n₂ → M
ε : μ₂ → M
p : Semiformula L μ₁ n₁
⊢ (Eval s e ε) ((Rew.map b f).hom p) ↔ (Eval s (e ∘ b) (ε ∘ f)) p
Tactic:
simp [eval_rew, Function.comp]
State after:
no goals