Theorem: LO.Modal.Standard.Kripke.GeachConfluent.serial_def (Logic/Modal/Standard/Kripke/Geach/Definability.lean)

State before:
α : Sort ?u.505
inst✝ : Inhabited α
F : Frame
⊢ GeachConfluent { i := 0, j := 0, m := 1, n := 1 } F ↔ Serial F.Rel
Tactic:
simp [GeachConfluent, Symmetric]
State after:
α : Sort ?u.505
inst✝ : Inhabited α
F : Frame
⊢ (∀ {x : F.World}, ∃ u, x ≺ u) ↔ Serial F.Rel

State before:
α : Sort ?u.505
inst✝ : Inhabited α
F : Frame
⊢ (∀ {x : F.World}, ∃ u, x ≺ u) ↔ Serial F.Rel
Tactic:
aesop
State after:
no goals