Proof using.
unfold refined_raft_net_invariant_init, prevLog_candidateEntriesTerm.
simpl. intuition.
Qed.

(* Specifications: *)
Lemma candidateEntriesTerm_ext : forall t sigma sigma',
(forall h, sigma' h = sigma h) ->
candidateEntriesTerm t sigma ->
candidateEntriesTerm t sigma'.