proposition: Lemma updateEdgeFunc_neq: forall edgeFunc e v e', e <> e' -> updateEdgeFunc edgeFunc e v e' = edgeFunc e'.
proof: Proof. intros. unfold updateEdgeFunc. destruct_eq_dec e e'; auto. easy. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.Sets.Ensembles Coq.Sets.Finite_sets Coq.Classes.Morphisms 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 Coq.Lists.List CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind