Theorems · Theorem · combinatorics
SimpleGraph.coe_incidenceFinset
∀ {V : Type u_1} (G : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)] [inst_1 : DecidableEq V],
↑(G.incidenceFinset v) = G.incidenceSet v- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement · cited by 13,712
- SetLike.coestatement · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement · cited by 737
- SimpleGraph.neighborSetstatement and proof · cited by 257
- Set.coe_toFinsetproof · cited by 51
- SimpleGraph.incidenceSetstatement and proof · cited by 46
- SimpleGraph.incidenceFinsetstatement · cited by 15
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.edgeFinset_deleteIncidenceSet_eq_sdiffproof · cited by 2
- SimpleGraph.edgeFinset_replaceVertex_of_not_adjproof · cited by 1
- SimpleGraph.edgeFinset_replaceVertex_of_adjproof · cited by 1
- SimpleGraph.disjoint_incidenceFinset_of_disjointproof · cited by 0