Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.Iso.homCongr

{V : Type u_1} →
  {W : Type u_2} →
    {X : Type u_3} →
      {Y : Type u_4} →
        {G : SimpleGraph V} →
          {G' : SimpleGraph W} →
            G ≃g G' → {G'' : SimpleGraph X} → {G''' : SimpleGraph Y} → G'' ≃g G''' → G →g G'' ≃ G' →g G'''

Equivalence of homomorphisms induced by isomorphisms of graphs.

Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
0 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.coloringCongr · cited by 0SimpleGraph.coloringCongrEquiv · cited by 8337EquivSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Hom · cited by 139SimpleGraph.HomSimpleGraph.Iso · cited by 99SimpleGraph.IsoRelIso.relHomCongr · cited by 4RelIso.relHomCongrIso.homCongrCITED 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.