Theorems · Theorem · combinatorics
SimpleGraph.comap_symm
∀ {V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (e : V ≃ W),
SimpleGraph.comap (⇑e.symm.toEmbedding) G = SimpleGraph.map (⇑e.toEmbedding) G- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Equivstatement and proof · cited by 8,337
- Equiv.symmstatement and proof · cited by 3,681
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- Function.Embeddingstatement · cited by 988
- Equiv.toEmbeddingstatement and proof · cited by 254
- SimpleGraph.extproof · cited by 59
- SimpleGraph.mapstatement · cited by 49
- SimpleGraph.comapstatement · cited by 29
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.map_symmproof · cited by 1
- SimpleGraph.locallyLinear_comapproof · cited by 0