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

State before:
α : Sort ?u.119900
inst✝ : Inhabited α
F : Frame
⊢ GeachConfluent { i := 1, j := 1, m := 0, n := 1 } F ↔ Euclidean F.Rel
Tactic:
simp [GeachConfluent, Euclidean]
State after:
no goals