Theorems · Theorem · combinatorics
Set.toFinset_range
∀ {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] [inst_1 : Fintype β] (f : β → α)
[inst_2 : Fintype ↑(Set.range f)], (Set.range f).toFinset = Finset.image f Finset.univ- Defined in
- Mathlib.Data.Fintype.Sets
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Set.rangestatement and proof · cited by 4,705
- Finset.univstatement · cited by 3,473
- Finset.imagestatement · cited by 910
- Finset.extproof · cited by 565
- Set.toFinsetstatement · cited by 217
Cited by7
Results whose statement or proof uses this declaration.
- Matrix.det_fromBlocks_zero₂₁proof · cited by 10
- ZLattice.rankproof · cited by 5
- Polynomial.eq_zero_of_natDegree_lt_card_of_eval_eq_zeroproof · cited by 4
- Dynamics.IsDynCoverOf.iterate_le_powproof · cited by 2
- Field.primitive_element_iff_algHom_eq_of_eval'proof · cited by 1
- finrank_range_le_cardproof · cited by 1
- SimpleGraph.le_card_edgeFinset_killCopiesproof · cited by 1