Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.degree_spanningCoe
∀ {V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (v : V) [inst : Fintype ↑(G'.neighborSet v)]
[inst_1 : Fintype ↑(G'.spanningCoe.neighborSet v)], G'.spanningCoe.degree v = G'.degree v- Cited by
- 0 results in Mathlib
- Foundations
- Depth 62 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.
- Setproof · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Fintype.cardproof · cited by 1,386
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.degreestatement · cited by 112
- Fintype.card_congr'proof · cited by 60
- SimpleGraph.Subgraph.neighborSetstatement and proof · cited by 46
- SimpleGraph.Subgraph.spanningCoestatement and proof · cited by 33
- SimpleGraph.Subgraph.degreestatement and proof · cited by 14
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.