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

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