Theorem: LO.Modal.Standard.Formula.Kripke.Satisfies.or_def (Logic/Modal/Standard/Kripke/Semantics.lean)

State before:
α : Type u_1
M : Model α
w : M.World
p q : Formula α
⊢ Satisfies M w (p ⋎ q) ↔ Satisfies M w p ∨ Satisfies M w q
Tactic:
simp [Satisfies]
State after:
no goals