Proof using.
unfold candidateEntries.
intuition. break_exists. break_and.
eexists.
repeat find_higher_order_rewrite.
eauto.
Qed.

Lemma won_election_cronies :
forall net h,
cronies_correct net ->
type (snd (nwState net h)) = Leader ->
wonElection (dedup name_eq_dec (cronies (fst (nwState net h))
(currentTerm (snd (nwState net h))))) = true.