proposition: Lemma eformat2': forall (e: E), snd e < fst e -> eformat e = (snd e, fst e).
proof: Proof. unfold eformat; intros. rewrite <- Z.leb_gt in H; rewrite H. auto. Qed.
imports: VST.floyd.proofauto CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.find_lemmas CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.undirected_graph CertiGraph.graph.MathAdjMatGraph