Proof using.
intros.
update_destruct_simplify_hyp.
- unfold update_elections_data_timeout. repeat break_match; auto.
- auto.
Qed.

Lemma handleTimeout_sends_RV :
forall h st out st' l m,
handleTimeout h st = (out, st', l) ->
In m l ->
exists node t h mi mt,
m = (node, RequestVote t h mi mt).