Theorems · Definition · combinatorics
Finset.casesOn
{α : Type u_4} →
{motive : Finset α → Sort u} →
(t : Finset α) → ((val : Multiset α) → (nodup : val.Nodup) → motive { val := val, nodup := nodup }) → motive t- Defined in
- Mathlib.Data.Finset.Defs
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, 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
- Multisetstatement and proof · cited by 2,627
- Multiset.Nodupstatement and proof · cited by 148
Cited by19
Results whose statement or proof uses this declaration.
- Finset.mem_powersetproof · cited by 26
- Finset.card_eq_oneproof · cited by 16
- Finset.mem_powersetCardproof · cited by 14
- Finset.offDiag_cardproof · cited by 7
- Finset.mem_offDiagproof · cited by 6
- Finset.norm_prod_leproof · cited by 6
- Polynomial.roots_prodproof · cited by 4
- Finset.mem_disjUnionproof · cited by 3
- Finset.norm_prod_le'proof · cited by 2
- TwoSidedIdeal.finsetProd_memproof · cited by 2
- card_perms_of_finsetproof · cited by 1
- Polynomial.coeff_prod_of_natDegree_leproof · cited by 1