Theorems · Theorem · combinatorics
SimpleGraph.copyCount_bot
∀ {V : Type u_1} [inst : Fintype V] (G : SimpleGraph V), G.copyCount ⊥ = 1- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Bot.botstatement and proof · cited by 4,720
- Set.univproof · cited by 3,945
- Equiv.symmproof · cited by 3,681
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardproof · cited by 2,327
- SimpleGraph.Adjproof · cited by 1,346
- Finset.filterproof · cited by 949
- SimpleGraph.Subgraphproof · cited by 326
- SimpleGraph.Subgraph.vertsproof · cited by 210
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.