(* Blocks that are not mapped by f are set to empty permission. This makes the invariant preservation easier. *)
Definition projectMap (f : memren) (pmap : access_map) : access_map :=
(pmap#1, Maps.PTree.fold (fun acc b bperm =>
match f b with
| Some b' =>
Maps.PTree.set b' bperm acc
| None =>
acc end)
pmap.2 (Maps.PTree.empty _)).

Lemma ev_sim_incr:
forall f f' ev ev'
(Hincr: ren_incr f f')
(Hinjective: forall b1 b1' b2,
f' b1 = Some b2 ->
f' b1' = Some b2 ->
b1 = b1')
(Hev_sim: event_sim f ev ev'),
event_sim f' ev ev'.