Proof using.
unfold candidateEntries.
intuition.
break_exists_exists.
intuition;
repeat find_higher_order_rewrite; auto.
Qed.

Lemma candidateEntries_same :
forall (st st' : name -> _) e,
candidateEntries e st ->
(forall h, cronies (fst (st' h)) = cronies (fst (st h))) ->
(forall h, currentTerm (snd (st' h)) = currentTerm (snd (st h))) ->
(forall h, type (snd (st' h)) = type (snd (st h))) ->
candidateEntries e st'.