Proof using.
intros.
unfold update_elections_data_timeout. repeat break_match; simpl; auto.
Qed.

(* Specifications: *)
Lemma prefix_within_term_inductive_timeout :
refined_raft_net_invariant_timeout prefix_within_term_inductive.
Lemma update_elections_data_requestVote_allEntries :
forall h h' t lli llt st,
allEntries (update_elections_data_requestVote h h' t h' lli llt st) =
allEntries (fst st).