Theorem tmachlem-fssscan 48163

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 6737	. 2 ⊢ (𝜑 → ran 𝑆 ⊆ (𝒫 𝐼 ∩ Fin))
3		inss2 4137	. 2 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ Fin
4	2, 3	sstrdi 3925	1 ⊢ (𝜑 → ran 𝑆 ⊆ Fin)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ↑_m cmap 8872  Fincfn 8998

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-f 6559

This theorem is used by:  tmachfullfin  48164