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

State before:
α : Type u
α₁ : Type u₁
α₂ : Type u₂
α₃ : Type u₃
p q : Formula α
h : p.complexity ≠ q.complexity
⊢ p ≠ q
Tactic:
rintro rfl
State after:
α : Type u
α₁ : Type u₁
α₂ : Type u₂
α₃ : Type u₃
p : Formula α
h : p.complexity ≠ p.complexity
⊢ False

State before:
α : Type u
α₁ : Type u₁
α₂ : Type u₂
α₃ : Type u₃
p : Formula α
h : p.complexity ≠ p.complexity
⊢ False
Tactic:
contradiction
State after:
no goals