proposition: Lemma checksubsum_dprojD1 d n0 t s : t ``_ n0 = d ``_ n0 -> \delta s (dproj d (s :\ n0) t) = \delta s t.
proof: Proof. move=> ?; rewrite checksubsum_dproj // => n1. by rewrite in_setD in_setD1 negb_and negbK => /andP[] /orP[/eqP -> //|/negbTE ->]. 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