Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Walk.IsPath.mapLe

∀ {V : Type u} {G G' : SimpleGraph V} (h : G ≤ G') {u v : V} {p : G.Walk u v},
  p.IsPath → (SimpleGraph.Walk.mapLe h p).IsPath

Alias of the reverse direction of SimpleGraph.Walk.isPath_mapLe.

Defined in
Mathlib.Combinatorics.SimpleGraph.Paths
Cited by
1 results in Mathlib
Foundations
Depth 25 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.isTree_iff_minimal_connected · cited by 0SimpleGraph.isTree_iff_mi…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Walk · cited by 915SimpleGraph.WalkSimpleGraph.Walk.IsPath · cited by 140Walk.IsPathSimpleGraph.Walk.mapLe · cited by 26Walk.mapLeSimpleGraph.Walk.isPath_mapLe · cited by 3Walk.isPath_mapLeIsPath.mapLeCITED BYCITES

Cites5

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.