Theorem: LO.Modal.Standard.Formula.imp_inj (Logic/Modal/Standard/Formula.lean)

State before:
α : Type u
p₁ q₁ p₂ q₂ : Formula α
⊢ p₁ ⟶ p₂ = q₁ ⟶ q₂ ↔ p₁ = q₁ ∧ p₂ = q₂
Tactic:
simp[Arrow.arrow]
State after:
no goals