(*+ Collection of disjoint maps *)
(** For the proof of composition of safety, we need to maintain the invariants "all the maps are disjoint*" which is why we need this section.  * pairwise-disjointness is equivalent to arbitrary disjointness because the permissions are "set-theoretical" *)
Definition sameperms (m n : map) := forall x, m x = None <-> n x = None.

Lemma sameperms_joins m m' n : sameperms m m' -> joins m n -> joins m' n.
Hint Resolve sameperms_updatemap.