Proof using.
unfold locks_correct_unlock.
intuition. congruence.
Qed.

(* Specifications: *)
Lemma locks_correct_unlock_sent_locked :
forall sigma p,
pBody p = Locked ->
locks_correct_unlock sigma p.
Lemma locks_correct_unlock_input_handlers_old :
forall h i sigma u st' out ms p,
InputHandler h i (sigma h) = (u, out, st', ms) ->
locks_correct sigma ->
locks_correct_unlock sigma p ->
locks_correct_unlock (update name_eq_dec sigma h st') p.
Lemma locks_correct_unlock_sent_locked :
forall sigma p,
pBody p = Locked ->
locks_correct_unlock sigma p.
Lemma locks_correct_unlock_input_handlers_old :
forall h i sigma u st' out ms p,
InputHandler h i (sigma h) = (u, out, st', ms) ->
locks_correct sigma ->
locks_correct_unlock sigma p ->
locks_correct_unlock (update name_eq_dec sigma h st') p.