proposition: Lemma typed_tuples_not_empty_alt : {t : n.-tuple A | t \in T_{P}}.
proof: Proof. destruct n => //. apply typed_tuples_not_empty. Qed.
imports: mathcomp(all_ssreflect ssralg ssrnum perm) mathcomp(matrix) mathcomp(Rstruct) Reals ssrR Reals_ext realType_ext ssr_ext ssralg_ext logb fdist proba entropy num_occ channel_code channel typ_seq