proposition: Lemma wedge_to_cdata_wedgerep: forall w, Int.min_signed <= fst w <= Int.max_signed -> Int.min_signed <= fst (snd w) <= Int.max_signed -> Int.min_signed <= snd (snd w) <= Int.max_signed -> def_wedgerep (wedge_to_cdata w).
proof: Proof. intros. unfold wedge_to_cdata; unfold def_wedgerep; simpl. lia. Qed.
imports: VST.floyd.proofauto CertiGraph.graph.graph_model CertiGraph.kruskal.WeightedEdgeListGraph CertiGraph.graph.FiniteGraph CertiGraph.kruskal.env_kruskal_edgelist