Cslib.Turing.StackTape.eq_iff
theoremverifiedformalizationimported Lean
Cslib.Turing.StackTape.eq_iff
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 lemma Cslib.Turing.StackTape.eq_iff (l1 l2 : StackTape Symbol) : l1 = l2 ↔ l1.head = l2.head ∧ l1.tail = l2.tail
- Formalizes
- CSLib, `Cslib.Turing.StackTape.eq_iff`
- 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.Cslib.Turing.StackTape.eq_iff← Cslib.Turing.StackTape.eq_iff (Cslib/Foundations/Data/StackTape.lean:108): adapted
What was changed in
Cslib.Turing.StackTape.eq_iff--- Cslib/Foundations/Data/StackTape.lean:108 (Cslib.Turing.StackTape.eq_iff) +++ as compiled here @@ -1,2 +1,7 @@ -lemma eq_iff (l1 l2 : StackTape Symbol) : +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 +lemma Cslib.Turing.StackTape.eq_iff (l1 l2 : StackTape Symbol) : l1 = l2 ↔ l1.head = l2.head ∧ l1.tail = l2.tail := by - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- Cslib.Turing.StackTape.empty_eq_nilCslib.Turing.StackTape.empty_eq_nil
- Cslib.Turing.StackTape.cons_none_nil_toListCslib.Turing.StackTape.cons_none_nil_toList
- Cslib.Turing.StackTape.instEmptyCollectionCslib.Turing.StackTape.instEmptyCollection
- Cslib.Turing.StackTape.instInhabitedCslib.Turing.StackTape.instInhabited
- Cslib.Turing.StackTape.tailRemove the first element of the
StackTape, returning the rest - Cslib.Turing.StackTape.nilThe empty
StackTape - Cslib.Turing.StackTape.cons_some_toListCslib.Turing.StackTape.cons_some_toList
- Cslib.Turing.StackTape.nil_toListCslib.Turing.StackTape.nil_toList
- Cslib.Turing.StackTape.headGet the first element of the
StackTape. - Cslib.Turing.StackTapeAn infinite tape representation using a list of
Optionvalues, where the list is eventuallynone. Represented as a…
- Used by 1
- Cslib.Turing.StackTape.cons_head_tailCslib.Turing.StackTape.cons_head_tail
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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*} inlemma Cslib.Turing.StackTape.eq_iff (l1 l2 : StackTape Symbol) : l1 = l2 ↔ l1.head = l2.head ∧ l1.tail = l2.tail := by constructor · grind · intro ⟨hhead, htail⟩ cases l1 with | mk as1 h1 => cases l2 with | mk as2 h2 => cases as1 <;> cases as2 <;> grind [nil]