proposition: Lemma gen2gen_no_edge_reset: forall g gen1 gen2 gen3, gen2gen_no_edge g gen2 gen3 -> gen2gen_no_edge (reset_graph gen1 g) gen2 gen3.
proof: Proof. intros. unfold gen2gen_no_edge. intros. simpl. rewrite remove_ve_dst_unchanged. apply H. rewrite graph_has_e_reset in H0. destruct 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