Theorem: LO.FirstOrder.Semiformula.univItr_inj (Logic/FirstOrder/Basic/Syntax/Formula.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₃ k : ℕ
p q : Semiformula L ξ (n + k)
⊢ ∀^[k] p = ∀^[k] q ↔ p = q
Tactic:
induction k <;> simp [*, univItr_succ]
State after:
no goals