Proof using.
unfold refined_raft_net_invariant_append_entries_reply, prevLog_candidateEntriesTerm.
simpl. intros.
find_apply_hyp_hyp. break_or_hyp.
- find_eapply_lem_hyp app_cons_in_rest; [|solve[eauto]].
eapply candidateEntriesTerm_ext; eauto.
eauto using handleAppendEntriesReply_preserves_candidateEntriesTerm.
- find_apply_lem_hyp in_map_iff. break_exists. break_and.
find_apply_lem_hyp handleAppendEntriesReply_packets.
subst. simpl in *. intuition.
Qed.

Lemma update_elections_data_requestVote_cronies_same :
forall h h' t lli llt st,
cronies (update_elections_data_requestVote h h' t h' lli llt st) =
cronies (fst st).