Theorem mvrsfpw 35688

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 35687	. 2 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) = (ran (2nd ‘𝑋) ∩ 𝑉))
5		inss2 4178	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉
6	5	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉)
7		fzofi 13936	. . . . 5 ⊢ (0..^(♯‘(2nd ‘𝑋))) ∈ Fin
8		xp2nd 7975	. . . . . . . 8 ⊢ (𝑋 ∈ ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉)) → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
9		eqid 2736	. . . . . . . . 9 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
10		eqid 2736	. . . . . . . . 9 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
11	9, 2, 10, 1	mexval2 35685	. . . . . . . 8 ⊢ 𝐸 = ((mTC‘𝑇) × Word ((mCN‘𝑇) ∪ 𝑉))
12	8, 11	eleq2s 2854	. . . . . . 7 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉))
13		wrdf 14480	. . . . . . 7 ⊢ ((2nd ‘𝑋) ∈ Word ((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉))
14		ffn 6668	. . . . . . 7 ⊢ ((2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))⟶((mCN‘𝑇) ∪ 𝑉) → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
15	12, 13, 14	3syl 18	. . . . . 6 ⊢ (𝑋 ∈ 𝐸 → (2nd ‘𝑋) Fn (0..^(♯‘(2nd ‘𝑋))))
16		dffn4 6758	. . . . . 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 9223	. . . . 5 ⊢ (((0..^(♯‘(2nd ‘𝑋))) ∈ Fin ∧ (2nd ‘𝑋):(0..^(♯‘(2nd ‘𝑋)))–onto→ran (2nd ‘𝑋)) → ran (2nd ‘𝑋) ∈ Fin)
19	7, 17, 18	sylancr 588	. . . 4 ⊢ (𝑋 ∈ 𝐸 → ran (2nd ‘𝑋) ∈ Fin)
20		inss1 4177	. . . 4 ⊢ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)
21		ssfi 9107	. . . 4 ⊢ ((ran (2nd ‘𝑋) ∈ Fin ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ⊆ ran (2nd ‘𝑋)) → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
22	19, 20, 21	sylancl 587	. . 3 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin)
23		elfpw 9264	. . 3 ⊢ ((ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin) ↔ ((ran (2nd ‘𝑋) ∩ 𝑉) ⊆ 𝑉 ∧ (ran (2nd ‘𝑋) ∩ 𝑉) ∈ Fin))
24	6, 22, 23	sylanbrc 584	. 2 ⊢ (𝑋 ∈ 𝐸 → (ran (2nd ‘𝑋) ∩ 𝑉) ∈ (𝒫 𝑉 ∩ Fin))
25	4, 24	eqeltrd 2836	1 ⊢ (𝑋 ∈ 𝐸 → (𝑊‘𝑋) ∈ (𝒫 𝑉 ∩ Fin))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114   ∪ cun 3887   ∩ cin 3888   ⊆ wss 3889  𝒫 cpw 4541   × cxp 5629  ran crn 5632   Fn wfn 6493  ⟶wf 6494  –onto→wfo 6496  ‘cfv 6498  (class class class)co 7367  2^nd c2nd 7941  Fincfn 8893  0cc0 11038  ..^cfzo 13608  ♯chash 14292  Word cword 14475  mCNcmcn 35642  mVRcmvar 35643  mTCcmtc 35646  mExcmex 35649  mVarscmvrs 35651

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789  df-fz 13462  df-fzo 13609  df-hash 14293  df-word 14476  df-mrex 35668  df-mex 35669  df-mvrs 35671

This theorem is referenced by: (None)