proposition: Lemma lacv_copy_compatible: forall (g : LGraph) (v : VType) (to : nat), raw_mark (vlabel g v) = false -> graph_has_gen g to -> copy_compatible g -> copy_compatible (lgraph_add_copied_v g v to).
proof: Proof. repeat intro. destruct (V_EqDec v0 (new_copied_v g to)). - unfold equiv in e. subst v0. rewrite lacv_vlabel_new in *. rewrite H3 in H. inversion H. - assert (v0 <> (new_copied_v g to)) by intuition auto. clear c. rewrite lacv_vlabel_old in * by assumption. assert (graph_has_v g v0). { apply lacv_graph_has_v_inv in H2. 2: assumption. destruct H2. 1: assumption. contradiction. } split. + apply lacv_graph_has_v_old; [|apply H1]; assumption. + apply H1; 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