Theorem: LO.Modal.Standard.Formula.TrivTranslation.back (Logic/Modal/Standard/Maximal.lean)

State before:
α : Sort ?u.34638
inst✝ : DecidableEq α
α✝ : Type u_1
p : Formula α✝
⊢ (pᵀᴾ) ⋯ᴹ = pᵀ
Tactic:
induction p using rec' <;> simp [Superintuitionistic.Formula.toModalFormula, TrivTranslation, *]
State after:
no goals