Proof using.
red.
unfold CandidateEntries.
unfold candidateEntries_host_invariant, candidateEntries_nw_invariant.
intuition;
repeat match goal with
| [ H : In _ _ |- _ ] => compute in H
end;
intuition.
Qed.

Theorem candidate_entries_invariant :
forall (net : network),
refined_raft_intermediate_reachable net ->
CandidateEntries net.