Theorems · Theorem · combinatorics
SimpleGraph.induce_singleton_eq_top
∀ {V : Type u_1} (G : SimpleGraph V) (v : V), SimpleGraph.induce {v} G = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 0 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.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- Top.topstatement and proof · cited by 9,680
- Set.Elemstatement · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- eq_top_iffproof · cited by 236
- Function.Embedding.subtypeproof · cited by 128
- SimpleGraph.inducestatement · cited by 80
- SimpleGraph.le_comap_of_subsingletonproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.