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.

Lemma leaderLogs_update_elections_data_AE :
forall me st t li pli plt es lci,
leaderLogs (update_elections_data_appendEntries me st t li pli plt es lci) =
leaderLogs (fst st).