Theorems · Theorem · combinatorics
SimpleGraph.not_isDiag_of_mem_edgeFinset
∀ {V : Type u_1} {G : SimpleGraph V} {e : Sym2 V} [inst : Fintype ↑G.edgeSet], e ∈ G.edgeFinset → ¬e.IsDiag- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
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.
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement and proof · cited by 737
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.edgeFinsetstatement · cited by 116
- Sym2.IsDiagstatement · cited by 43
- SimpleGraph.mem_edgeFinsetproof · cited by 6
- SimpleGraph.not_isDiag_of_mem_edgeSetproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.card_toFinset_mem_edgeFinsetproof · cited by 1