proposition: Lemma fgc_nbe_no_edge2gen: forall g n, firstn_gen_clear g n -> no_backward_edge g -> no_edge2gen g n.
proof: Proof. intros. red in H, H0 |-* . intros. red. intros. destruct H2. simpl in *. destruct (lt_eq_lt_dec another n) as [[?|?]|?]. 2: contradiction. - specialize (H _ l). red in H. destruct H2. simpl in *. red in H4. rewrite H in H4. lia. - assert (another > n) by lia. specialize (H0 _ _ H4). apply H0. split; simpl; 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