Proof using.
start. contradiction.
Qed.

(* Specifications: *)
Lemma one_leaderLog_per_term_unchanged :
forall net st' ps' h gd d,
one_leaderLog_per_term net ->
(forall h' : Net.name, st' h' = update name_eq_dec (nwState net) h (gd, d) h') ->
leaderLogs gd = leaderLogs (fst (nwState net h)) ->
one_leaderLog_per_term {| nwPackets := ps'; nwState := st' |}.
Lemma allEntries_candidateEntries_client_request :
refined_raft_net_invariant_client_request allEntries_candidateEntries.
Lemma leaderLogs_candidateEntries_client_request :
refined_raft_net_invariant_client_request leaderLogs_candidateEntries.