Theorems · Theorem · combinatorics
Graph.Compatible.ext
∀ {α : Type u_1} {β : Type u_2} {H₁ H₂ : Graph α β},
H₁.vertexSet = H₂.vertexSet → H₁.edgeSet = H₂.edgeSet → H₁.Compatible H₂ → H₁ = H₂- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement · cited by 53,352
- LE.le.antisymmproof · cited by 507
- Graphstatement and proof · cited by 242
- Eq.subsetproof · cited by 124
- Graph.vertexSetstatement and proof · cited by 87
- Graph.edgeSetstatement and proof · cited by 79
- Graph.Compatiblestatement and proof · cited by 21
- Eq.supersetproof · cited by 16
- Graph.Compatible.le_iffproof · cited by 3
- Graph.Compatible.symmproof · cited by 2
Cited by9
Results whose statement or proof uses this declaration.
- Graph.induce_vertexSetproof · cited by 1
- Graph.restrict_edgeSet_interproof · cited by 1
- Graph.restrict_restrictproof · cited by 1
- Graph.restrict_selfproof · cited by 1
- Graph.restrict_eq_deleteEdgesproof · cited by 0
- Graph.restrict_eq_self_iffproof · cited by 0
- Graph.vertexSet_ssubset_or_edgeSet_ssubset_of_ltproof · cited by 0
- Graph.IsSpanningSubgraph.ext_of_edgeSetproof · cited by 0
- Graph.IsInducedSubgraph.ext_of_vertexSetproof · cited by 0