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

(* Specifications: *)
Lemma prefix_within_term_inductive_request_vote_reply :
refined_raft_net_invariant_request_vote_reply prefix_within_term_inductive.
Lemma handleAppendEntriesReply_entries :
forall h st t h' pli plt es ci st' t' es',
handleAppendEntries h st t h' pli plt es ci =
(st', AppendEntriesReply t' es' true) ->
t' = t /\ es' = es /\ (forall e, In e es -> In e (log st') \/ haveNewEntries st es = false /\ log st' = log st).