AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.StackTape.nil_toList

theoremverifiedformalizationimported Lean

Cslib.Turing.StackTape.nil_toList

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.StackTape in
attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
variable {Symbol : Type*} in
@[simp, grind =]
lemma Cslib.Turing.StackTape.nil_toList : (nil : StackTape Symbol).toList = []
Formalizes
CSLib, `Cslib.Turing.StackTape.nil_toList`
Lean proof
By Bolton Bailey, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Bolton Bailey. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
What was changed in Cslib.Turing.StackTape.nil_toList
--- Cslib/Foundations/Data/StackTape.lean:77 (Cslib.Turing.StackTape.nil_toList)
+++ as compiled here
@@ -1,2 +1,7 @@
-@[simp, scoped grind =]
-lemma nil_toList : (nil : StackTape Symbol).toList = [] := rfl
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.Turing Cslib.Turing.StackTape in
+attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
+variable {Symbol : Type*} in
+@[simp, grind =]
+lemma Cslib.Turing.StackTape.nil_toList : (nil : StackTape Symbol).toList = [] := rfl
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
Used by 59

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.StackTape in
attribute [local grind! .] StackTape.toList_getLast?_ne_some_none in
variable {Symbol : Type*} in
@[simp, grind =]
lemma Cslib.Turing.StackTape.nil_toList : (nil : StackTape Symbol).toList = [] := rfl
See it in the graphDiscuss this resultChallenge it