Theorem: SimpleGraph.empty_iff_edge_empty (Turan4/Fedges.lean)

State before:
α : Type u_1
inst✝³ : Fintype α
inst✝² : DecidableEq α
G H : SimpleGraph α
inst✝¹ : DecidableRel G.Adj
inst✝ : DecidableRel H.Adj
⊢ G = ⊥ ↔ edgeFinset G = ∅
Tactic:
rw [← edgeFinset_inj,edgeFinset_bot]
State after:
no goals