Proof using.
unfold tryToBecomeLeader.
intros. find_inversion. auto.
Qed.

(* Specifications: *)
Lemma handleRequestVote_clientCache :
forall n st t c li lt st' ms,
handleRequestVote n st t c li lt = (st', ms) ->
clientCache st' = clientCache st.
Lemma handleRequestVote_stateMachine :
forall n st t c li lt st' ms,
handleRequestVote n st t c li lt = (st', ms) ->
stateMachine st' = stateMachine st.
Lemma handleRequestVote_same_log :
forall n st t c li lt st' ms,
handleRequestVote n st t c li lt = (st', ms) ->
log st' = log st.
Lemma handleRequestVote_same_lastApplied :
forall n st t c li lt st' ms,
handleRequestVote n st t c li lt = (st', ms) ->
lastApplied st' = lastApplied st.