proposition: Lemma adde_evalid_or: forall e', evalid EdgeListGG_adde e' -> (evalid g e' \/ e' = (u,v)).
proof: Proof. unfold EdgeListGG_adde; simpl; unfold addValidFunc. intros. apply H. Qed.
imports: VST.floyd.proofauto CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph CertiGraph.graph.undirected_graph