proposition: Lemma lacv_gen_start: forall g v to n, graph_has_gen g to -> gen_start (lgraph_add_copied_v g v to) n = gen_start g n.
proof: Proof. intros. unfold gen_start. do 2 if_tac. - destruct (Nat.eq_dec n to). + subst n. unfold nth_gen. simpl. rewrite cvmgil_eq by assumption. simpl. reflexivity. + rewrite lacv_nth_gen by assumption. reflexivity. - rewrite lacv_graph_has_gen in H0 by assumption. contradiction. - exfalso. apply H0. rewrite lacv_graph_has_gen; assumption. - reflexivity. 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