Theorem: LO.Modal.Standard.GoedelTranslation.neg_def' (Logic/Modal/Standard/Kripke/ModalCompanion.lean)

State before:
α : Type u_1
inst✝² : DecidableEq α
inst✝¹ : Inhabited α
inst✝ : Encodable α
p q : Superintuitionistic.Formula α
⊢ (~p)ᵍ = □~pᵍ
Tactic:
simp [GoedelTranslation, NegAbbrev.neg]
State after:
no goals