Theorems · Theorem · combinatorics
SimpleGraph.Iso.image_neighborSet
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {v : V} (f : G ≃g G'),
⇑f '' G.neighborSet v = G'.neighborSet (f v)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- Setstatement and proof · cited by 53,352
- Set.imagestatement and proof · cited by 5,609
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.neighborSetstatement and proof · cited by 257
- RelIso.toEquivproof · cited by 113
- SimpleGraph.Isostatement and proof · cited by 99
- SimpleGraph.Iso.toEmbeddingproof · cited by 9
- Equiv.image_preimageproof · cited by 8
- SimpleGraph.Embedding.preimage_neighborSetproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.