Theorems · Definition · combinatorics
Finset.univ
{α : Type u_1} → [Fintype α] → Finset αuniv is the universal finite set of type Finset α implied from
the assumption Fintype α.
- Defined in
- Mathlib.Data.Fintype.Defs
- Cited by
- 3,473 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 4 definitions · uses no axioms
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Fintype.elemsproof · cited by 194
Cited by3,706
Results whose statement or proof uses this declaration.
- Fintype.cardproof · cited by 1,386
- Finset.mem_univstatement · cited by 361
- Equiv.Perm.supportproof · cited by 230
- Set.toFinsetproof · cited by 217
- dotProductproof · cited by 194
- Matrix.traceproof · cited by 114
- Finset.coe_univstatement · cited by 101
- Finset.univ_uniquestatement · cited by 94
- Fintype.piFinsetproof · cited by 86
- stdSimplexproof · cited by 76
- Set.toFinset_cardproof · cited by 63
- Finset.subset_univstatement · cited by 60
Showing the 200 most cited of 3,706.