Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Path.mapEmbedding

{V : Type u} →
  {V' : Type v} →
    {G : SimpleGraph V} → {G' : SimpleGraph V'} → (f : G ↪g G') → {u v : V} → G.Path u v → G'.Path (f u) (f v)

Given a graph embedding, map paths to paths.

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

Around this declaration

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

SimpleGraph.Path.mapEmbedding_coe · cited by 0Path.mapEmbedding_coeSimpleGraph.Path.mapEmbedding_injective · cited by 0Path.mapEmbedding_injecti…DFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.Embedding · cited by 41SimpleGraph.EmbeddingSimpleGraph.Path · cited by 22SimpleGraph.PathSimpleGraph.Embedding.toHom · cited by 17Embedding.toHomSimpleGraph.Path.map · cited by 2Path.mapPath.mapEmbeddingCITED BYCITES

Cites7

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

Cited by2

Results whose statement or proof uses this declaration.