Theorem tmachlem-agreefin 48161

Description: Any agreement set has a finite (singleton) list of possible scans. (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-agreefin	⊢ ((𝜑 ∧ 𝑏 ∈ ran 𝐴) → (𝑆 “ 𝑏) ∈ Fin)

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

Proof of Theorem tmachlem-agreefin

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funmpt 6595	. . . . 5 ⊢ Fun (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))})
2		tmach.agreemap	. . . . . 6 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
3	2	funeqd 6578	. . . . 5 ⊢ (𝜑 → (Fun 𝐴 ↔ Fun (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))})))
4	1, 3	mpbiri 261	. . . 4 ⊢ (𝜑 → Fun 𝐴)
5		elrnrexdm 7110	. . . 4 ⊢ (Fun 𝐴 → (𝑏 ∈ ran 𝐴 → ∃𝑎 ∈ dom 𝐴 𝑏 = (𝐴‘𝑎)))
6	4, 5	syl 18	. . 3 ⊢ (𝜑 → (𝑏 ∈ ran 𝐴 → ∃𝑎 ∈ dom 𝐴 𝑏 = (𝐴‘𝑎)))
7	6	imp 412	. 2 ⊢ ((𝜑 ∧ 𝑏 ∈ ran 𝐴) → ∃𝑎 ∈ dom 𝐴 𝑏 = (𝐴‘𝑎))
8		simprr 785	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → 𝑏 = (𝐴‘𝑎))
9	8	imaeq2d 6063	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → (𝑆 “ 𝑏) = (𝑆 “ (𝐴‘𝑎)))
10		simpll 779	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → 𝜑)
11		simprl 783	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → 𝑎 ∈ dom 𝐴)
12	2	dmeqd 5893	. . . . . . . 8 ⊢ (𝜑 → dom 𝐴 = dom (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}))
13		tmach.finalph	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑈 ∈ Fin)
14		tmach.exindex	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐼 ∈ V)
15		tmach.tapelist	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 = (𝑈 ↑m 𝐼))
16		tmach.scanmap	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑆:𝑇⟶(𝒫 𝐼 ∩ Fin))
17		tmach.agreement	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 ∀𝑦 ∈ (𝐴‘𝑧)(𝑆‘𝑦) = (𝑆‘𝑧))
18	13, 14, 15, 16, 2, 17	tmachlem-extapes 48147	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇 ∈ V)
19		ssrab2 4008	. . . . . . . . . . . 12 ⊢ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ⊆ 𝑇
20	19	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ⊆ 𝑇)
21	18, 20	ssexd 5290	. . . . . . . . . 10 ⊢ (𝜑 → {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V)
22	21	ralrimivw 3162	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V)
23		dmmptg 6255	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝑇 {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))} ∈ V → dom (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}) = 𝑇)
24	22, 23	syl 18	. . . . . . . 8 ⊢ (𝜑 → dom (𝑧 ∈ 𝑇 ↦ {𝑦 ∈ 𝑇 ∣ (𝑦 ↾ (𝑆‘𝑧)) = (𝑧 ↾ (𝑆‘𝑧))}) = 𝑇)
25	12, 24	eqtrd 2798	. . . . . . 7 ⊢ (𝜑 → dom 𝐴 = 𝑇)
26	25	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → dom 𝐴 = 𝑇)
27	11, 26	eleqtrd 2866	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → 𝑎 ∈ 𝑇)
28	13, 14, 15, 16, 2, 17	tmachlem-agreesn 48160	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑇) → (𝑆 “ (𝐴‘𝑎)) = {(𝑆‘𝑎)})
29	10, 27, 28	syl2anc 596	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → (𝑆 “ (𝐴‘𝑎)) = {(𝑆‘𝑎)})
30	9, 29	eqtrd 2798	. . 3 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → (𝑆 “ 𝑏) = {(𝑆‘𝑎)})
31		snfi 9096	. . 3 ⊢ {(𝑆‘𝑎)} ∈ Fin
32	30, 31	eqeltrdi 2872	. 2 ⊢ (((𝜑 ∧ 𝑏 ∈ ran 𝐴) ∧ (𝑎 ∈ dom 𝐴 ∧ 𝑏 = (𝐴‘𝑎))) → (𝑆 “ 𝑏) ∈ Fin)
33	7, 32	rexlimddv 3173	1 ⊢ ((𝜑 ∧ 𝑏 ∈ ran 𝐴) → (𝑆 “ 𝑏) ∈ Fin)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  {csn 4588   ↦ cmpt 5189  dom cdm 5655  ran crn 5656   ↾ cres 5657   “ cima 5658  Fun wfun 6549  ⟶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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-1o 8501  df-en 8999  df-fin 9002

This theorem is used by:  tmachlem-franscan  48162