proposition: Lemma DP_splitc_irred l: Dyck_irred l -> DP_splitc l = [:: l].
proof: Proof. by move => h; apply: DP_splitc_unique => //=; rewrite ?h // cats0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)