Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.ext
∀ {V : Type u} {G : SimpleGraph V} {x y : G.Subgraph}, x.verts = y.verts → x.Adj = y.Adj → x = y- Cited by
- 33 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.vertsstatement and proof · cited by 210
- SimpleGraph.Subgraph.Adjstatement and proof · cited by 147
Cited by33
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.subgraphOfAdj_eq_induceproof · cited by 2
- SimpleGraph.subgraphOfAdj_symmproof · cited by 2
- SimpleGraph.Subgraph.induce_self_vertsproof · cited by 2
- SimpleGraph.Walk.toSubgraph_reverseproof · cited by 2
- SimpleGraph.Subgraph.IsInduced.induce_top_vertsproof · cited by 1
- SimpleGraph.Subgraph.eq_bot_iff_verts_eq_emptyproof · cited by 1
- SimpleGraph.Subgraph.IsMatching.injOn_edgeSetproof · cited by 1
- SimpleGraph.Subgraph.map_compproof · cited by 1
- SimpleGraph.Subgraph.map_hom_topproof · cited by 1
- SimpleGraph.Subgraph.map_idproof · cited by 1
- SimpleGraph.Subgraph.map_iso_topproof · cited by 1
- SimpleGraph.Subgraph.map_supproof · cited by 1