Theorems · Theorem · combinatorics
Graph.IsSubgraph.edgeSet_mono
∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β}, H ≤ G → H.edgeSet ⊆ G.edgeSet- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.edgeSetstatement and proof · cited by 79
- Graph.IsLink.edge_memproof · cited by 14
- Graph.IsLink.monoproof · cited by 11
- Graph.exists_isLink_of_mem_edgeSetproof · cited by 6
Cited by8
Results whose statement or proof uses this declaration.
- Graph.Compatible.anti_leftproof · cited by 2
- Graph.le_iff_compatible_subset_subsetproof · cited by 1
- Graph.restrict_mono_leftproof · cited by 1
- Graph.deleteEdges_mono_leftproof · cited by 0
- Graph.le_noEdge_iffproof · cited by 0
- Graph.restrict_eq_self_iffproof · cited by 0
- Graph.vertexSet_ssubset_or_edgeSet_ssubset_of_ltproof · cited by 0
- Graph.IsInducedSubgraph.ext_of_vertexSetproof · cited by 0