proposition: Lemma fr_O_dst_unchanged_root: forall from to r g g', forward_relation from to O (root2forward r) g g' -> forall e, graph_has_v g (fst e) -> dst g e = dst g' e.
proof: Proof. intros. destruct r; [destruct s|]; simpl in H; inversion H; subst; try reflexivity; (simpl; rewrite pcv_dst_old; [ reflexivity | destruct e as [[gen vidx] eidx]]; unfold graph_has_v in H0; unfold new_copied_v; simpl in *; destruct H0; intro; inversion H2; subst; red in H1; lia). Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen