proposition: Lemma lgd_forward_condition: forall g t_info v to v' e, vgeneration v <> to -> graph_has_v g v -> graph_has_v g v' -> forward_condition g t_info (vgeneration v) to -> forward_condition (labeledgraph_gen_dst g e v') t_info (vgeneration v) to.
proof: Proof. intros. destruct H2 as [? [? [? [? ?]]]]. split; [|split; [|split; [|split]]]. - apply lgd_enough_space_to_copy; assumption. - apply lgd_graph_has_gen; assumption. - apply lgd_graph_has_gen; assumption. - apply lgd_copy_compatible; assumption. - apply lgd_no_dangling_dst; 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