Theorems · Theorem · combinatorics
Finite.exists_univ_list
∀ (α : Type u_4) [Finite α], ∃ l, l.Nodup ∧ ∀ (x : α), x ∈ l
- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
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.
- Fintypeproof · cited by 7,736
- Finset.univproof · cited by 3,473
- Finitestatement and proof · cited by 3,029
- Finset.valproof · cited by 438
- nonempty_fintypeproof · cited by 261
- Multiset.Nodupproof · cited by 148
- Finset.nodupproof · cited by 40
- Finset.mem_univ_valproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Equiv.Perm.sign_prodCongrRightproof · cited by 1
- Primrec.dom_finiteproof · cited by 0