Theorem: Digraph.Walk.copy_cons (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 w u' w' : V
h : G.Adj u v
p : Walk G v w
hu : u = u'
hw : w = w'
⊢ Walk.copy (cons h p) hu hw = cons (_ : G.Adj u' v) (Walk.copy p (_ : v = v) hw)
Tactic:
subst_vars
State after:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
v u' w' : V
h : G.Adj u' v
p : Walk G v w'
⊢ Walk.copy (cons h p) (_ : u' = u') (_ : w' = w') = cons (_ : G.Adj u' v) (Walk.copy p (_ : v = v) (_ : w' = w'))

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
v u' w' : V
h : G.Adj u' v
p : Walk G v w'
⊢ Walk.copy (cons h p) (_ : u' = u') (_ : w' = w') = cons (_ : G.Adj u' v) (Walk.copy p (_ : v = v) (_ : w' = w'))
Tactic:
rfl
State after:
no goals