Theorems · Theorem · combinatorics
SimpleGraph.induceHom_id
∀ {V : Type u_1} (G : SimpleGraph V) (s : Set V), SimpleGraph.induceHom SimpleGraph.Hom.id ⋯ = SimpleGraph.Hom.id- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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 and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Homstatement · cited by 139
- SimpleGraph.inducestatement · cited by 80
- SimpleGraph.Hom.idstatement and proof · cited by 11
- RelHom.extproof · cited by 9
- Set.mapsTo_idstatement and proof · cited by 8
- SimpleGraph.induceHomstatement and proof · cited by 7
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.ComponentCompl.hom_reflproof · cited by 0