E677 forces every left multiplication to be bijective
OpenFiniteMagmaE677.left_bijectivee255e677equational-theoriesfinite-magma
Let be a finite (possibly empty) type with arbitrary total operation . If E677 holds, then
This is the left-multiplication statement corresponding to part (i) of Lemma 13.1.
Preamble
import Definitions.Def_FiniteMagmaE677 universe u
Formal statement
theorem FiniteMagmaE677.left_bijective {α : Type u} [Fintype α] (op : α → α → α)
(h : FiniteMagmaE677.E677 op) (y : α) : Function.Bijective (op y) := by sorrySource
Equational Theories Project, online proof blueprint, Chapter 13, Lemma 13.1, https://teorth.github.io/equational_theories/blueprint/677-chapter.html, part (i)
Read-back
What the Lean code literally says, in plain math · gpt-5.6-luna
For every universe u, finite type equipped with a Fintype instance (possibly empty), arbitrary binary operation , and proposition h asserting that for all , , and every , the unary map is bijective from to : it is injective, so implies , and surjective, so every has some with ; when is empty, the quantification over y is vacuous.