proposition: Lemma lacv_outlier_compatible: forall (g : LGraph) outlier (v : VType) (to : nat), graph_has_gen g to -> graph_has_v g v -> outlier_compatible g outlier -> outlier_compatible (lgraph_add_copied_v g v to) outlier.
proof: Proof. intros. intros x ?. apply lacv_graph_has_v_inv in H2. 2: assumption. destruct H2. - rewrite lacv_vlabel_old; [apply H1 | apply graph_has_v_not_eq]; assumption. - subst x. rewrite lacv_vlabel_new. 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