Theorems · Definition · combinatorics
Finset.attach
{α : Type u_1} → (s : Finset α) → Finset ↥sattach s takes the elements of s and forms a new set of elements of the subtype
{x // x ∈ s}.
- Defined in
- Mathlib.Data.Finset.Attach
- Cited by
- 168 results in Mathlib
- Foundations
- Depth 54 from the axioms, rests on 832 definitions · uses propext, Classical.choice, Quot.sound
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 and proof · cited by 13,712
- Finset.valproof · cited by 438
- Multiset.attachproof · cited by 31
Cited by177
Results whose statement or proof uses this declaration.
- Finset.sum_attachstatement · cited by 54
- Finset.subtypeproof · cited by 41
- Finset.finsuppAntidiagproof · cited by 25
- Finset.prod_attachstatement · cited by 22
- Finset.card_attachstatement · cited by 21
- Finset.univ_eq_attachstatement · cited by 13
- Finset.mem_attachstatement · cited by 13
- IsLocalization.finsetIntegerMultipleproof · cited by 11
- BinaryTree.treesOfNumNodesEqproof · cited by 10
- Finset.card_bijproof · cited by 10
- Finset.coe_attachstatement · cited by 9
- Finset.attach_eq_univstatement · cited by 9