Theorem: Digraph.Walk.cons_isTrail_iff (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 w : V
h : G.Adj u v
p : Walk G v w
⊢ IsTrail (cons h p) ↔ IsTrail p ∧ ¬(u, v) ∈ edges p
Tactic:
simp [isTrail_def, and_comm]
State after:
no goals