Theorems · Theorem · combinatorics
Graph.IsSpanningSubgraph.ext_of_edgeSet
∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β}, H.edgeSet = G.edgeSet → H ≤s G → H = G- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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.edgeSetstatement and proof · cited by 79
- Graph.IsSpanningSubgraphstatement and proof · cited by 12
- Graph.Compatible.extproof · cited by 9
- Graph.IsSpanningSubgraph.vertexSet_eqproof · cited by 6
- Graph.IsSpanningSubgraph.leproof · cited by 4
- Graph.IsSubgraph.compatibleproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.