proposition: Lemma wedge_lt_irrefl: forall a, def_wedgerep a -> wedge_lt a a -> False.
proof: Proof. intros. destruct H as [? [? ?]]. unfold wedge_lt in H0. rewrite (surjective_pairing a) in *. destruct (fst a); trivial. lia. Qed.
imports: VST.floyd.proofauto Coq.ZArith.ZArith CertiGraph.floyd_ext.closed_lemmas CertiGraph.kruskal.kruskal_edgelist