Proof using.
unfold update_elections_data_appendEntries.
intros. break_let. break_match; auto.
break_if; auto.
simpl. intuition.
Qed.

(* Specifications: *)
Lemma ghost_log_allEntries_append_entries :
msg_refined_raft_net_invariant_append_entries' ghost_log_allEntries.
Lemma lifted_transitive_commit_invariant :
forall net h e e' t,
msg_refined_raft_intermediate_reachable net ->
In e (log (snd (nwState net h))) ->
In e' (log (snd (nwState net h))) ->
eIndex e <= eIndex e' ->
lifted_committed net e' t ->
lifted_committed net e t.
Lemma update_elections_data_request_vote_votesWithLog_old :
forall (h : name)
(st : electionsData *
RaftState.raft_data term name entry logIndex serverType data clientId output)
(t : nat) (src : fin N) (lli llt : nat)
(t' : term) (h' : name) (l' : list entry),
In (t', h', l') (votesWithLog (fst st)) ->
In (t', h', l')
(votesWithLog (update_elections_data_requestVote h src t src lli llt st)).