proposition: Lemma firstn_gen_clear_add: forall g gi i, graph_has_gen g (Z.to_nat i) -> firstn_gen_clear g (Z.to_nat i) -> firstn_gen_clear (lgraph_add_new_gen g gi) (Z.to_nat i).
proof: Proof. intros. unfold firstn_gen_clear, graph_gen_clear in *. intros. specialize (H0 _ H1). rewrite ang_nth_old; auto. unfold graph_has_gen in *. lia. 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