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