Proof using.
intros. unfold handleRequestVote, advanceCurrentTerm in *.
repeat break_match; find_inversion; subst; auto;
intuition; break_exists; congruence.
Qed.

Theorem handleClientRequest_no_append_entries :
forall h st client id c out st' ps m,
handleClientRequest h st client id c = (out, st', ps) ->
In m ps ->
~ is_append_entries (snd m).