Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Copy.mapNeighborSet

{α : Type u_4} →
  {β : Type u_5} →
    {A : SimpleGraph α} → {B : SimpleGraph β} → (f : A.Copy B) → (a : α) → ↑(A.neighborSet a) ↪ ↑(B.neighborSet (f a))

A copy induces an embedding of neighbor sets.

Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
1 results in Mathlib
Foundations
Depth 12 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Copy.degree_le · cited by 1Copy.degree_leDFunLike.coe · cited by 62936DFunLike.coeSet.Elem · cited by 7166Set.ElemSimpleGraph · cited by 3072SimpleGraphFunction.Embedding · cited by 988Function.EmbeddingSimpleGraph.neighborSet · cited by 257SimpleGraph.neighborSetSimpleGraph.Copy · cited by 49SimpleGraph.CopyCopy.mapNeighborSetCITED 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.