Proof using.
start.
eapply candidateEntries_ext; eauto.
repeat find_higher_order_rewrite.
assert (candidateEntries e (nwState net)).
{ destruct_update; eauto. }
unfold candidateEntries in *.
break_exists. break_and.
exists x.
update_destruct; rewrite_update; simpl; [|auto].
subst. split; [auto|].
find_apply_lem_hyp handleAppendEntriesReply_type_term.
break_or_hyp; break_and.
- repeat find_rewrite. auto.
- unfold not. intros. find_rewrite. discriminate.
Qed.

Lemma allEntries_candidateEntries_request_vote :
refined_raft_net_invariant_request_vote allEntries_candidateEntries.