proposition: Lemma adde_EList2: forall e', In e' (EList g) -> In e' (EList EdgeListGG_adde).
proof: Proof. intros. unfold EList. destruct finiteE. simpl. destruct a. unfold EdgeListGG_adde in H1. simpl in H1. unfold addValidFunc in H1. apply H1. left. apply EList_evalid in H. 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