AFTD Auto-Formalizing Theoretical Domains

is_L_pattern

def

A list of natural numbers β is an L-pattern if β is nonempty and every element of β is less than or equal to its head.

Statement

def is_L_pattern (β : List ℕ) : Prop
Defined in
arXiv:2610.37940 Section 6.3
Verified
31 Oct 2026
Axioms
none listed

Read back from the Lean

For a list of natural numbers β, is_L_pattern β asserts that β is non-empty and every element of β is less than or equal to the first element (head) of β (i.e., there exists a proof h : β ≠ [] such that for all x ∈ β, x ≤ β.head h).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- An L-pattern is a nonempty list of natural numbers whose maximum entry is at the leftmost position. -/
def is_L_pattern (β : List ℕ) : Prop := ∃ h : β ≠ [], ∀ x ∈ β, x ≤ β.head h
See it in the graphDiscuss this resultChallenge it