fin_three_eq_of_five_ne
In Fin 3, if a, c, d are distinct, b ∉ {c, e}, c ≠ e and a ≠ b, then e = a.
Statement
theorem fin_three_eq_of_five_ne : ∀ a b c d e : Fin 3, a ≠ c → a ≠ d → c ≠ d → b ≠ c → b ≠ e →
c ≠ e → a ≠ b → e = a- 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
- simple_graph_cycle_power_three_cover_three_tight_dvdIf three labellings with clique classes satisfy the tight structure (each distance-3 pair and each distance-2 pair in exactly one layer,…
The proof, explained
The theorem states that in a three-element set, if $a, c, d$ are pairwise distinct, $b$ is distinct from $a$ and $c$, and $e$ is distinct from $b$ and $c$, then $e$ must equal $a$. Conceptually, $a, c, d$ exhaust the entire three-element set, which forces $b = d$ and subsequently forces $e = a$. The formalized proof verifies this by exhaustively checking all $3^5 = 243$ possible assignments to the five variables via case enumeration and simplification.
Let $a, b, c, d, e \in \mathrm{Fin}\, 3$ be arbitrary elements.
We introduce the five variables representing elements of the three-element set $\mathrm{Fin}\, 3$.
intro a b c d eIn all possible assignments of values in $\{0, 1, 2\}$ to the five variables, the hypotheses imply $e = a$. automation
Since $\mathrm{Fin}\, 3$ contains only the elements $0, 1, 2$, cascading case splits on all five variables generate $3^5 = 243$ concrete cases. In each case, simplification evaluates the inequalities: in valid assignments (where all distinctness hypotheses hold), $e$ and $a$ evaluate to the same element; in all other assignments, at least one hypothesis reduces to a contradiction of the form $k \ne k$, discharging the case.
fin_cases a <;> fin_cases b <;> fin_cases c <;> fin_cases d <;> fin_cases e <;> simp
- The Lean proof proceeds by brute-force case exhaustion across all $3^5 = 243$ value assignments rather than the standard conceptual argument (that $a, c, d$ exhaust the three-element set $\mathrm{Fin}\, 3$, which forces $b = d$ and therefore $e = a$).
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
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.
theorem fin_three_eq_of_five_ne : ∀ a b c d e : Fin 3, a ≠ c → a ≠ d → c ≠ d → b ≠ c → b ≠ e → c ≠ e → a ≠ b → e = a := by intro a b c d e fin_cases a <;> fin_cases b <;> fin_cases c <;> fin_cases d <;> fin_cases e <;> simp