proposition: Lemma pregraph_gen_dst_is_partial_graph: forall (g: PreGraph V E) e v, ~ vvalid g v -> is_partial_graph (pregraph_gen_dst g e v) g.
proof: Proof. intros. hnf. simpl. unfold updateEdgeFunc. split; [|split; [|split]]; intros; auto. destruct_eq_dec e e0; [exfalso|]; auto. Qed.
imports: Coq.Arith.Arith Coq.Logic.ProofIrrelevance Coq.Logic.FunctionalExtensionality Coq.Classes.Morphisms Coq.Classes.Equivalence CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.relation_list CertiGraph.lib.List_ext CertiGraph.lib.Equivalence_ext CertiGraph.lib.EquivDec_ext VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation