Theorems · Theorem · combinatorics
Fin.univ_map_def
∀ {α : Type u_1} {n : ℕ} (f : Fin n ↪ α), Finset.map f Finset.univ = { val := ↑(List.ofFn ⇑f), nodup := ⋯ }- Defined in
- Mathlib.Data.Fintype.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement · cited by 13,712
- Finset.univstatement and proof · cited by 3,473
- Function.Embeddingstatement and proof · cited by 988
- Multiset.mapproof · cited by 876
- Finset.mapstatement · cited by 747
- Finset.valproof · cited by 438
- Multiset.ofListstatement and proof · cited by 290
- Function.Embedding.injectivestatement and proof · cited by 111
- Fin.univ_val_mapproof · cited by 15
- Finset.mk.congr_simpproof · cited by 6
- List.nodup_ofFnstatement and proof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.