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

State before:
α : Sort ?u.162721
inst✝ : Inhabited α
F : Frame
⊢ GeachConfluent { i := 1, j := 1, m := 0, n := 0 } F ↔ Functional F.Rel
Tactic:
simp [GeachConfluent, Functional]
State after:
α : Sort ?u.162721
inst✝ : Inhabited α
F : Frame
⊢ (∀ {x y z : F.World}, x ≺ y → x ≺ z → z = y) ↔ ∀ ⦃w₁ w₂ w₃ : F.World⦄, F.Rel w₁ w₂ → F.Rel w₁ w₃ → w₂ = w₃

State before:
α : Sort ?u.162721
inst✝ : Inhabited α
F : Frame
⊢ (∀ {x y z : F.World}, x ≺ y → x ≺ z → z = y) ↔ ∀ ⦃w₁ w₂ w₃ : F.World⦄, F.Rel w₁ w₂ → F.Rel w₁ w₃ → w₂ = w₃
Tactic:
aesop
State after:
no goals