Theorem mvrsfpw 35897

Description: The set of variables in an expression is a finite subset of 𝑉. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mvrsval.v	⊢ 𝑉 = (mVR‘𝑇)
mvrsval.e	⊢ 𝐸 = (mEx‘𝑇)
mvrsval.w	⊢ 𝑊 = (mVars‘𝑇)

Assertion

Ref	Expression
mvrsfpw	⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) ∈ (𝒫 𝑉 ∩ Fin))

Proof of Theorem mvrsfpw

Step	Hyp	Ref	Expression
1		mvrsval.v	. . 3 ⊢ 𝑉 = (mVR‘𝑇)
2		mvrsval.e	. . 3 ⊢ 𝐸 = (mEx‘𝑇)
3		mvrsval.w	. . 3 ⊢ 𝑊 = (mVars‘𝑇)
4	1, 2, 3	mvrsval 35896	. 2 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))
5		inss2 4198	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉
6	5	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉)
7		fzofi 14010	. . . . 5 ⊢ (0..^(♯‘(2nd ‘𝑋))) ∈ Fin
8		xp2nd 8019	. . . . . . . 8 ⊢ (𝑋 ∈ ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉)) → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
9		eqid 2769	. . . . . . . . 9 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
10		eqid 2769	. . . . . . . . 9 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
11	9, 2, 10, 1	mexval2 35894	. . . . . . . 8 ⊢ 𝐸 = ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉))
12	8, 11	eleq2s 2887	. . . . . . 7 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
13		wrdf 14555	. . . . . . 7 ⊢ ((2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉))
14		ffn 6706	. . . . . . 7 ⊢ ((2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
15	12, 13, 14	3syl 19	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
16		dffn4 6799	. . . . . 6 ⊢ ((2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))) ↔ (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋))
17	15, 16	sylib 221	. . . . 5 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋))
18		fofi 9273	. . . . 5 ⊢ (((0..^(♯‘(2nd ‘𝑋))) ∈ Fin ∧ (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋)) → ran (2nd ‘𝑋) ∈ Fin)
19	7, 17, 18	sylancr 598	. . . 4 ⊢ (𝑋 ∈ 𝐸 → ran (2nd ‘𝑋) ∈ Fin)
20		inss1 4197	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)
21		ssfi 9157	. . . 4 ⊢ ((ran (2nd ‘𝑋) ∈ Fin ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)) → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
22	19, 20, 21	sylancl 597	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
23		elfpw 9311	. . 3 ⊢ ((ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin) ↔ ((ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉 ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin))
24	6, 22, 23	sylanbrc 594	. 2 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin))
25	4, 24	eqeltrd 2869	1 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) ∈ (𝒫 𝑉 ∩ Fin))

Syntax hints:   → wi 4   = wceq 1567   ∈ wcel 2149   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  𝒫 cpw 4567   × cxp 5660  ran crn 5663   Fn wfn 6532  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  (class class class)co 7411  2^nd c2nd 7985  Fincfn 8943  0cc0 11100  ..^cfzo 13682  ♯chash 14366  Word cword 14550  mCNcmcn 35851  mVRcmvar 35852  mTCcmtc 35855  mExcmex 35858  mVarscmvrs 35860

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-map 8826  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-n0 12505  df-z 12592  df-uz 12863  df-fz 13536  df-fzo 13683  df-hash 14367  df-word 14551  df-mrex 35877  df-mex 35878  df-mvrs 35880

This theorem is referenced by: (None)