Proof using.
destruct l; simpl; eauto.
Qed.

(* Specifications: *)
Lemma maxIndex_zero_or_entry :
forall l,
maxIndex l = 0 \/ exists e, In e l /\ eIndex e = maxIndex l.
Theorem leader_completeness_directly_committed_invariant :
forall net,
refined_raft_intermediate_reachable net ->
leader_completeness_directly_committed net.