proposition: Lemma fr_raw_fields: forall depth from to p g g', graph_has_gen g to -> forward_relation from to depth p g g' -> forall v, graph_has_v g v -> raw_fields (vlabel g v) = raw_fields (vlabel g' v).
proof: Proof. intros. remember (fun (g: LGraph) (v: VType) (x: nat) => graph_has_v g v) as Q. remember (fun (g1 g2: LGraph) v => raw_fields (vlabel g1 v) = raw_fields (vlabel g2 v)) as P. remember (fun (x1 x2: nat) => True) as R. pose proof (fr_general_prop depth from to p g g' _ Q P R). subst Q P R. apply H2; clear H2; intros; try assumption; try reflexivity. - rewrite H2. apply H3. - rewrite <- lcv_raw_fields; [reflexivity | assumption..]. - apply (fr_graph_has_v _ _ _ _ _ _ H2 H3 _ H4). - apply lcv_graph_has_v_old; 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