catch_up_icc_erase_nonempty
theoremverified
When N(N+1)/2 is even and x is in {1, ..., N}, erasing x leaves a nonempty set.
Statement
theorem catch_up_icc_erase_nonempty (N : ℕ) (h_even : Even (N * (N + 1) / 2))
(x : ℕ) (hx : x ∈ Finset.Icc 1 N) :
((Finset.Icc 1 N).erase x).Nonempty- Source
- step towards the Catch-Up conjecture (Catch-Up: A Game in Which the Lead Alternates (Game & Puzzle Design 1(2), 2015), Sec. 3.1; formal-conjectures CatchUpConjecture.lean) (Catch-Up ladder step)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- catch_up_value_aux_icc_erase_ne_loss_iffAfter Player 1 opens with x from {1, ..., N} (with even triangular sum), Player 2 does not lose if and only if there exists a response…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- For any N with even triangular number and any x in {1, ..., N}, the remaining set {1, ..., N} \ {x} is nonempty. -/theorem catch_up_icc_erase_nonempty (N : ℕ) (h_even : Even (N * (N + 1) / 2)) (x : ℕ) (hx : x ∈ Finset.Icc 1 N) : ((Finset.Icc 1 N).erase x).Nonempty := by rw [← Finset.card_pos, Finset.card_erase_of_mem hx, Nat.card_Icc] have : 1 < N := by by_contra! have : N = 1 := by have := (Finset.mem_Icc.mp hx).1.trans (Finset.mem_Icc.mp hx).2 omega subst this exact absurd h_even (by decide) omega