no goals
L : Language
α : Type w
V : Type w'
n : ℕ
inst✝ : Structure Language.graph V
⊢ V ⊨ Theory.simpleGraph ↔ (Irreflexive fun x y => RelMap adj ![x, y]) ∧ Symmetric fun x y => RelMap adj ![x, y]
simp [Theory.simpleGraph]