proposition: Lemma evalid_adjacent: forall (g: UAdjMatGG) u v, evalid g (u,v) -> adjacent g u v.
proof: Proof. intros. exists (u,v); split. apply (evalid_strong_evalid g); auto. rewrite (edge_src_fst g), (edge_dst_snd g) by auto. left; simpl; 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