Theorems · Theorem · combinatorics
DyckWord.cons_tail_dropLast_concat
∀ {p : DyckWord}, p ≠ 0 → DyckStep.U :: (↑p).dropLast.tail ++ [DyckStep.D] = ↑p- Cited by
- 2 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DyckWordstatement and proof · cited by 59
- DyckStepstatement and proof · cited by 31
- DyckWord.toListstatement and proof · cited by 29
- List.count_eq_one_of_memproof · cited by 12
- DyckStep.ctorIdxproof · cited by 8
- List.dropLast_append_getLastproof · cited by 5
- DyckStep.casesOnproof · cited by 4
- DyckWord.toList_ne_nilproof · cited by 3
- DyckWord.casesOnproof · cited by 2
- DyckWord.getLast_eq_Dproof · cited by 1
- DyckWord.head_eq_Uproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- DyckWord.nest_denestproof · cited by 1
- DyckWord.firstReturn_posproof · cited by 0