Theorems · Definition · combinatorics
List.sublistsLen
{α : Type u} → ℕ → List α → List (List α)The list of all sublists of a list l that are of length n. For instance, for
l = [0, 1, 2, 3] and n = 2, one gets
[[2, 3], [1, 3], [1, 2], [0, 3], [0, 2], [0, 1]].
- Defined in
- Mathlib.Data.List.Sublists
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.sublistsLenAuxproof · cited by 5
Cited by19
Results whose statement or proof uses this declaration.
- Multiset.powersetCard_coestatement · cited by 5
- List.sublistsLen_succ_consstatement and proof · cited by 5
- List.sublistsLen_zerostatement · cited by 5
- Multiset.powersetCardAux_eq_map_coestatement and proof · cited by 4
- List.sublistsLen_sublist_sublists'statement · cited by 3
- Multiset.powersetCardAux_consproof · cited by 2
- Multiset.bind_powerset_lenproof · cited by 2
- List.sublistsLenAux_eqstatement · cited by 2
- List.mem_sublistsLenstatement and proof · cited by 1
- List.mem_sublistsLen_selfstatement and proof · cited by 1
- List.length_sublistsLenstatement · cited by 1
- List.length_of_sublistsLenstatement and proof · cited by 1