Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.edgeSet_inf
∀ {V : Type u} {G : SimpleGraph V} {H₁ H₂ : G.Subgraph}, (H₁ ⊓ H₂).edgeSet = H₁.edgeSet ∩ H₂.edgeSet- Cited by
- 1 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Set.extproof · cited by 2,266
- Sym2statement and proof · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.Adjproof · cited by 147
- Sym2.indproof · cited by 66
- SimpleGraph.Subgraph.edgeSetstatement and proof · cited by 37
Cited by1
Results whose statement or proof uses this declaration.
- Disjoint.edgeSetproof · cited by 0