Section LeaderLogsSorted.
Context {orig_base_params : BaseParams}.
Context {one_node_params : OneNodeParams orig_base_params}.
Context {raft_params : RaftParams orig_base_params}.
Context {rri : raft_refinement_interface}.
Context {si : sorted_interface}.
Proof using.
unfold refined_raft_net_invariant_init, leaderLogs_sorted.
intros. subst. simpl in *. intuition.
Qed.
Proof using.
unfold update_elections_data_client_request.
intros.
repeat break_match; auto.
Qed.
Proof using.
unfold refined_raft_net_invariant_client_request, leaderLogs_sorted.
intros. subst. simpl in *. find_higher_order_rewrite.
update_destruct_simplify; simpl in *.
- rewrite leaderLogs_update_elections_data_client_request in *.
eauto.
- eauto.
Qed.
Proof using si rri.
intros.
pose proof (lift_prop _ logs_sorted_invariant).
find_insterU. conclude_using eauto.
unfold logs_sorted, logs_sorted_host in *. break_and.
unfold deghost in *. simpl in *. break_match. eauto.
Qed.
Proof using.
unfold update_elections_data_timeout.
intros.
repeat break_match; simpl in *; auto.
Qed.
Proof using.
unfold refined_raft_net_invariant_timeout, leaderLogs_sorted.
intros. subst. simpl in *. find_higher_order_rewrite.
update_destruct_simplify; simpl in *;
try rewrite leaderLogs_update_elections_data_timeout in *;
eauto.
Qed.
Proof using.
unfold update_elections_data_appendEntries.
intros.
repeat break_match; subst; auto.
Qed.
Proof using.
unfold refined_raft_net_invariant_append_entries, leaderLogs_sorted.
intros. subst. simpl in *. find_higher_order_rewrite.
update_destruct_simplify; simpl in *.
- rewrite leaderLogs_update_elections_data_AE in *.
eauto.
- eauto.
Qed.
Proof using.
unfold refined_raft_net_invariant_append_entries_reply, leaderLogs_sorted.
intros. subst. simpl in *. find_higher_order_rewrite.
update_destruct_simplify; simpl in *; eauto.
Qed.
Proof using.
unfold refined_raft_net_invariant_request_vote, leaderLogs_sorted.
intros.
subst. simpl in *. find_higher_order_rewrite.
update_destruct_simplify.
- unfold update_elections_data_requestVote in *.
repeat break_match; simpl in *; intuition; repeat find_inversion; eauto.
- eauto.
Qed.

Lemma leaderLogs_update_elections_data_request_vote_reply :
forall {h st h' t r st'},
handleRequestVoteReply h (snd st) h' t r = st' ->
forall (P : list (term * list entry) -> Prop),
(forall t, P ((t, log (snd st)) :: leaderLogs (fst st))) ->
(P (leaderLogs (fst st))) ->
(P (leaderLogs (update_elections_data_requestVoteReply h h' t r st))).