proposition: Lemma set1F (A : finType) (s : A) : [set x | (x == s) || false] = [set s].
proof: Proof. by apply/setP => x; rewrite !inE orbF. Qed.
imports: Wf_nat Init.Wf Recdef Reals mathcomp(all_ssreflect perm zmodp matrix ssralg) mathcomp(Rstruct) ssrR Reals_ext ssr_ext ssralg_ext bigop_ext f2 fdist channel pproba linearcode subgraph_partition tanner tanner_partition summary ldpc checksum ldpc_algo