Theorem: LO.Modal.Standard.reducible_KD_KT (Logic/Modal/Standard/Kripke/Geach/Reducible.lean)

State before:
α : Type u
inst✝¹ : DecidableEq α
inst✝ : Inhabited α
⊢ 𝐊𝐃 ≤ₛ 𝐊𝐓
Tactic:
apply reducible_of_geach_defnability
State after:
case hs
α : Type u
inst✝¹ : DecidableEq α
inst✝ : Inhabited α
⊢ ∀ {F : Frame},
    MultiGeachConfluent (DeductionParameter.IsGeach.taples 𝐊𝐓) F →
      MultiGeachConfluent (DeductionParameter.IsGeach.taples 𝐊𝐃) F

State before:
case hs
α : Type u
inst✝¹ : DecidableEq α
inst✝ : Inhabited α
⊢ ∀ {F : Frame},
    MultiGeachConfluent (DeductionParameter.IsGeach.taples 𝐊𝐓) F →
      MultiGeachConfluent (DeductionParameter.IsGeach.taples 𝐊𝐃) F
Tactic:
simp_all [serial_of_refl]
State after:
no goals