Metamath Proof Explorer


Theorem tmachlem-franscan

Description: There is a finite number of different scan sets. (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-franscan φ 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 ffnd φ S Fn T
8 fnima S Fn T S T = ran S
9 7 8 syl φ S T = ran S
10 1 2 3 4 5 6 tmachlem-exagreecover φ a a ran A a Fin T = a
11 simpr3 φ a ran A a Fin T = a T = a
12 11 imaeq2d φ a ran A a Fin T = a S T = S a
13 imauni S a = i a S i
14 12 13 eqtrdi φ a ran A a Fin T = a S T = i a S i
15 simpr2 φ a ran A a Fin T = a a Fin
16 simpll φ a ran A a Fin T = a i a φ
17 simplr1 φ a ran A a Fin T = a i a a ran A
18 simpr φ a ran A a Fin T = a i a i a
19 17 18 sseldd φ a ran A a Fin T = a i a i ran A
20 1 2 3 4 5 6 tmachlem-agreefin φ i ran A S i Fin
21 16 19 20 syl2anc φ a ran A a Fin T = a i a S i Fin
22 21 ralrimiva φ a ran A a Fin T = a i a S i Fin
23 iunfi a Fin i a S i Fin i a S i Fin
24 15 22 23 syl2anc φ a ran A a Fin T = a i a S i Fin
25 14 24 eqeltrd φ a ran A a Fin T = a S T Fin
26 10 25 exlimddv φ S T Fin
27 9 26 eqeltrrd φ ran S Fin