Theorem: LO.Propositional.Classical.Formula.complexity_neg (Logic/Propositional/Classical/Basic/Formula.lean)

State before:
α : Type u
α₁ : Type u₁
α₂ : Type u₂
α₃ : Type u₃
p : Formula α
⊢ (~p).complexity = p.complexity
Tactic:
induction p using rec' <;> simp[*]
State after:
no goals