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

State before:
L : Language
ξ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p : Semiformula L ξ n
⊢ (~p).qr = p.qr
Tactic:
induction' p using rec' <;> simp[*]
State after:
no goals