Theorems · Definition · combinatorics
Set.Sized
{α : Type u_1} → ℕ → Set (Finset α) → PropSized r A means that every Finset in A has size r.
- Defined in
- Mathlib.Data.Finset.Slice
- Cited by
- 35 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext
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.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Finset.cardproof · cited by 2,327
Cited by36
Results whose statement or proof uses this declaration.
- Finset.Colex.IsInitSegproof · cited by 9
- Set.Sized.shadowstatement and proof · cited by 3
- Finset.sized_fallingstatement · cited by 3
- Finset.subset_powersetCard_univ_iffstatement · cited by 2
- Set.Sized.card_lestatement and proof · cited by 2
- Set.Sized.complsstatement and proof · cited by 2
- Set.Sized.isAntichainstatement and proof · cited by 2
- Set.Sized.monostatement and proof · cited by 2
- Set.sized_unionstatement and proof · cited by 2
- Finset.sized_slicestatement · cited by 2
- Finset.local_lubell_yamamoto_meshalkin_inequality_divstatement and proof · cited by 2
- Finset.local_lubell_yamamoto_meshalkin_inequality_mulstatement and proof · cited by 2