Theorems · Inductive type · combinatorics
DyckStep
Type
A DyckStep is either U or D, corresponding to ( and ) respectively.
- Cited by
- 31 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by50
Results whose statement or proof uses this declaration.
- DyckWord.toListstatement · cited by 29
- DyckStep.ctorIdxstatement and proof · cited by 8
- DyckWord.count_U_eq_count_Dstatement · cited by 6
- DyckWord.count_take_firstReturn_add_onestatement · cited by 6
- DyckWord.takestatement · cited by 5
- DyckStep.casesOnstatement and proof · cited by 4
- DyckWord.count_D_le_count_Ustatement · cited by 4
- DyckWord.dropstatement · cited by 4
- DyckWord.ext_iffstatement · cited by 4
- DyckWord.firstReturn_lt_lengthstatement and proof · cited by 4
- DyckWord.extstatement and proof · cited by 3
- DyckWord.toList_ne_nilstatement · cited by 3