proposition: Lemma lcv_closure_has_v: forall g v to x, graph_has_gen g to -> closure_has_v g x -> closure_has_v (lgraph_copy_v g v to) x.
proof: Proof. intros. unfold closure_has_v in *. destruct x as [gen index]. simpl in *. destruct H0. split. 1: rewrite <- lcv_graph_has_gen; assumption. destruct (Nat.eq_dec gen to). - subst gen. red. unfold nth_gen. simpl. rewrite cvmgil_eq by assumption. simpl. red in H1. unfold nth_gen in H1. lia. - red. rewrite lcv_nth_gen; 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