Theorem smflim2 47252

Description: The limit of a sequence of sigma-measurable functions is sigma-measurable. Proposition 121F (a) of [Fremlin1] p. 38 . Notice that every function in the sequence can have a different (partial) domain, and the domain of convergence can be decidedly irregular (Remark 121G of [Fremlin1] p. 39 ). TODO: this has fewer distinct variable conditions than smflim 47223 and should replace it. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
smflim2.n	⊢ Ⅎ𝑚𝐹
smflim2.x	⊢ Ⅎ𝑥𝐹
smflim2.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
smflim2.z	⊢ 𝑍 = (ℤ≥‘𝑀)
smflim2.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smflim2.f	⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
smflim2.d	⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
smflim2.g	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))))

Assertion

Ref	Expression
smflim2	⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Distinct variable groups:   𝑛,𝐹   𝑚,𝑍,𝑛,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑚,𝑛)   𝐷(𝑥,𝑚,𝑛)   𝑆(𝑥,𝑚,𝑛)   𝐹(𝑥,𝑚)   𝐺(𝑥,𝑚,𝑛)   𝑀(𝑥,𝑚,𝑛)

Proof of Theorem smflim2

Dummy variables 𝑦 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2899	. 2 ⊢ Ⅎ𝑗𝐹
2		nfcv 2899	. 2 ⊢ Ⅎ𝑦𝐹
3		smflim2.m	. 2 ⊢ (𝜑 → 𝑀 ∈ ℤ)
4		smflim2.z	. 2 ⊢ 𝑍 = (ℤ≥‘𝑀)
5		smflim2.s	. 2 ⊢ (𝜑 → 𝑆 ∈ SAlg)
6		smflim2.f	. 2 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
7		smflim2.d	. . 3 ⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
8		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥𝑍
9		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥(ℤ≥‘𝑛)
10		smflim2.x	. . . . . . . 8 ⊢ Ⅎ𝑥𝐹
11		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝑚
12	10, 11	nffv 6844	. . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝑚)
13	12	nfdm 5900	. . . . . 6 ⊢ Ⅎ𝑥dom (𝐹‘𝑚)
14	9, 13	nfiin 4967	. . . . 5 ⊢ Ⅎ𝑥∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
15	8, 14	nfiun 4966	. . . 4 ⊢ Ⅎ𝑥∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
16		nfcv 2899	. . . 4 ⊢ Ⅎ𝑦∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
17		nfv 1916	. . . 4 ⊢ Ⅎ𝑦(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝
18		nfcv 2899	. . . . . . 7 ⊢ Ⅎ𝑗((𝐹‘𝑚)‘𝑦)
19		smflim2.n	. . . . . . . . 9 ⊢ Ⅎ𝑚𝐹
20		nfcv 2899	. . . . . . . . 9 ⊢ Ⅎ𝑚𝑗
21	19, 20	nffv 6844	. . . . . . . 8 ⊢ Ⅎ𝑚(𝐹‘𝑗)
22		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑚𝑦
23	21, 22	nffv 6844	. . . . . . 7 ⊢ Ⅎ𝑚((𝐹‘𝑗)‘𝑦)
24		fveq2 6834	. . . . . . . 8 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
25	24	fveq1d 6836	. . . . . . 7 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑗)‘𝑦))
26	18, 23, 25	cbvmpt 5188	. . . . . 6 ⊢ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))
27		nfcv 2899	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑗
28	10, 27	nffv 6844	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐹‘𝑗)
29		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝑦
30	28, 29	nffv 6844	. . . . . . 7 ⊢ Ⅎ𝑥((𝐹‘𝑗)‘𝑦)
31	8, 30	nfmpt 5184	. . . . . 6 ⊢ Ⅎ𝑥(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))
32	26, 31	nfcxfr 2897	. . . . 5 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦))
33		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥dom ⇝
34	32, 33	nfel 2914	. . . 4 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝
35		fveq2 6834	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑚)‘𝑦))
36	35	mpteq2dv 5180	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)))
37	36	eleq1d 2822	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ ↔ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ))
38	15, 16, 17, 34, 37	cbvrabw 3425	. . 3 ⊢ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ } = {𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ }
39		fveq2 6834	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (ℤ≥‘𝑛) = (ℤ≥‘𝑘))
40	39	iineq1d 45538	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚))
41		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑗dom (𝐹‘𝑚)
42	21	nfdm 5900	. . . . . . . . . 10 ⊢ Ⅎ𝑚dom (𝐹‘𝑗)
43	24	dmeqd 5854	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
44	41, 42, 43	cbviin 4979	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗)
45	44	a1i 11	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
46	40, 45	eqtrd 2772	. . . . . . 7 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
47	46	cbviunv 4982	. . . . . 6 ⊢ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗)
48	47	eleq2i 2829	. . . . 5 ⊢ (𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
49	26	eleq1i 2828	. . . . 5 ⊢ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ↔ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ )
50	48, 49	anbi12i 629	. . . 4 ⊢ ((𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ) ↔ (𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∧ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ ))
51	50	rabbia2 3393	. . 3 ⊢ {𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ } = {𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∣ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ }
52	7, 38, 51	3eqtri 2764	. 2 ⊢ 𝐷 = {𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∣ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ }
53		smflim2.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))))
54		nfrab1 3410	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
55	7, 54	nfcxfr 2897	. . . 4 ⊢ Ⅎ𝑥𝐷
56		nfcv 2899	. . . 4 ⊢ Ⅎ𝑦𝐷
57		nfcv 2899	. . . 4 ⊢ Ⅎ𝑦( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)))
58		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥 ⇝
59	58, 31	nffv 6844	. . . 4 ⊢ Ⅎ𝑥( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
60	26	a1i 11	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
61	36, 60	eqtrd 2772	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
62	61	fveq2d 6838	. . . 4 ⊢ (𝑥 = 𝑦 → ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))) = ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
63	55, 56, 57, 59, 62	cbvmptf 5186	. . 3 ⊢ (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)))) = (𝑦 ∈ 𝐷 ↦ ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
64	53, 63	eqtri 2760	. 2 ⊢ 𝐺 = (𝑦 ∈ 𝐷 ↦ ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
65	1, 2, 3, 4, 5, 6, 52, 64	smflim 47223	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  Ⅎwnfc 2884  {crab 3390  ∪ ciun 4934  ∩ ciin 4935   ↦ cmpt 5167  dom cdm 5624  ⟶wf 6488  ‘cfv 6492  ℤcz 12515  ℤ_≥cuz 12779   ⇝ cli 15437  SAlgcsalg 46754  SMblFncsmblfn 47141

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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553  ax-cc 10348  ax-ac2 10376  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-oadd 8402  df-omul 8403  df-er 8636  df-map 8768  df-pm 8769  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-sup 9348  df-inf 9349  df-oi 9418  df-card 9854  df-acn 9857  df-ac 10029  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-n0 12429  df-z 12516  df-uz 12780  df-q 12890  df-rp 12934  df-ioo 13293  df-ico 13295  df-fl 13742  df-seq 13955  df-exp 14015  df-cj 15052  df-re 15053  df-im 15054  df-sqrt 15188  df-abs 15189  df-clim 15441  df-rlim 15442  df-rest 17376  df-salg 46755  df-smblfn 47142

This theorem is referenced by:  smflimmpt  47256