proposition: Lemma evalid_strong_evalid: forall (g: EdgeListGG) e, evalid g e -> strong_evalid g e.
proof: Proof. intros. split. auto. apply edge_valid. 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