Theorem: Digraph.Walk.rotate_edges (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 : V
c : Walk G v v
h : u ∈ support c
⊢ edges (rotate c h) ~r edges c
Tactic:
simp only [rotate, edges_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 : V
c : Walk G v v
h : u ∈ support c
⊢ (edges (dropUntil c u h) ++ edges (takeUntil c u h)) ~r edges c

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 : V
c : Walk G v v
h : u ∈ support c
⊢ (edges (dropUntil c u h) ++ edges (takeUntil c u h)) ~r edges c
Tactic:
apply List.IsRotated.trans List.isRotated_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 : V
c : Walk G v v
h : u ∈ support c
⊢ (edges (takeUntil c u h) ++ edges (dropUntil c u h)) ~r edges c

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 : V
c : Walk G v v
h : u ∈ support c
⊢ (edges (takeUntil c u h) ++ edges (dropUntil c u h)) ~r edges c
Tactic:
rw [← edges_append, take_spec]
State after:
no goals