Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.coe_degree
∀ {V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (v : ↑G'.verts) [inst : Fintype ↑(G'.coe.neighborSet v)]
[inst_1 : Fintype ↑(G'.neighborSet ↑v)], G'.coe.degree v = G'.degree ↑v- Cited by
- 3 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.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · 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
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.degreestatement · cited by 112
- SimpleGraph.Subgraph.coestatement and proof · cited by 89
- Fintype.card_congrproof · cited by 67
- SimpleGraph.Subgraph.neighborSetstatement and proof · cited by 46
- SimpleGraph.Subgraph.degreestatement and proof · cited by 14
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.IsMatching.even_cardproof · cited by 5
- SimpleGraph.Subgraph.degree_eq_zero_of_subsingletonproof · cited by 2
- SimpleGraph.Subgraph.Preconnected.degree_zero_iffproof · cited by 0