Theorems · Theorem · combinatorics
CompositionAsSet.blocks_partial_sum
∀ {n : ℕ} (c : CompositionAsSet n) {i : ℕ} (h : i < c.boundaries.card),
(List.take i c.blocks).sum = ↑(c.boundary ⟨i, h⟩)- Cited by
- 3 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finset.cardstatement and proof · cited by 2,327
- OrderEmbeddingstatement · cited by 619
- lt_of_lt_of_leproof · cited by 438
- add_tsub_cancel_of_leproof · cited by 79
- CompositionAsSetstatement and proof · cited by 26
- CompositionAsSet.boundariesstatement and proof · cited by 18
- CompositionAsSet.blocksstatement and proof · cited by 7
- List.sum_take_succproof · cited by 6
- CompositionAsSet.boundarystatement and proof · cited by 4
- CompositionAsSet.card_boundaries_eq_succ_lengthproof · cited by 4
- CompositionAsSet.lt_lengthproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- CompositionAsSet.mem_boundaries_iff_exists_blocks_sum_take_eqproof · cited by 1
- CompositionAsSet.blocks_sumproof · cited by 0
- Composition.toCompositionAsSet_blocksproof · cited by 0