catch_up_best_map_eq_win_iff
theoremverified
The best outcome over a mapped list is a win if and only if some element maps to a win.
Statement
theorem catch_up_best_map_eq_win_iff {α : Type*} (l : List α) (c : α → CatchUpOutcome) : CatchUpOutcome.best (l.map c) = .win ↔ ∃ x ∈ l, c x = .win
- 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
Quot.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_winUnder Catch-Up's best-outcome aggregation on a list of outcomes, the aggregated outcome is a win if and only if a win appears in the list.
- Used by 1
- catch_up_search_eqFor every fuel n, list l, scores and opening flag, the pruned search with flag true returns true exactly when the computable mirror's…
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.
/-- `best` over a mapped list is a win iff some element maps to a win. -/theorem catch_up_best_map_eq_win_iff {α : Type*} (l : List α) (c : α → CatchUpOutcome) : CatchUpOutcome.best (l.map c) = .win ↔ ∃ x ∈ l, c x = .win := by rw [catch_up_outcome_best_eq_win, List.mem_map]