Proof using.
intros. unfold handleAppendEntries in *.
repeat break_match; find_inversion; congruence.
Qed.

(* Specifications: *)
Lemma update_elections_data_appendEntries_allEntries :
forall h st t h' pli plt es ci e,
In e (map snd (allEntries (update_elections_data_appendEntries h st t h' pli plt es ci))) ->
In e (map snd (allEntries (fst st))) \/ In e es.