proposition: Corollary add_edge_unaffected: forall (g: PGraph) e s t p l, valid_upath (pregraph_add_edge g e s t) p -> fits_upath (pregraph_add_edge g e s t) l p -> ~ In e l -> valid_upath g p.
proof: Proof. intros. apply valid_upath_exists_list_edges'. exists l. apply (add_edge_fits_upath_rev) in H0; auto. Qed.
imports: Coq.Logic.Classical CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_relation CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph