proposition: Lemma remove_ve_elabel_unchanged: forall g gen e, elabel (remove_nth_gen_ve g gen) e = elabel g e.
proof: Proof. intros. unfold remove_nth_gen_ve. remember (map (fun idx : nat => (gen, idx)) (nat_inc_list (number_of_vertices (nth_gen g gen)))). clear Heql. revert g e. induction l; intros; simpl. 1: reflexivity. rewrite IHl. reflexivity. 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