AFTD Auto-Formalizing Theoretical Domains

fin_three_not_forall_eq_or_eq

theoremverified

Two elements of Fin 3 never exhaust it.

Statement

theorem fin_three_not_forall_eq_or_eq : ∀ x y : Fin 3, ¬ ∀ s : Fin 3, s = x ∨ s = y
Source
Helper for simple_graph_cycle_power_three_cover_three_tight_dvd (thread RT-1, the k = 3 case of OP-205, arXiv:2610.15635).
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

The proof, explained

The theorem is proved by exhaustive finite case analysis. There are only three elements in Fin 3, giving 3 × 3 = 9 possible choices for the pair (x, y). For every choice, Lean's `decide` tactic verifies by direct computation that the remaining element of Fin 3 is equal to neither x nor y, disproving the universal claim.

  1. For all x, y ∈ Fin 3, there exists an element s ∈ Fin 3 such that s ≠ x and s ≠ y. automation

    We introduce arbitrary elements x and y from Fin 3 and exhaust all possibilities using `fin_cases`. Since Fin 3 contains only three elements, there are 3 × 3 = 9 possible pairs for (x, y). For each pair, the claim that every element s ∈ Fin 3 equals x or y is a finite, decidable statement. The `decide` tactic evaluates this statement by exhaustive check over all s ∈ Fin 3, confirms it evaluates to false (as at least one element is omitted in each case), and thereby proves its negation.

    line 2

      intro x y; fin_cases x <;> fin_cases y <;> decide

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem fin_three_not_forall_eq_or_eq : ∀ x y : Fin 3, ¬ ∀ s : Fin 3, s = x ∨ s = y := by  intro x y; fin_cases x <;> fin_cases y <;> decide
See it in the graphDiscuss this resultChallenge it