AFTD Auto-Formalizing Theoretical Domains

catch_up_best_map_ne_loss_iff

theoremverified

The best outcome over a mapped list is not a loss if and only if some element maps to something other than a loss.

Statement

theorem catch_up_best_map_ne_loss_iff {α : Type*} (l : List α) (c : α → CatchUpOutcome) :
    CatchUpOutcome.best (l.map c) ≠ .loss ↔ ∃ x ∈ l, c x ≠ .loss
Source
step towards the kernel checks catch_up_value_icc_four/seven/eight/eleven (Catch-Up: A Game in Which the Lead Alternates (Game & Puzzle Design 1(2), 2015), Table 2; computable mirror and pruned search of catch_up_value_aux)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • CatchUpOutcomeThe three possible outcomes of a game of Catch-Up, from the point of view of a fixed player: win, loss, draw.
  • CatchUpOutcome.bestGiven a list of outcomes, the best one for the player who chooses, under the order win > draw > loss (and loss if the list is empty).
  • 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…
Used by 5

Lean source view module on GitHub

/-- `best` over a mapped list is not a loss iff some element does not map to a loss. -/theorem catch_up_best_map_ne_loss_iff {α : Type*} (l : List α) (c : α → CatchUpOutcome) :    CatchUpOutcome.best (l.map c) ≠ .loss ↔ ∃ x ∈ l, c x ≠ .loss := by  rw [Ne, catch_up_outcome_best_eq_loss]  simp only [List.mem_map, forall_exists_index, and_imp, forall_apply_eq_imp_iff₂, not_forall,    exists_prop]
See it in the graphDiscuss this resultChallenge it