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

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
inst✝ : DecidableEq V
u v w : V
p : Walk G v w
h : u ∈ support p
x : V × V
hx : x ∈ edges (takeUntil p u h)
⊢ x ∈ edges p
Tactic:
rw [← take_spec p h, edges_append, List.mem_append]
State after:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
inst✝ : DecidableEq V
u v w : V
p : Walk G v w
h : u ∈ support p
x : V × V
hx : x ∈ edges (takeUntil p u h)
⊢ x ∈ edges (takeUntil p u h) ∨ x ∈ edges (dropUntil p u h)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
inst✝ : DecidableEq V
u v w : V
p : Walk G v w
h : u ∈ support p
x : V × V
hx : x ∈ edges (takeUntil p u h)
⊢ x ∈ edges (takeUntil p u h) ∨ x ∈ edges (dropUntil p u h)
Tactic:
exact Or.inl hx
State after:
no goals