AFTD Auto-Formalizing Theoretical Domains

catch_up_value_aux_ne_loss_iff_exists_ne_win

theoremverified

For any nonempty finite set S of pieces, Player 1 does not get outcome loss from equal scores 0 if and only if there exists an opening move x in S after which Player 2 does not get outcome win.

Statement

theorem catch_up_value_aux_ne_loss_iff_exists_ne_win (S : Finset ℕ) (hS : S.Nonempty) :
    catch_up_value_aux S 0 0 false ≠ CatchUpOutcome.loss ↔
      ∃ x ∈ S, catch_up_value_aux (S.erase x) 0 x false ≠ CatchUpOutcome.win
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
Built on 5
  • catch_up_value_aux_zero_zeroFor any nonempty set S of pieces, the auxiliary Catch-Up value from scores (0, 0) is the best outcome among all opening moves x ∈ S.
  • catch_up_outcome_best_eq_lossUnder Catch-Up's best-outcome aggregation on a list of outcomes, the aggregated outcome is a loss if and only if every outcome in the list…
  • CatchUpOutcome.negNegation of an outcome: win and loss are exchanged, draw is fixed. Used when the turn passes to the other player.
  • catch_up_value_auxThe game value of a Catch-Up position for the player about to move. If nothing remains, compare scores. If even all remaining numbers…
  • CatchUpOutcomeThe three possible outcomes of a game of Catch-Up, from the point of view of a fixed player: win, loss, draw.

Lean source view module on GitHub

/-- Player 1 does not lose from the initial position with equal scores 0 if and only if there exists an opening move after which Player 2 does not win. -/theorem catch_up_value_aux_ne_loss_iff_exists_ne_win (S : Finset ℕ) (hS : S.Nonempty) :    catch_up_value_aux S 0 0 false ≠ CatchUpOutcome.loss ↔      ∃ x ∈ S, catch_up_value_aux (S.erase x) 0 x false ≠ CatchUpOutcome.win := by  rw [catch_up_value_aux_zero_zero S hS]  rw [ne_eq, catch_up_outcome_best_eq_loss]  have h_neg (o : CatchUpOutcome) : o.neg = CatchUpOutcome.loss ↔ o = CatchUpOutcome.win := by    cases o <;> decide  simp [h_neg]
See it in the graphDiscuss this resultChallenge it