Theorems · Definition · combinatorics
Finset.falling
{α : Type u_2} → [DecidableEq α] → ℕ → Finset (Finset α) → Finset (Finset α)falling k 𝒜 is all the finsets of cardinality k which are a subset of something in 𝒜.
- Defined in
- Mathlib.Combinatorics.SetFamily.LYM
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 64 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.
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.supproof · cited by 530
- Finset.powersetCardproof · cited by 60
Cited by8
Results whose statement or proof uses this declaration.
- Finset.sized_fallingstatement and proof · cited by 3
- Finset.lubell_yamamoto_meshalkin_inequality_sum_card_div_chooseproof · cited by 2
- Finset.mem_fallingstatement · cited by 2
- Finset.le_card_falling_div_choosestatement and proof · cited by 1
- Finset.IsAntichain.disjoint_slice_shadow_fallingstatement and proof · cited by 1
- Finset.slice_subset_fallingstatement · cited by 1
- Finset.slice_union_shadow_falling_succstatement and proof · cited by 1
- Finset.falling_zero_subsetstatement and proof · cited by 0