AFTD Auto-Formalizing Theoretical Domains

word_substrings

def

The set Sub(w) of substrings of a word w of length at least 2.

Statement

def word_substrings {α : Type*} (w : List α) : Set (List α)
Defined in
arXiv:2611.15074, Section 3.2, lines 808-812
Verified
13 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a type α and a list w of elements of α, word_substrings w is the set of all lists u of elements of α such that u is an infix (contiguous sublist) of w and the length of u is at least 2.

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

/-- Substrings of a list of length at least 2. -/
def word_substrings {α : Type*} (w : List α) : Set (List α) := {u | u <:+: w ∧ 2 ≤ u.length}
See it in the graphDiscuss this resultChallenge it