Theorem: SimpleGraph.neighborSet_bot (ExponentialRamsey/Prereq/Mathlib/Combinatorics/SimpleGraph/Basic.lean)

State before:
V : Type u_1
V' : Type u_2
G : SimpleGraph V
K : Type u_3
K' : Type u_4
x : V
⊢ neighborSet ⊥ x = ∅
Tactic:
ext y
State after:
case h
V : Type u_1
V' : Type u_2
G : SimpleGraph V
K : Type u_3
K' : Type u_4
x y : V
⊢ y ∈ neighborSet ⊥ x ↔ y ∈ ∅

State before:
case h
V : Type u_1
V' : Type u_2
G : SimpleGraph V
K : Type u_3
K' : Type u_4
x y : V
⊢ y ∈ neighborSet ⊥ x ↔ y ∈ ∅
Tactic:
simp
State after:
no goals