Theorem tmachlem-fssscan 47882

Description: Any scan set is finite. (Contributed by Ender Ting, 28-Jul-2026.)

Hypotheses

Ref	Expression
tmach.finalph	⊢ (𝜑 → 𝑈 ∈ Fin)
tmach.exindex	⊢ (𝜑 → 𝐼 ∈ V)
tmach.tapelist	⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
tmach.scanmap	⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
tmach.agreemap	⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
tmach.agreement	⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))

Assertion

Ref	Expression
tmachlem-fssscan	⊢ (𝜑 → ran 𝑆 ⊆ Fin)

Distinct variable groups:   𝑦,𝑈,𝑧   𝑦,𝐼,𝑧   𝜑,𝑦,𝑧   𝑦,𝑆,𝑧   𝑦,𝐴,𝑧   𝑦,𝑇,𝑧

Proof of Theorem tmachlem-fssscan

Step	Hyp	Ref	Expression
1		tmach.scanmap	. . 3 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
2	1	frnd 6706	. 2 ⊢ (𝜑 → ran 𝑆 ⊆ (𝒫 𝐼 ∩ Fin))
3		inss2 4182	. 2 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ Fin
4	2, 3	sstrdi 3942	1 ⊢ (𝜑 → ran 𝑆 ⊆ Fin)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412  Vcvv 3450   ∩ cin 3897   ⊆ wss 3898  𝒫 cpw 4556   ↦ cmpt 5185  ran crn 5648   ↾ cres 5649  ⟶wf 6523  ‘cfv 6527  (class class class)co 7408   ↑_m cmap 8825  Fincfn 8951

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-in 3905  df-ss 3915  df-f 6531

This theorem is used by:  tmachfullfin  47883