Theorem mvrsfpw 35483

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 35482	. 2 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))
5		inss2 4189	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉
6	5	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉)
7		fzofi 13881	. . . . 5 ⊢ (0..^(♯‘(2nd ‘𝑋))) ∈ Fin
8		xp2nd 7957	. . . . . . . 8 ⊢ (𝑋 ∈ ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉)) → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
9		eqid 2729	. . . . . . . . 9 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
10		eqid 2729	. . . . . . . . 9 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
11	9, 2, 10, 1	mexval2 35480	. . . . . . . 8 ⊢ 𝐸 = ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉))
12	8, 11	eleq2s 2846	. . . . . . 7 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
13		wrdf 14425	. . . . . . 7 ⊢ ((2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉))
14		ffn 6652	. . . . . . 7 ⊢ ((2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
15	12, 13, 14	3syl 18	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
16		dffn4 6742	. . . . . 6 ⊢ ((2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))) ↔ (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋))
17	15, 16	sylib 218	. . . . 5 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋))
18		fofi 9202	. . . . 5 ⊢ (((0..^(♯‘(2nd ‘𝑋))) ∈ Fin ∧ (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋)) → ran (2nd ‘𝑋) ∈ Fin)
19	7, 17, 18	sylancr 587	. . . 4 ⊢ (𝑋 ∈ 𝐸 → ran (2nd ‘𝑋) ∈ Fin)
20		inss1 4188	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)
21		ssfi 9087	. . . 4 ⊢ ((ran (2nd ‘𝑋) ∈ Fin ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)) → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
22	19, 20, 21	sylancl 586	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
23		elfpw 9244	. . 3 ⊢ ((ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin) ↔ ((ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉 ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin))
24	6, 22, 23	sylanbrc 583	. 2 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin))
25	4, 24	eqeltrd 2828	1 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) ∈ (𝒫 𝑉 ∩ Fin))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109   ∪ cun 3901   ∩ cin 3902   ⊆ wss 3903  𝒫 cpw 4551   × cxp 5617  ran crn 5620   Fn wfn 6477  ⟶wf 6478  –onto→wfo 6480  ‘cfv 6482  (class class class)co 7349  2^nd c2nd 7923  Fincfn 8872  0cc0 11009  ..^cfzo 13557  ♯chash 14237  Word cword 14420  mCNcmcn 35437  mVRcmvar 35438  mTCcmtc 35441  mExcmex 35444  mVarscmvrs 35446

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-card 9835  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-nn 12129  df-n0 12385  df-z 12472  df-uz 12736  df-fz 13411  df-fzo 13558  df-hash 14238  df-word 14421  df-mrex 35463  df-mex 35464  df-mvrs 35466

This theorem is referenced by: (None)