Theorem: LO.FirstOrder.Rew.emb_univClosure (Logic/FirstOrder/Basic/Syntax/Rew.lean)

State before:
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ₁ : Type u_2
ξ₂ : Type u_3
ξ₃ : Type u_4
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
o : Type u_5
e : IsEmpty o
σ : Semiformula L o n
⊢ emb.hom (∀* σ) = ∀* emb.hom σ
Tactic:
induction n <;> simp[*, univClosure_succ]
State after:
no goals