Proof using.
induction ll; intros; simpl in *; intuition;
repeat break_match; repeat find_inversion; simpl in *; intuition.
Qed.

Lemma contradicting_leader_logs_complete :
forall net nodes h t e l t',
In h nodes ->
In (t', l) (contradicting_leader_logs_on_leader (leaderLogs (fst (nwState net h))) t e) ->
In (t', h, l) (contradicting_leader_logs net nodes t e).