Mathlib Map

Theorems · Theorem · combinatorics

List.flatten_splitWrtComposition

∀ {α : Type u_1} (l : List α) (c : Composition l.length), (l.splitWrtComposition c).flatten = l

If one splits a list along a composition, and then flattens the sublists, one gets back the original list.

Defined in
Mathlib.Combinatorics.Enumerative.Composition
Cited by
1 results in Mathlib
Foundations
Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

List.splitWrtComposition_flatten · cited by 0List.splitWrtComposition_…Composition · cited by 138CompositionComposition.blocks_sum · cited by 13Composition.blocks_sumList.splitWrtComposition · cited by 12List.splitWrtCompositionList.flatten_splitWrtCompositionAux · cited by 1List.flatten_splitWrtComp…List.flatten_splitWrtComposit…CITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.