AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.StackTape.cons_head_tail

theoremverifiedformalizationimported Lean

Cslib.Turing.StackTape.cons_head_tail

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]
lemma Cslib.Turing.StackTape.cons_head_tail (l : StackTape Symbol) :
    cons (l.head) (l.tail) = l
Formalizes
CSLib, `Cslib.Turing.StackTape.cons_head_tail`
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.cons_head_tail
--- Cslib/Foundations/Data/StackTape.lean:135 (Cslib.Turing.StackTape.cons_head_tail)
+++ as compiled here
@@ -1,3 +1,8 @@
+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]
-lemma cons_head_tail (l : StackTape Symbol) :
+lemma Cslib.Turing.StackTape.cons_head_tail (l : StackTape Symbol) :
     cons (l.head) (l.tail) = l := by
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 13
Used by 50

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.Turing Cslib.Turing.StackTape inattribute [local grind! .] StackTape.toList_getLast?_ne_some_none invariable {Symbol : Type*} in@[simp]lemma Cslib.Turing.StackTape.cons_head_tail (l : StackTape Symbol) :    cons (l.head) (l.tail) = l := by  rw [eq_iff]  simp
See it in the graphDiscuss this resultChallenge it