Theorem: Digraph.Reachable.elim_path (GraphProjects/DigraphConnectivity.lean)

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
p : Prop
u v : V
h : Reachable G u v
hp : Path G u v → p
⊢ p
Tactic:
classical exact h.elim fun q => hp q.toPath
State after:
no goals

State before:
V : Type u
V' : Type v
V'' : Type w
G : Digraph V
G' : Digraph V'
G'' : Digraph V''
p : Prop
u v : V
h : Reachable G u v
hp : Path G u v → p
⊢ p
Tactic:
exact h.elim fun q => hp q.toPath
State after:
no goals