Theorems · Theorem · combinatorics
Set.toFinset_inj
∀ {α : Type u_1} {s t : Set α} [inst : Fintype ↑s] [inst_1 : Fintype ↑t], s.toFinset = t.toFinset ↔ s = t- Defined in
- Mathlib.Data.Fintype.Sets
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Set.toFinsetstatement and proof · cited by 217
- Set.coe_toFinsetproof · cited by 51
- Set.toFinset_congrproof · cited by 33
Cited by3
Results whose statement or proof uses this declaration.
- set_fintype_card_eq_univ_iffproof · cited by 3
- Set.toFinset_eq_emptyproof · cited by 1
- Set.Finite.toFinset_injproof · cited by 1