Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Embedding.comap_eq

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : H ↪g G), SimpleGraph.comap (⇑f) G = H
Defined in
Mathlib.Combinatorics.SimpleGraph.Maps
Cited by
2 results in Mathlib
Foundations
Depth 14 from the axioms · uses propext, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.eq_top_of_isIndContained_top · cited by 0SimpleGraph.eq_top_of_isI…SimpleGraph.isIndContained_iff_exists_comap_eq · cited by 0SimpleGraph.isIndContaine…DFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.ext · cited by 59SimpleGraph.extSimpleGraph.Embedding · cited by 41SimpleGraph.EmbeddingSimpleGraph.comap · cited by 29SimpleGraph.comapSimpleGraph.Embedding.map_adj_iff · cited by 6Embedding.map_adj_iffEmbedding.comap_eqCITED 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.