Proof using.
intros. unfold handleAppendEntries in *.
repeat break_match; find_inversion;
intuition; break_exists; congruence.
Qed.

Lemma handleAppendEntries_clientCache:
forall h st (d : raft_data)
(m : msg) (t : term) (n : name) (pli : logIndex)
(plt : term) (es : list entry) (ci : logIndex),
handleAppendEntries h st t n pli plt es ci = (d, m) ->
clientCache d = clientCache st.