catch_up_outcome_best_eq_loss
theoremverified
Under 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 is a loss.
Statement
theorem catch_up_outcome_best_eq_loss (os : List CatchUpOutcome) :
CatchUpOutcome.best os = CatchUpOutcome.loss ↔ ∀ o ∈ os, o = CatchUpOutcome.loss- Source
- google-deepmind/formal-conjectures, FormalConjectures/Paper/CatchUpConjecture.lean
- Verified
- 01 Oct 2026
- Axioms
propext- Built on 4
- 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.
- catch_up_outcome_best_eq_drawUnder Catch-Up's best-outcome aggregation on a list of outcomes, the aggregated outcome is a draw if and only if no win appears in the…
- Used by 7
- catch_up_outcome_best_eq_iteThe best outcome of a list depends only on which outcomes occur in it: win if a win occurs, otherwise draw if a draw occurs, otherwise loss.
- catch_up_best_map_ne_loss_iffThe best outcome over a mapped list is not a loss if and only if some element maps to something other than a loss.
- catch_up_value_aux_ne_loss_iff_exists_ne_winFor 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…
- catch_up_value_eq_loss_iffFor any nonempty finite set S of natural numbers, the game value catch_up_value S is CatchUpOutcome.loss if and only if for every element…
- catch_up_value_aux_ne_loss_of_ne_winIn Catch-Up from equal scores 0, if an opening move x in S leads to a position where the second player does not win, then the first player…
- catch_up_value_triple_win_of_sum_gtFor any natural numbers x < y < z such that x + y > z, the game value of Catch-Up played on the three-element set {x, y, z} is…
- catch_up_value_aux_ne_loss_iffIn Catch-Up with nonempty remaining pieces and score plus remaining sum at least opponent's score, the mover does not lose if and only if…
Read back from the Lean
For any list of CatchUpOutcome values os, CatchUpOutcome.best os equals CatchUpOutcome.loss if and only if every element o in os is equal to CatchUpOutcome.loss.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
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.
/-- The aggregated outcome of a list under CatchUpOutcome.best is a loss if and only if every outcome in the list is a loss. -/theorem catch_up_outcome_best_eq_loss (os : List CatchUpOutcome) : CatchUpOutcome.best os = CatchUpOutcome.loss ↔ ∀ o ∈ os, o = CatchUpOutcome.loss := by have h_loss (o : CatchUpOutcome) : o = CatchUpOutcome.loss ↔ o ≠ CatchUpOutcome.win ∧ o ≠ CatchUpOutcome.draw := by cases o <;> simp rw [h_loss] change (¬ CatchUpOutcome.best os = CatchUpOutcome.win) ∧ (¬ CatchUpOutcome.best os = CatchUpOutcome.draw) ↔ _ rw [catch_up_outcome_best_eq_win, catch_up_outcome_best_eq_draw] constructor · rintro ⟨h1, h2⟩ o ho have hne_win : o ≠ CatchUpOutcome.win := by rintro rfl exact h1 ho have hne_draw : o ≠ CatchUpOutcome.draw := by rintro rfl apply h2 exact ⟨h1, ho⟩ rw [h_loss] exact ⟨hne_win, hne_draw⟩ · intro h constructor · intro hwin have := h CatchUpOutcome.win hwin contradiction · rintro ⟨-, hdraw⟩ have := h CatchUpOutcome.draw hdraw contradiction