AFTD Auto-Formalizing Theoretical Domains

alpha_lexical_lt_irrefl

theoremverified

The alternating lexical order is irreflexive.

Statement

theorem alpha_lexical_lt_irrefl (a : List ℕ) : ¬ alpha_lexical_lt a a
Source
Run-length helpers for OP-392, arXiv:2610.24758, Conjecture 1; lexical sequences and elementary operations from arXiv:0810.5205, Definitions 1.1, Section 2, Theorem 3.1 and Corollary 3.3. No new research advance is claimed for these supporting statements.
Verified
25 Oct 2026
Axioms
Quot.soundpropext
Built on 2
  • alpha_lexical_ltThe source alternating lexicographic order on positive integer sequences.
  • alpha_signed_cellA cell of a positive sequence, with alternating signs and zero padding.

The proof, explained

The proof proceeds by contradiction. If a list a were strictly less than itself in the alternating lexical order, the definition would require an index i where the list differs from itself. In particular, the i-th signed cell of a would have to be strictly less than itself, which is impossible for any integer.

  1. Assume for contradiction that a is strictly less than itself in the alternating lexical order, yielding a witness index i.

    To prove the negation ¬ alpha_lexical_lt a a, we suppose for contradiction that the relation holds. Unpacking the existential definition gives an index i such that all earlier signed cells agree, while the i-th signed cell of a is strictly less than itself (alpha_signed_cell a i < alpha_signed_cell a i).

    line 2

      rintro ⟨i, hi, hagree, hlt⟩
  2. The strict inequality on the i-th cell produces a contradiction.

    The hypothesis asserts that an integer is strictly less than itself (x < x). The linear integer arithmetic tactic (omega) detects that this is impossible and derives False.

    line 3

      omega

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

theorem alpha_lexical_lt_irrefl (a : List ℕ) : ¬ alpha_lexical_lt a a := by  rintro ⟨i, hi, hagree, hlt⟩  omega
See it in the graphDiscuss this resultChallenge it