Theorems · Theorem · combinatorics
SimpleGraph.coe_edgeFinset
∀ {V : Type u_1} (G : SimpleGraph V) [inst : Fintype ↑G.edgeSet], ↑G.edgeFinset = G.edgeSet- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 61 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.
- 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.edgeSetstatement and proof · cited by 199
- SimpleGraph.edgeFinsetstatement · cited by 116
- Set.coe_toFinsetproof · cited by 51
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.deleteFar_iffproof · cited by 2
- SimpleGraph.card_edgeFinset_replaceVertex_of_not_adjproof · cited by 2
- SimpleGraph.edgeFinset_deleteIncidenceSet_eq_sdiffproof · cited by 2
- SimpleGraph.edgeFinset_replaceVertex_of_adjproof · cited by 1
- SimpleGraph.card_edgeFinset_replaceVertex_of_adjproof · cited by 1
- SimpleGraph.DeleteFar.le_card_edgeFinsetproof · cited by 1
- SimpleGraph.edgeFinset_mapproof · cited by 1
- SimpleGraph.edgeFinset_replaceVertex_of_not_adjproof · cited by 1
- SimpleGraph.edgeFinset_topproof · cited by 0
- SimpleGraph.disjoint_edgeFinsetproof · cited by 0