Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.map_hom_top
∀ {V : Type u} {G : SimpleGraph V} (G' : G.Subgraph), SimpleGraph.Subgraph.map G'.hom ⊤ = G'- Cited by
- 1 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement and proof · cited by 9,680
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Set.extproof · cited by 2,266
- Set.image_congrproof · cited by 533
- SimpleGraph.Subgraphstatement and proof · cited by 326
- Set.image_univproof · cited by 322
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- Subtype.range_coe_subtypeproof · cited by 170
- SimpleGraph.Subgraph.Adjproof · cited by 147
- SimpleGraph.Subgraph.coestatement · cited by 89
- SimpleGraph.Subgraph.extproof · cited by 33
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.range_toSubgraphproof · cited by 2