Theorem: LO.FirstOrder.Semiformula.ne_of_ne_complexity (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
h : p.complexity ≠ q.complexity
⊢ p ≠ q
Tactic:
rintro rfl
State after:
L : Language
ξ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p : Semiformula L ξ n
h : p.complexity ≠ p.complexity
⊢ False

State before:
L : Language
ξ : Type u_1
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p : Semiformula L ξ n
h : p.complexity ≠ p.complexity
⊢ False
Tactic:
contradiction
State after:
no goals