Proof using.
unfold doLeader.
intros.
repeat break_match; repeat find_inversion; auto.
Qed.

(* Specifications: *)
Lemma fold_left_maximum_le' :
forall l x y,
x <= y ->
x <= fold_left max l y.
Lemma leaderLogs_entries_match_do_leader :
refined_raft_net_invariant_do_leader leaderLogs_entries_match.
Lemma handleAppendEntriesReply_same_log :
forall n st src t es b st' l,
handleAppendEntriesReply n st src t es b = (st', l) ->
log st' = log st.