proposition: Lemma dproj_freeon d s t : freeon s d t -> dproj d s t = t.
proof: Proof. move=> /= H; apply/rowP => i; case/boolP : (i \in s) => Hb; by [rewrite dproj_in | rewrite dproj_out // -(freeon_notin H)]. Qed.
imports: mathcomp(all_ssreflect ssralg fingroup finalg zmodp matrix) Reals mathcomp(Rstruct) ssr_ext ssralg_ext ssrR Reals_ext f2 summary subgraph_partition tanner tanner_partition fdist channel checksum