Mathlib Map

Theorems · Inductive type · combinatorics

DyckStep

Type

A DyckStep is either U or D, corresponding to ( and ) respectively.

Defined in
Mathlib.Combinatorics.Enumerative.DyckWord
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.