Theorems · Theorem · combinatorics
SimpleGraph.induceHomOfLE_toHom
∀ {V : Type u_1} (G : SimpleGraph V) {s s' : Set V} (h : s ⊆ s'),
(G.induceHomOfLE h).toHom = SimpleGraph.induceHom SimpleGraph.Hom.id ⋯- Defined in
- Mathlib.Combinatorics.SimpleGraph.Maps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- 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.Embedding.toHomstatement · cited by 17
- Set.MapsTo.mono_rightstatement · cited by 13
- SimpleGraph.Hom.idstatement · cited by 11
- RelHom.extproof · cited by 9
- Set.mapsTo_idstatement · cited by 8
- SimpleGraph.induceHomstatement · cited by 7
- SimpleGraph.induceHomOfLEstatement · cited by 5
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.