proposition: Lemma forest_bridge1: forall (g: EdgeListGG) u v, uforest' g -> evalid g (u,v) -> bridge g (u,v) u v.
proof: Proof. unfold bridge; intros. apply (forest_edge' p l g). auto. apply evalid_strong_evalid; auto. rewrite src_fst; auto. rewrite dst_snd; auto. auto. 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