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

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