The fixer candidate is the double left-predecessor of x
ProvedFiniteMagmaE677.fixer_candidate_predecessorequational-theorymagmauniversal-algebra
Let be a finite set with a binary operation satisfying E677, and let . If is any left-predecessor of under , i.e. , then the fixer candidate
satisfies . In particular depends only on , and equation 255 holds at if and only if .
The proof instantiates E677 at , giving , and compares this with , cancelling one .
Preamble
import Definitions.Def_FiniteMagmaE677 import Theorems.Thm_FiniteMagmaE677_left_bijective universe u
Formal statement
theorem FiniteMagmaE677.fixer_candidate_predecessor {α : Type u} [Fintype α]
(op : α → α → α) (h : FiniteMagmaE677.E677 op) (x u : α) (hu : op x u = x) :
op x (op (op x x) x) = u := by sorrySource
Identity noted (as (x ⋄ x) ⋄ x = L_x⁻²(x)) in zjay5's Prove2Me mission comment of 2026-09-22 on 'Equational Magmas: E677 → E255 (finite case)'; proved and published here. Context: Equational Theories Project blueprint Chapter 13, https://teorth.github.io/equational_theories/blueprint/677-chapter.html.