fin_three_false_of_four_pairwise_ne
Fin 3 has no four pairwise distinct elements.
Statement
theorem fin_three_false_of_four_pairwise_ne :
∀ w x y z : Fin 3, w ≠ x → w ≠ y → w ≠ z → x ≠ y → x ≠ z → y ≠ z → False- 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 is an instance of the pigeonhole principle: a three-element set cannot contain four pairwise distinct elements. The proof proceeds by exhaustive finite case analysis. After introducing the four elements w, x, y, z ∈ Fin 3, it considers all 3⁴ = 81 possible valuations across the four variables, and in each case the `decide` tactic verifies that at least two variables coincide, contradicting one of the assumed inequalities.
No four elements in Fin 3 can be pairwise distinct (False is derived). automation
We introduce the four elements w, x, y, z ∈ Fin 3 together with the six hypotheses asserting they are pairwise distinct. Since Fin 3 has only three elements (0, 1, 2), there are 3⁴ = 81 possible assignments for w, x, y, and z. The proof enumerates these 81 cases using `fin_cases`. In every case, at least two variables are assigned the same value, causing one of the distinctness hypotheses to reduce to c ≠ c for some c ∈ {0, 1, 2}. The `decide` tactic evaluates this false premise by computation and closes every branch.
intro w x y z; fin_cases w <;> fin_cases x <;> fin_cases y <;> fin_cases z <;> decide
- While in textbook mathematics this is an immediate consequence of the pigeonhole principle (since 4 > 3), the formal proof bypasses general cardinality theorems by brute-force exhaustion of all 81 cases using `fin_cases` and `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
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_false_of_four_pairwise_ne : ∀ w x y z : Fin 3, w ≠ x → w ≠ y → w ≠ z → x ≠ y → x ≠ z → y ≠ z → False := by intro w x y z; fin_cases w <;> fin_cases x <;> fin_cases y <;> fin_cases z <;> decide