V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u' v' : V
s : Set (Sym2 V)
p : Walk G u' v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p (_ : u' = u') (_ : v' = v')) → ¬e ∈ s
⊢ ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s
V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u v u' v' : V
s : Set (Sym2 V)
p : Walk G u v
hu : u = u'
hv : v = v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p hu hv) → ¬e ∈ s
⊢ ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s
subst_vars
no goals
V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u' v' : V
s : Set (Sym2 V)
p : Walk G u' v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p (_ : u' = u') (_ : v' = v')) → ¬e ∈ s
⊢ ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s
exact h
V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u' v' : V
s : Set (Sym2 V)
p : Walk G u' v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p (_ : u' = u') (_ : v' = v')) → ¬e ∈ s
⊢ toDeleteEdges s (Walk.copy p (_ : u' = u') (_ : v' = v')) h =
    Walk.copy (toDeleteEdges s p (_ : ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s)) (_ : u' = u') (_ : v' = v')
V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u v u' v' : V
s : Set (Sym2 V)
p : Walk G u v
hu : u = u'
hv : v = v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p hu hv) → ¬e ∈ s
⊢ toDeleteEdges s (Walk.copy p hu hv) h = Walk.copy (toDeleteEdges s p (_ : ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s)) hu hv
subst_vars
no goals
V : Type u
V' : Type v
V'' : Type w
G : SimpleGraph V
G' : SimpleGraph V'
G'' : SimpleGraph V''
u' v' : V
s : Set (Sym2 V)
p : Walk G u' v'
h : ∀ (e : Sym2 V), e ∈ edges (Walk.copy p (_ : u' = u') (_ : v' = v')) → ¬e ∈ s
⊢ toDeleteEdges s (Walk.copy p (_ : u' = u') (_ : v' = v')) h =
    Walk.copy (toDeleteEdges s p (_ : ∀ (e : Sym2 V), e ∈ edges p → ¬e ∈ s)) (_ : u' = u') (_ : v' = v')
rfl