Theorem: LO.FirstOrder.Semiformula.lMap_univClosure (Logic/FirstOrder/Basic/Syntax/Formula.lean)

State before:
L✝ : Language
ξ✝ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_2
Φ : L₁ →ᵥ L₂
p : Semiformula L₁ ξ n
⊢ (lMap Φ) (∀* p) = ∀* (lMap Φ) p
Tactic:
induction n <;> simp [*, univClosure_succ]
State after:
no goals