AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.SingleTapeTM.TimeComputable.id

defimported Lean

The identity map on Symbol is computable in constant time.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
def Cslib.Turing.SingleTapeTM.TimeComputable.id : TimeComputable (Symbol := Symbol) id
Defined in
CSLib, `Cslib.Turing.SingleTapeTM.TimeComputable.id`
Lean proof
By Bolton Bailey, Pim Spelier, Daan van Gent, 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.
Verified
08 Oct 2026
Axioms
none listed
Built on 31
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
/-- The identity map on Symbol is computable in constant time. -/
def Cslib.Turing.SingleTapeTM.TimeComputable.id : TimeComputable (Symbol := Symbol) id where
  tm := idComputer
  timeBound _ := 1
  outputsFunInTime _ := ⟨1, le_rfl, RelatesInSteps.single rfl⟩
See it in the graphDiscuss this resultChallenge it