proposition: Lemma DP_count l: DP_Tcount l + DP_Fcount l = size l.
proof: Proof. by elim:l => // a l /= <-; case:a; rewrite add1n //= add0n addnS. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)