proposition: Lemma svfl_dst_unchanged: forall from to v l g1 g2, graph_has_v g1 v -> raw_mark (vlabel g1 v) = false -> (raw_tag (vlabel g1 v) < NO_SCAN_TAG)%Z -> vgeneration v <> from -> (forall i, In i l -> i < length (raw_fields (vlabel g1 v))) -> graph_has_gen g1 to -> scan_vertex_for_loop from to v l g1 g2 -> forall e, graph_has_v g1 (fst e) -> (forall i, In i l -> e <> (v, i)) -> dst g1 e = dst g2 e.
proof: Proof. intros ? ? ? ?. induction l; intros; inversion H5; subst. 1: reflexivity. transitivity (dst g3 e). - eapply fr_O_dst_unchanged_field; eauto. + simpl. intuition auto with *. rewrite Zlength_correct. apply inj_lt. apply H3. left; reflexivity. + apply H7. left; reflexivity. - apply IHl; auto. + eapply fr_graph_has_v; eauto. + erewrite <- fr_raw_mark; eauto. + erewrite <- fr_raw_tag; eauto. + intros. erewrite <- fr_raw_fields; eauto. apply H3. right; assumption. + erewrite <- fr_graph_has_gen; eauto. + eapply fr_graph_has_v; eauto. + intros. apply H7. right; assumption. 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