Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.snd_takeUntil

∀ {V : Type u} {G : SimpleGraph V} {v w u : V} [inst : DecidableEq V],
  w ≠ u → ∀ (p : G.Walk u v) (h : w ∈ p.support), (p.takeUntil w h).snd = p.snd
Defined in
Mathlib.Combinatorics.SimpleGraph.Walk.Decomp
Cited by
1 results in Mathlib
Foundations
Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEq
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.WalkSimpleGraph.Walk.support · cited by 307Walk.supportSimpleGraph.Walk.length · cited by 212Walk.lengthSimpleGraph.Walk.takeUntil · cited by 58Walk.takeUntilSimpleGraph.Walk.snd · cited by 56Walk.sndSimpleGraph.Walk.getVert_takeUntil · cited by 4Walk.getVert_takeUntilWalk.snd_takeUntilCITED 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.