(********************* Lemmas and definitions related to mem_step ********)
apply (mem_step_freelist _ _ nil); trivial.
Qed.
Record memstep_preserve (P:mem -> mem -> Prop) :=
{
preserve_trans: forall m1 m2 m3, P m1 m2 -> P m2 m3 -> P m1 m3;
preserve_mem: forall m m', mem_step m m' -> P m m'
}.
subst; trivial. Qed.
intros. apply preserve_mem; trivial.
eapply mem_forward_preserve; trivial.
Qed.
constructor.
+ intros. xomega.
+ induction 1.
- apply Mem.nextblock_storebytes in H;
rewrite H; xomega.
- apply Mem.nextblock_alloc in H.
rewrite H. clear. xomega.
- apply nextblock_freelist in H.
rewrite H; xomega.
- xomega.
Qed.
*)
(* Theorem loadbytes_drop m b lo hi p m' (D:Mem.drop_perm m b lo hi p = Some m'): forall b' ofs, b' <> b \/ ofs < lo \/ hi <= ofs \/ perm_order p Readable -> Mem.loadbytes m' b' ofs 1 = Mem.loadbytes m b' ofs 1. *)

Lemma ple_store:
forall ch m v1 v2 m' m1
(PLE: perm_lesseq m m1),
Mem.storev ch m v1 v2 = Some m' ->
exists m1', perm_lesseq m' m1' /\ Mem.storev ch m1 v1 v2 = Some m1'.