proposition: Lemma fr_O_dst_unchanged_field: forall from to v n g g', forward_p_compatible (inr (v, Z.of_nat n)) [] g from -> forward_relation from to O (forward_p2forward_t (inr (v, Z.of_nat n)) [] g) g g' -> forall e, graph_has_v g (fst e) -> e <> (v, n) -> dst g e = dst g' e.
proof: Proof. intros. simpl in *. destruct H as [? [? [? ?]]]. rewrite H4 in H0. simpl in H0. remember (Znth (Z.of_nat n) (make_fields g v)). assert (forall e0, inr e0 = Znth (Z.of_nat n) (make_fields g v) -> e0 <> e). { intros. symmetry in H6. apply make_fields_Znth_edge in H6. 2: assumption. rewrite Nat2Z.id in H6. rewrite <- H6 in H2. auto. } destruct f; [destruct s |]; simpl in H0; inversion H0; subst; try reflexivity. - subst new_g. rewrite lgd_dst_old. 1: reflexivity. apply H6; assumption. - subst new_g. rewrite lgd_dst_old. 2: apply H6; assumption. simpl. rewrite pcv_dst_old. 1: reflexivity. intro. rewrite H7 in H1. destruct H1. unfold new_copied_v in H8. simpl in H8. red in H8. 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