Theorems · Theorem · combinatorics
SimpleGraph.Iso.degree_eq
∀ {V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} (f : G ≃g G') (x : V)
[inst : Fintype ↑(G.neighborSet x)] [inst_1 : Fintype ↑(G'.neighborSet (f x))], G'.degree (f x) = G.degree x- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Equiv.symmproof · cited by 3,681
- SimpleGraphstatement and proof · cited by 3,072
- Fintype.cardproof · cited by 1,386
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.degreestatement and proof · cited by 112
- SimpleGraph.Isostatement and proof · cited by 99
- Fintype.card_congrproof · cited by 67
- SimpleGraph.card_neighborSet_eq_degreeproof · cited by 9
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.maxDegree_eqproof · cited by 0
- SimpleGraph.Iso.minDegree_eqproof · cited by 0