Database
SUPPLEMENTARY MATERIAL (USERS' MATHBOXES)
Mathbox for Ender Ting
Turing Machine Finite Reach theorem
tmachlem-fssscan
Next ⟩
tmachfullfin
Metamath Proof Explorer
Ascii
Unicode
Theorem
tmachlem-fssscan
Description:
Any scan set is finite.
(Contributed by
Ender Ting
, 28-Jul-2026)
Ref
Expression
Hypotheses
tmach.finalph
⊢
φ
→
U
∈
Fin
tmach.exindex
⊢
φ
→
I
∈
V
tmach.tapelist
⊢
φ
→
T
=
U
I
tmach.scanmap
⊢
φ
→
S
:
T
⟶
𝒫
I
∩
Fin
tmach.agreemap
⊢
φ
→
A
=
z
∈
T
⟼
y
∈
T
|
y
↾
S
⁡
z
=
z
↾
S
⁡
z
tmach.agreement
⊢
φ
→
∀
z
∈
T
∀
y
∈
A
⁡
z
S
⁡
y
=
S
⁡
z
Assertion
tmachlem-fssscan
⊢
φ
→
ran
⁡
S
⊆
Fin
Proof
Step
Hyp
Ref
Expression
1
tmach.finalph
⊢
φ
→
U
∈
Fin
2
tmach.exindex
⊢
φ
→
I
∈
V
3
tmach.tapelist
⊢
φ
→
T
=
U
I
4
tmach.scanmap
⊢
φ
→
S
:
T
⟶
𝒫
I
∩
Fin
5
tmach.agreemap
⊢
φ
→
A
=
z
∈
T
⟼
y
∈
T
|
y
↾
S
⁡
z
=
z
↾
S
⁡
z
6
tmach.agreement
⊢
φ
→
∀
z
∈
T
∀
y
∈
A
⁡
z
S
⁡
y
=
S
⁡
z
7
4
frnd
⊢
φ
→
ran
⁡
S
⊆
𝒫
I
∩
Fin
8
inss2
⊢
𝒫
I
∩
Fin
⊆
Fin
9
7
8
sstrdi
⊢
φ
→
ran
⁡
S
⊆
Fin