Theorem: Digraph.Walk.mem_support_nil_iff (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
u v : V
⊢ u ∈ support nil ↔ u = v
Tactic:
simp
State after:
no goals