Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.transfer_self

∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), p.transfer G ⋯ = p
Defined in
Mathlib.Combinatorics.SimpleGraph.Walk.Maps
Cited by
1 results in Mathlib
Foundations
Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Walk.map_toDeleteEdges_eq · cited by 0Walk.map_toDeleteEdges_eqSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Walk.transfer · cited by 16Walk.transferSimpleGraph.Walk.cons.congr_simp · cited by 15cons.congr_simpSimpleGraph.Walk.edges_subset_edgeSet · cited by 11Walk.edges_subset_edgeSetWalk.transfer_selfCITED BYCITES

Cites6

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.