Proof using.
unfold update_elections_data_appendEntries.
intros.
repeat break_match; auto.
Qed.

(* Specifications: *)
Lemma handleAppendEntries_spec :
forall h st t n pli plt es ci st' m,
handleAppendEntries h st t n pli plt es ci = (st', m) ->
(currentTerm st <= currentTerm st' /\
(forall e,
In e (log st') ->
In e (log st) \/
In e es /\ currentTerm st' = t) /\
~ is_append_entries m).