Theorem: Digraph.Path.cons_isCycle (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 : Path G v u
h : G.Adj u v
he : ¬(u, v) ∈ Walk.edges ↑p
⊢ Walk.IsCycle (Walk.cons h ↑p)
Tactic:
simp [Walk.isCycle_def, Walk.cons_isTrail_iff, he]
State after:
no goals