Theorems · Definition · combinatorics
CompositionAsSet.boundary
{n : ℕ} → (c : CompositionAsSet n) → Fin c.boundaries.card ↪o Fin (n + 1)Canonical increasing bijection from Fin c.boundaries.card to c.boundaries.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.cardstatement · cited by 2,327
- OrderEmbeddingstatement · cited by 619
- Finset.orderEmbOfFinproof · cited by 47
- CompositionAsSetstatement and proof · cited by 26
- CompositionAsSet.boundariesstatement and proof · cited by 18
Cited by5
Results whose statement or proof uses this declaration.
- CompositionAsSet.blocks_partial_sumstatement and proof · cited by 3
- CompositionAsSet.blocksFunproof · cited by 2
- CompositionAsSet.mem_boundaries_iff_exists_blocks_sum_take_eqproof · cited by 1
- CompositionAsSet.boundary_lengthstatement and proof · cited by 1
- CompositionAsSet.boundary_zerostatement · cited by 1