proposition: Lemma evalid_vvalid: forall (g: UAdjMatGG) u v, evalid g (u,v) -> vvalid g u /\ vvalid g v.
proof: Proof. intros. apply (evalid_strong_evalid g) in H. destruct H. rewrite (edge_src_fst g), (edge_dst_snd g) in H0 by auto. simpl in H0; 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