proposition: Lemma lgd_outlier_compatible: forall (g : LGraph) e (v' : VType) outlier, outlier_compatible g outlier -> outlier_compatible (labeledgraph_gen_dst g e v') outlier.
proof: Proof. intros. intro v. intros. rewrite <- lgd_graph_has_v in H0. unfold labeledgraph_gen_dst, pregraph_gen_dst, updateEdgeFunc; simpl. apply (H v H0). 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