Theorems · Theorem · combinatorics
Finset.toList_toFinset
∀ {α : Type u_1} [inst : DecidableEq α] (s : Finset α), s.toList.toFinset = s- Defined in
- Mathlib.Data.Finset.Dedup
- Cited by
- 4 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.
Cites4
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
- Finset.extproof · cited by 565
- List.toFinsetstatement · cited by 108
- Finset.toListstatement · cited by 34
Cited by4
Results whose statement or proof uses this declaration.
- Finset.exists_list_nodup_eqproof · cited by 2
- FirstOrder.Language.presburger.realize_sumproof · cited by 1
- List.toFinset_toListproof · cited by 1
- Finset.support_sum_eqproof · cited by 0