Theorem: Graph.EdgePath.Reduction.property (GroupComp/Graph.lean)

State before:
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
u✝ v✝ w✝ : V
e : EdgeBetween G v✝ w✝
v w : V
p' p : EdgePath G v w
u u' : V
e' : EdgeBetween G u u'
p₁ : EdgePath G v u
p₂ : EdgePath G u w
⊢ ∃ u_1 u'_1 e p₁_1 p₂_1, p₁_1 ++ cons e (cons (EdgeBetween.bar e) p₂_1) = p₁ ++ cons e' (cons (EdgeBetween.bar e') p₂)
Tactic:
use u, u', e', p₁, p₂
State after:
no goals