Theorems · Theorem · combinatorics
List.sublistsLen_succ_cons
∀ {α : Type u} (n : ℕ) (a : α) (l : List α),
List.sublistsLen (n + 1) (a :: l) = List.sublistsLen (n + 1) l ++ List.map (List.cons a) (List.sublistsLen n l)- Defined in
- Mathlib.Data.List.Sublists
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 14 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.
- List.sublistsLenstatement and proof · cited by 19
- List.sublistsLenAuxproof · cited by 5
- List.sublistsLenAux_eqproof · cited by 2
Cited by5
Results whose statement or proof uses this declaration.
- Multiset.powersetCardAux_consproof · cited by 2
- List.range_bind_sublistsLen_permproof · cited by 1
- List.sublistsLen_sublist_of_sublistproof · cited by 1
- List.sublistsLen_oneproof · cited by 1
- List.mem_sublistsLen_selfproof · cited by 1