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

State before:
L : Language
ξ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p q : Semiformula L ξ n
⊢ q.complexity ≠ (p ⋎ q).complexity
Tactic:
simp
State after:
no goals