proposition: Lemma data_at_tarray_field_compatible0: forall sh t s r, data_at sh (tarray t (Zlength s)) s r = !! field_compatible0 (tarray t (Zlength s)) [] r && data_at sh (tarray t (Zlength s)) s r.
proof: Proof. intros. apply pred_ext. apply andp_right; auto. unfold data_at, field_at. apply andp_left1. apply prop_derives. unfold field_compatible, field_compatible0. intuition. apply andp_left2; auto. Qed.
imports: VST.veric.compcert_rmaps VST.msl.shares VST.msl.wand_frame VST.concurrency.conclib CertiGraph.lib.List_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.ramification_lemmas CertiGraph.graph.graph_model CertiGraph.CertiGC.GCGraph CertiGraph.CertiGC.env_graph_gc CertiGraph.msl_ext.iter_sepcon Coq.Lists.List