proposition: Lemma test_connected : forall ab, ab \in allpairs pair enum_id enum_id -> has (fun p => let (a,b) := ab in if p is x :: p then (a == x) && path myrel a p && (b == last x p) else a == b) (mypath (m+n)).
proof: Proof. apply /allP; by vm_compute. 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