proposition: Lemma adde_EList_old: forall e, In e (EList g) -> In e (EList UAdjMatGG_adde).
proof: Proof. intros. unfold EList. destruct finiteE. simpl. destruct a. apply H1. rewrite adde_evalid_or. left; rewrite <- EList_evalid; apply H. 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