Canonical-word legality of the thirteen unlabelled YAH rows
ProvedCollatzWork.YAH.unlabelledRows_legalcollatz-work-import
Let be the fixed list of thirteen unlabelled YAH rule instances. For a row , let and be its left and right words after inserting its stored prefix and suffix. A word is canonical when it starts with , ends with \$$, and has only the five digit symbols f,t,0,1,2$ in its interior. Then
This checks the syntactic domain of the displayed finite certificate rows. The statement is restricted to this list of instances.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_YAHFiniteObstruction import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement open Lean.Grind open Lean.Grind.AddCommMonoid open Lean.Grind.IntModule
Formal statement
theorem CollatzWork.YAH.unlabelledRows_legal :
unlabelledRows.all validUnlabelledInstance = true := by sorry
Source