Theorems · Theorem · combinatorics
SimpleGraph.disjoint_edgeSet
∀ {V : Type u} {G₁ G₂ : SimpleGraph V}, Disjoint G₁.edgeSet G₂.edgeSet ↔ Disjoint G₁ G₂- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Bot.botproof · cited by 4,720
- SimpleGraphstatement and proof · cited by 3,072
- Disjointstatement and proof · cited by 2,201
- Sym2statement and proof · cited by 737
- SimpleGraph.edgeSetstatement and proof · cited by 199
- disjoint_iff_inf_leproof · cited by 64
- OrderEmbedding.le_iff_leproof · cited by 32
- Set.disjoint_iffproof · cited by 27
- SimpleGraph.edgeSetEmbeddingproof · cited by 8
- SimpleGraph.edgeSet_botproof · cited by 6
- SimpleGraph.edgeSet_infproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.disjoint_fromEdgeSetproof · cited by 2
- SimpleGraph.disjoint_of_disjoint_supportproof · cited by 0