Theorem: Digraph.Walk.subset_support_append_right (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 q ⊆ support (append p q)
Tactic:
intro h
State after:
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
h : V
⊢ h ∈ support q → h ∈ support (append p q)

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
h : V
⊢ h ∈ support q → h ∈ support (append p q)
Tactic:
simp (config := { contextual := true }) only [mem_support_append_iff, or_true_iff, imp_true_iff]
State after:
no goals