proposition: Lemma graph_has_v_not_eq: forall g to x, graph_has_v g x -> x <> new_copied_v g to.
proof: Proof. intros. destruct H. unfold new_copied_v. destruct x as [gen idx]. simpl in *. destruct (Nat.eq_dec gen to). - subst gen. intro S; inversion S. red in H0. lia. - intro S; inversion S. apply n; 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