Proof using.
unfold logs_sorted_nw. intros. simpl in *.
find_apply_hyp_hyp. intuition eauto.
Qed.

Theorem logs_sorted_nw_no_append_entries :
forall net ps' l st',
logs_sorted_nw net ->
(forall p, In p ps' -> In p (nwPackets net) \/ In p l) ->
(forall p, In p l -> ~ is_append_entries (pBody p)) ->
logs_sorted_nw (mkNetwork ps' st').