proposition: Lemma dst_R_eq: forall (g1 g2: Graph) x, vvalid g1 x -> g1 ~=~ g2 -> dst g1 (x, R) = dst g2 (x, R).
proof: Proof. intros. destruct H0 as [? [? [? ?]]]. assert (vvalid g2 x) by (clear - H H0; firstorder). apply H3. + eapply right_valid in H; [| apply binGraph]. auto. + eapply right_valid in H4; [| apply binGraph]. auto. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.BinGraph CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.msl_application.Graph Coq.Logic.Classical