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

Lemma votesWithLog_update_elections_data_append_entries :
forall h st t n pli plt es ci st' ps t' h' l',
handleAppendEntries h (snd st) t n pli plt es ci = (st', ps) ->
In (t', h', l') (votesWithLog (update_elections_data_appendEntries h st t n pli plt es ci)) ->
In (t', h', l') (votesWithLog (fst st)).