proposition: Lemma ang_outlier_compatible: forall g gi out, number_of_vertices gi = O -> outlier_compatible g out -> outlier_compatible (lgraph_add_new_gen g gi) out.
proof: Proof. intros. unfold outlier_compatible in *. intros. apply ang_graph_has_v_inv in H1; auto. simpl. apply H0. 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