Theorem: LO.FirstOrder.Semiformula.qr_imply (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
⊢ (p ⟶ q).qr = max p.qr q.qr
Tactic:
simp[imp_eq]
State after:
no goals