(** * Lemmas about the Dry Machine*)
From mathcomp.ssreflect Require Import ssreflect ssrbool ssrnat seq ssrfun eqtype fintype finfun.
Set Implicit Arguments.
(*NOTE: because of redefinition of [val], these imports must appear after Ssreflect eqtype.*)
(* Require Import compcert.common.Events. *)
Global Notation "a # b" := (Maps.PMap.get b a) (at level 1).
(** This file holds various results about the dry machine*)
(* Find other lemmas in dry_machine_step_lemmas.v        *)
Module ThreadPoolWF.
Section ThreadPoolWF.
Context {Sem : Semantics}.
Existing Instance DryHybridMachine.dryResources.
Existing Instance OrdinalPool.OrdinalThreadPool.
(** Take an instance of the Dry Machine *)
Existing Instance DryHybridMachine.DryHybridMachineSig.

Lemma invariant_freeable_empty_locks:
forall tp i (cnti: containsThread tp i) b ofs
(Hinv: invariant tp)
(Hfreeable: (getThreadR cnti).1 !! b ofs = Some Freeable),
forall laddr rmap,
lockRes tp laddr = Some rmap ->
rmap.1 !! b ofs = None /\
rmap.2 !! b ofs = None.