Theorem: Digraph.Walk.length_transfer (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 : V
p : Walk G u v
H : Digraph V
hp : ∀ (e : V × V), e ∈ edges p → e ∈ edgeSet H
⊢ length (Walk.transfer p H hp) = length p
Tactic:
induction p <;> simp [*]
State after:
no goals