proposition: Lemma fr_right_roots_graph_compatible: forall depth from to e g g' roots, graph_has_gen g to -> forward_p_compatible (inr e) roots g from -> forward_relation from to depth (forward_p2forward_t (inr e) [] g) g g' -> roots_graph_compatible roots g -> roots_graph_compatible roots g'.
proof: Proof. intros. simpl in H1, H0. destruct e. destruct H0 as [_ [_ [? _]]]. rewrite H0 in H1. simpl in H1. remember (fun (g: LGraph) (v: nat) (x: nat) => True) as Q. remember (fun g1 g2 (x: nat) => roots_graph_compatible roots g1-> roots_graph_compatible roots g2) as P. remember (fun (x1 x2: nat) => True) as R. pose proof (fr_general_prop depth from to (field2forward (Znth z (make_fields g v))) g g' _ Q P R). subst Q P R. apply H3; clear H3; intros; try assumption; try reflexivity. - apply H4, H3. assumption. - apply lcv_rgc_unchanged; 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