Theorems · Theorem · combinatorics
SimpleGraph.not_mem_edgeSet_of_isDiag
∀ {V : Type u} (G : SimpleGraph V) {e : Sym2 V}, e.IsDiag → e ∉ G.edgeSet- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Sym2statement and proof · cited by 737
- SimpleGraph.edgeSetstatement · cited by 199
- Sym2.IsDiagstatement · cited by 43
- SimpleGraph.not_isDiag_of_mem_edgeSetproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- Sym2.IsDiag.not_mem_edgeSetproof · cited by 0