Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.hom_apply
∀ {V : Type u} {G : SimpleGraph V} (x : G.Subgraph) (v : ↑x.verts), x.hom v = ↑v- Cited by
- 6 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses no axioms
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.coestatement and proof · cited by 62,936
- Setstatement · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.coestatement · cited by 89
- RelHomstatement · cited by 49
- SimpleGraph.Subgraph.homstatement and proof · cited by 18
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.coeSubgraph_adjproof · cited by 2
- SimpleGraph.Subgraph.Connected.exists_verts_eq_connectedComponentSuppproof · cited by 1
- SimpleGraph.Subgraph.restrict_coeSubgraphproof · cited by 1
- SimpleGraph.Subgraph.map_hom_topproof · cited by 1
- SimpleGraph.Subgraph.coeSubgraph_leproof · cited by 0
- SimpleGraph.Subgraph.coeSubgraph_restrict_eqproof · cited by 0