Theorem smflim2 47785

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 47756 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 2923	. 2 ⊢ Ⅎ𝑗𝐹
2		nfcv 2923	. 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 2923	. . . . 5 ⊢ Ⅎ𝑥𝑍
9		nfcv 2923	. . . . . 6 ⊢ Ⅎ𝑥(ℤ≥‘𝑛)
10		smflim2.x	. . . . . . . 8 ⊢ Ⅎ𝑥𝐹
11		nfcv 2923	. . . . . . . 8 ⊢ Ⅎ𝑥𝑚
12	10, 11	nffv 6893	. . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝑚)
13	12	nfdm 5933	. . . . . 6 ⊢ Ⅎ𝑥dom (𝐹‘𝑚)
14	9, 13	nfiin 4983	. . . . 5 ⊢ Ⅎ𝑥∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
15	8, 14	nfiun 4982	. . . 4 ⊢ Ⅎ𝑥∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
16		nfcv 2923	. . . 4 ⊢ Ⅎ𝑦∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚)
17		nfv 1947	. . . 4 ⊢ Ⅎ𝑦(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝
18		nfcv 2923	. . . . . . 7 ⊢ Ⅎ𝑗((𝐹‘𝑚)‘𝑦)
19		smflim2.n	. . . . . . . . 9 ⊢ Ⅎ𝑚𝐹
20		nfcv 2923	. . . . . . . . 9 ⊢ Ⅎ𝑚𝑗
21	19, 20	nffv 6893	. . . . . . . 8 ⊢ Ⅎ𝑚(𝐹‘𝑗)
22		nfcv 2923	. . . . . . . 8 ⊢ Ⅎ𝑚𝑦
23	21, 22	nffv 6893	. . . . . . 7 ⊢ Ⅎ𝑚((𝐹‘𝑗)‘𝑦)
24		fveq2 6883	. . . . . . . 8 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
25	24	fveq1d 6885	. . . . . . 7 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑗)‘𝑦))
26	18, 23, 25	cbvmpt 5207	. . . . . 6 ⊢ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))
27		nfcv 2923	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑗
28	10, 27	nffv 6893	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐹‘𝑗)
29		nfcv 2923	. . . . . . . 8 ⊢ Ⅎ𝑥𝑦
30	28, 29	nffv 6893	. . . . . . 7 ⊢ Ⅎ𝑥((𝐹‘𝑗)‘𝑦)
31	8, 30	nfmpt 5203	. . . . . 6 ⊢ Ⅎ𝑥(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))
32	26, 31	nfcxfr 2921	. . . . 5 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦))
33		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥dom ⇝
34	32, 33	nfel 2937	. . . 4 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝
35		fveq2 6883	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑚)‘𝑦))
36	35	mpteq2dv 5199	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)))
37	36	eleq1d 2846	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ ↔ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ))
38	15, 16, 17, 34, 37	cbvrabw 3447	. . 3 ⊢ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ } = {𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ }
39		fveq2 6883	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (ℤ≥‘𝑛) = (ℤ≥‘𝑘))
40	39	iineq1d 46074	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚))
41		nfcv 2923	. . . . . . . . . 10 ⊢ Ⅎ𝑗dom (𝐹‘𝑚)
42	21	nfdm 5933	. . . . . . . . . 10 ⊢ Ⅎ𝑚dom (𝐹‘𝑗)
43	24	dmeqd 5887	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
44	41, 42, 43	cbviin 4994	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗)
45	44	a1i 11	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
46	40, 45	eqtrd 2796	. . . . . . 7 ⊢ (𝑛 = 𝑘 → ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
47	46	cbviunv 4997	. . . . . 6 ⊢ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗)
48	47	eleq2i 2853	. . . . 5 ⊢ (𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗))
49	26	eleq1i 2852	. . . . 5 ⊢ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ↔ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ )
50	48, 49	anbi12i 640	. . . 4 ⊢ ((𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ ) ↔ (𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∧ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ ))
51	50	rabbia2 3416	. . 3 ⊢ {𝑦 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) ∈ dom ⇝ } = {𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∣ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ }
52	7, 38, 51	3eqtri 2788	. 2 ⊢ 𝐷 = {𝑦 ∈ ∪ 𝑘 ∈ 𝑍 ∩ 𝑗 ∈ (ℤ≥‘𝑘)dom (𝐹‘𝑗) ∣ (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)) ∈ dom ⇝ }
53		smflim2.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))))
54		nfrab1 3432	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) ∈ dom ⇝ }
55	7, 54	nfcxfr 2921	. . . 4 ⊢ Ⅎ𝑥𝐷
56		nfcv 2923	. . . 4 ⊢ Ⅎ𝑦𝐷
57		nfcv 2923	. . . 4 ⊢ Ⅎ𝑦( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)))
58		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥 ⇝
59	58, 31	nffv 6893	. . . 4 ⊢ Ⅎ𝑥( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
60	26	a1i 11	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
61	36, 60	eqtrd 2796	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦)))
62	61	fveq2d 6887	. . . 4 ⊢ (𝑥 = 𝑦 → ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥))) = ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
63	55, 56, 57, 59, 62	cbvmptf 5205	. . 3 ⊢ (𝑥 ∈ 𝐷 ↦ ( ⇝ ‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑥)))) = (𝑦 ∈ 𝐷 ↦ ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
64	53, 63	eqtri 2784	. 2 ⊢ 𝐺 = (𝑦 ∈ 𝐷 ↦ ( ⇝ ‘(𝑗 ∈ 𝑍 ↦ ((𝐹‘𝑗)‘𝑦))))
65	1, 2, 3, 4, 5, 6, 52, 64	smflim 47756	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908  {crab 3413  ∪ ciun 4951  ∩ ciin 4952   ↦ cmpt 5186  dom cdm 5651  ⟶wf 6533  ‘cfv 6537  ℤcz 12686  ℤ_≥cuz 12958   ⇝ cli 15644  SAlgcsalg 47287  SMblFncsmblfn 47674

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635  ax-cc 10506  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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-isom 6546  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-oadd 8473  df-omul 8474  df-er 8710  df-map 8842  df-pm 8843  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-sup 9427  df-inf 9428  df-oi 9497  df-card 10013  df-acn 10016  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-n0 12600  df-z 12687  df-uz 12959  df-q 13069  df-rp 13114  df-ioo 13473  df-ico 13475  df-fl 13925  df-seq 14138  df-exp 14198  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-abs 15396  df-clim 15648  df-rlim 15649  df-rest 17586  df-salg 47288  df-smblfn 47675

This theorem is used by:  smflimmpt  47789