AFTD Auto-Formalizing Theoretical Domains

bmi_elements_satisfiable

theoremverified

There exists a magma with an element that is simultaneously a $B$-element, an $M$-element, an $I$-element, and a $Y$-element (witnessed by the one-element magma).

Statement

theorem bmi_elements_satisfiable : ∃ (A : Type) (_ : Mul A) (e : A),
    bmi_is_b_element e ∧ bmi_is_m_element e ∧ bmi_is_i_element e ∧ bmi_is_y_element e
Source
folklore
Verified
28 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 4
  • 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_m_elementAn element $M$ in a magma $(A, \cdot)$ is an $M$-element if $Mx = xx$ for all $x \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$.
  • bmi_is_y_elementAn element $Y$ in a magma $(A, \cdot)$ is a $Y$-element (fixed-point element) if $Yx = x(Yx)$ for all $x \in A$.

Read back from the Lean

There exist a type A, an instance of Mul A (a binary multiplication operation on A), and an element e : A such that e is simultaneously a B-element, an M-element, an I-element, and a Y-element.

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

The existence claim is proved by exhibiting the one-element magma `Unit` with its sole element `()`. Because every element of `Unit` is equal to `()`, all four algebraic equations hold trivially by reflexivity (`rfl`).

  1. The singleton type `Unit` equipped with its unique element `()` satisfies all four conditions.

    We instantiate the existential quantifiers with the type `Unit`, the canonical multiplication instance on `Unit` found by typeclass inference (`inferInstance`), and the unique element `() : Unit`. The four conjunction components—the properties of being a $B$-, $M$-, $I$-, and $Y$-element—each require proving an equality between elements of `Unit` for arbitrary inputs. Since `Unit` has only one element, both sides of every such equation evaluate definitionally to `()`, and each property is verified by a function returning `rfl`.

    line 3

    uses rfl

        bmi_is_b_element e ∧ bmi_is_m_element e ∧ bmi_is_i_element e ∧ bmi_is_y_element e := ⟨Unit, inferInstance, (), fun _ _ _ => rfl, fun _ => rfl, fun _ => rfl, fun _ => rfl⟩
rfl
Every element is equal to itself (reflexivity of equality).

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The one-element magma has an element that is simultaneously a B-, M-, I-, and Y-element. -/theorem bmi_elements_satisfiable : ∃ (A : Type) (_ : Mul A) (e : A),    bmi_is_b_element e ∧ bmi_is_m_element e ∧ bmi_is_i_element e ∧ bmi_is_y_element e := ⟨Unit, inferInstance, (), fun _ _ _ => rfl, fun _ => rfl, fun _ => rfl, fun _ => rfl⟩
See it in the graphDiscuss this resultChallenge it