Theorem: LO.FirstOrder.Semiformula.lMapAux_neg (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₂
n : ℕ
p : Semiformula L₁ ξ n
⊢ lMapAux Φ (~p) = ~lMapAux Φ p
Tactic:
induction p using Semiformula.rec' <;> simp[*, lMapAux, ←Semiformula.neg_eq]
State after:
no goals