Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.darts_append

∀ {V : Type u} {G : SimpleGraph V} {u v w : V} (p : G.Walk u v) (p' : G.Walk v w),
  (p.append p').darts = p.darts ++ p'.darts
Defined in
Mathlib.Combinatorics.SimpleGraph.Walk.Operations
Cited by
3 results in Mathlib
Foundations
Depth 8 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Walk.edges_append · cited by 3Walk.edges_appendSimpleGraph.Walk.darts_reverse · cited by 3Walk.darts_reverseSimpleGraph.Walk.rotate_darts · cited by 1Walk.rotate_dartsSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Dart · cited by 109SimpleGraph.DartSimpleGraph.Walk.append · cited by 95Walk.appendSimpleGraph.Walk.darts · cited by 74Walk.dartsWalk.darts_appendCITED BYCITES

Cites6

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

Cited by3

Results whose statement or proof uses this declaration.