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

State before:
V✝ : Type u
V' : Type v
V'' : Type w
G✝ : Digraph V✝
G' : Digraph V'
G'' : Digraph V''
V : Type u
G : Digraph V
u v w : V
p : Walk G u v
q : Walk G v w
⊢ support p ⊆ support (append p q)
Tactic:
simp only [Walk.support_append, List.subset_append_left]
State after:
no goals