intro b
case mk.mk
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 u u' : V
a : EdgePath G v w
⊢ ∀ (a_1 : EdgePath G w u) (r : u ⟶ u'),
    (Quot.mk Reduction a ≫ Quot.mk Reduction a_1) ≫ r = Quot.mk Reduction a ≫ Quot.mk Reduction a_1 ≫ r
case mk.mk
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 u u' : V
a : EdgePath G v w
b : EdgePath G w u
⊢ ∀ (r : u ⟶ u'), (Quot.mk Reduction a ≫ Quot.mk Reduction b) ≫ r = Quot.mk Reduction a ≫ Quot.mk Reduction b ≫ r