Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.edges_tail

∀ {V : Type u} {G : SimpleGraph V} {u v : V} {p : G.Walk u v}, p.tail.edges = p.edges.tail
Defined in
Mathlib.Combinatorics.SimpleGraph.Walk.Operations
Cited by
1 results in Mathlib
Foundations
Depth 12 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.IsAcyclic.isPath_iff_isChain · cited by 1IsAcyclic.isPath_iff_isCh…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Walk · cited by 915SimpleGraph.WalkSym2 · cited by 737Sym2SimpleGraph.Walk.edges · cited by 145Walk.edgesSimpleGraph.Walk.snd · cited by 56Walk.sndSimpleGraph.Walk.tail · cited by 34Walk.tailSimpleGraph.Walk.edges_drop · cited by 1Walk.edges_dropWalk.edges_tailCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.