Proof using.
unfold locks_correct_locked, valid_locked.
intuition.
break_exists.
exists x.
intuition.
- firstorder.
- now rewrite_update.
Qed.

Lemma locks_correct_locked_net_handlers_old :
forall p sigma u st' out ms q,
NetHandler (pDst p) (pSrc p) (pBody p) (sigma (pDst p)) = (u, out, st', ms) ->
locks_correct sigma ->
locks_correct_locked sigma q ->
LockServ_network_network_invariant p q ->
locks_correct_locked (update name_eq_dec sigma (pDst p) st') q.