proposition: Lemma evalid_form: forall (g: UAdjMatGG) e, evalid g e -> e = (src g e, dst g e).
proof: Proof. intros. rewrite (edge_src_fst g). rewrite (edge_dst_snd g). destruct e; simpl; 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