bi_left_translation_surj_step
In any magma with a B-element B and an I-element I, for any element a, the left translation by ((B * a) * I) coincides with the left translation by a: ((B * a) * I) * x = a * x for all x.
Statement
theorem bi_left_translation_surj_step {A : Type*} [Mul A] (B I : A) (hB : bmi_is_b_element B) (hI : bmi_is_i_element I) (a : A) : ∀ x : A, (B * a * I) * x = a * x
- Source
- arXiv:2610.37108 Proposition 3.1
- Verified
- 31 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- bmi_is_b_elementAn element $B$ in a magma $(A, \cdot)$ is a $B$-element if $((Bx)y)z = x(yz)$ for all $x, y, z \in A$.
- bmi_is_i_elementAn element $I$ in a magma $(A, \cdot)$ is an $I$-element (a left unit) if $Ix = x$ for all $x \in A$.
- Used by 1
- finite_bi_algebra_is_semigroup_with_left_unitsEvery finite BI-algebra is a semigroup with B and I as left units: let (A, ·) be a finite magma equipped with elements B, I in A such that…
Read back from the Lean
Let $A$ be a type equipped with a multiplication operation ($*$). Let $B, I \in A$ such that: 1. $B$ satisfies $\forall x\ y\ z : A, ((B * x) * y) * z = x * (y * z)$, and 2. $I$ satisfies $\forall x : A, I * x = x$. Then for any element $a \in A$ and all $x \in A$, $((B * a) * I) * x = a * x$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that left translation by $(B \cdot a) \cdot I$ equals left translation by $a$, we evaluate the expression on an arbitrary element $x$. By the definition of a B-element, $((B \cdot a) \cdot I) \cdot x$ associates as $a \cdot (I \cdot x)$. The defining property of the I-element then simplifies $I \cdot x$ to $x$, yielding $a \cdot x$.
It suffices to show that $((B \cdot a) \cdot I) \cdot x = a \cdot x$ for an arbitrary element $x \in A$.
We introduce an arbitrary element $x$ of the magma $A$ to prove the universally quantified equation.
intro x$((B \cdot a) \cdot I) \cdot x = a \cdot x$
Applying the defining property of the B-element $B$ (hypothesis `hB`) with arguments $a$, $I$, and $x$ transforms the left-hand side $((B \cdot a) \cdot I) \cdot x$ into $a \cdot (I \cdot x)$. Then, applying the defining property of the I-element $I$ (hypothesis `hI`) reduces $I \cdot x$ to $x$, leaving $a \cdot x$.
uses
hB,hIrw [hB, hI]
hB- The assumption that $B$ is a B-element: for all $x, y, z$, $(B \cdot x \cdot y) \cdot z = x \cdot (y \cdot z)$.
hI- The assumption that $I$ is an I-element: for all $x$, $I \cdot x = x$.
- In Lean, the `rw` tactic automatically attempts to close the goal by reflexivity after performing the rewrites, which closes the final equality `a * x = a * x`.
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.
/-- In a magma with a B-element and an I-element, ((Ba)I)x = ax for all x. -/theorem bi_left_translation_surj_step {A : Type*} [Mul A] (B I : A) (hB : bmi_is_b_element B) (hI : bmi_is_i_element I) (a : A) : ∀ x : A, (B * a * I) * x = a * x := by intro x rw [hB, hI]