Theorems · Theorem · combinatorics
List.toFinset_surj_on
∀ {α : Type u_1} [inst : DecidableEq α], Set.SurjOn List.toFinset {l | l.Nodup} Set.univ- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Set.ofPredstatement · cited by 6,101
- Set.univstatement and proof · cited by 3,945
- Multisetproof · cited by 2,627
- Set.SurjOnstatement · cited by 186
- Multiset.Nodupproof · cited by 148
- List.toFinsetstatement · cited by 108
- Finset.casesOnproof · cited by 17
- List.toFinset_eqproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- List.toFinset_surjectiveproof · cited by 1