mbflimlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mbflimlem		Structured version Visualization version GIF version

Theorem mbflimlem 25723

Description: The pointwise limit of a sequence of measurable real-valued functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.)

**Hypotheses**
Ref	Expression
mbflim.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
mbflim.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
mbflim.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ 𝐶)
mbflim.5	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
mbflimlem.6	⊢ ((𝜑 ∧ (𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴)) → 𝐵 ∈ ℝ)

**Assertion**
Ref	Expression
mbflimlem	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)

Distinct variable groups: 𝑥,𝑛,𝐴 𝜑,𝑛,𝑥 𝑛,𝑍,𝑥 Allowed substitution hints: 𝐵(𝑥,𝑛) 𝐶(𝑥,𝑛) 𝑀(𝑥,𝑛)

Proof of Theorem mbflimlem Dummy variables 𝑗 𝑘 𝑚 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mbflim.1	. . . . 5 ⊢ 𝑍 = (ℤ_≥‘𝑀)
2		mbflimlem.6	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴)) → 𝐵 ∈ ℝ)
3	2	anass1rs 654	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → 𝐵 ∈ ℝ)
4	3	fmpttd 7151	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵):𝑍⟶ℝ)
5		mbflim.2	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑀 ∈ ℤ)
7		mbflim.4	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ 𝐶)
8		climrel 15540	. . . . . . . 8 ⊢ Rel ⇝
9	8	releldmi 5973	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ 𝐶 → (𝑛 ∈ 𝑍 ↦ 𝐵) ∈ dom ⇝ )
10	7, 9	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) ∈ dom ⇝ )
11	1	climcau 15721	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ 𝑍 ↦ 𝐵) ∈ dom ⇝ ) → ∀𝑦 ∈ ℝ⁺ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ_≥‘𝑘)(abs‘(((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑗) − ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑘))) < 𝑦)
12	6, 10, 11	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ ℝ⁺ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ_≥‘𝑘)(abs‘(((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑗) − ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑘))) < 𝑦)
13	1, 4, 12	caurcvg 15727	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)))
14		climuni 15600	. . . 4 ⊢ (((𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)) ∧ (𝑛 ∈ 𝑍 ↦ 𝐵) ⇝ 𝐶) → (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)) = 𝐶)
15	13, 7, 14	syl2anc 583	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)) = 𝐶)
16	15	mpteq2dva 5266	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵))) = (𝑥 ∈ 𝐴 ↦ 𝐶))
17		eqid 2740	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵))) = (𝑥 ∈ 𝐴 ↦ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)))
18		eqid 2740	. . 3 ⊢ (𝑚 ∈ ℝ ↦ sup((((𝑛 ∈ 𝑍 ↦ 𝐵) “ (𝑚[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑚 ∈ ℝ ↦ sup((((𝑛 ∈ 𝑍 ↦ 𝐵) “ (𝑚[,)+∞)) ∩ ℝ^), ℝ^, < ))
19	4	ffvelcdmda 7120	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑘 ∈ 𝑍) → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑘) ∈ ℝ)
20	1, 6, 13, 19	climrecl 15631	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)
21		mbflim.5	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
22	1, 17, 18, 5, 20, 21, 2	mbflimsup 25722	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (lim sup‘(𝑛 ∈ 𝑍 ↦ 𝐵))) ∈ MblFn)
23	16, 22	eqeltrrd 2845	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) ∈ MblFn)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ∃wrex 3076 ∩ cin 3975 class class class wbr 5166 ↦ cmpt 5249 dom cdm 5700 “ cima 5703 ‘cfv 6575 (class class class)co 7450 supcsup 9511 ℝcr 11185 +∞cpnf 11323 ℝ^*cxr 11325 < clt 11326 − cmin 11522 ℤcz 12641 ℤ_≥cuz 12905 ℝ⁺crp 13059 [,)cico 13411 abscabs 15285 lim supclsp 15518 ⇝ cli 15532 MblFncmbf 25670

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7772 ax-inf2 9712 ax-cc 10506 ax-cnex 11242 ax-resscn 11243 ax-1cn 11244 ax-icn 11245 ax-addcl 11246 ax-addrcl 11247 ax-mulcl 11248 ax-mulrcl 11249 ax-mulcom 11250 ax-addass 11251 ax-mulass 11252 ax-distr 11253 ax-i2m1 11254 ax-1ne0 11255 ax-1rid 11256 ax-rnegex 11257 ax-rrecex 11258 ax-cnre 11259 ax-pre-lttri 11260 ax-pre-lttrn 11261 ax-pre-ltadd 11262 ax-pre-mulgt0 11263 ax-pre-sup 11264

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-disj 5134 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6334 df-ord 6400 df-on 6401 df-lim 6402 df-suc 6403 df-iota 6527 df-fun 6577 df-fn 6578 df-f 6579 df-f1 6580 df-fo 6581 df-f1o 6582 df-fv 6583 df-isom 6584 df-riota 7406 df-ov 7453 df-oprab 7454 df-mpo 7455 df-of 7716 df-om 7906 df-1st 8032 df-2nd 8033 df-frecs 8324 df-wrecs 8355 df-recs 8429 df-rdg 8468 df-1o 8524 df-2o 8525 df-oadd 8528 df-omul 8529 df-er 8765 df-map 8888 df-pm 8889 df-en 9006 df-dom 9007 df-sdom 9008 df-fin 9009 df-sup 9513 df-inf 9514 df-oi 9581 df-dju 9972 df-card 10010 df-acn 10013 df-pnf 11328 df-mnf 11329 df-xr 11330 df-ltxr 11331 df-le 11332 df-sub 11524 df-neg 11525 df-div 11950 df-nn 12296 df-2 12358 df-3 12359 df-n0 12556 df-z 12642 df-uz 12906 df-q 13016 df-rp 13060 df-xadd 13178 df-ioo 13413 df-ioc 13414 df-ico 13415 df-icc 13416 df-fz 13570 df-fzo 13714 df-fl 13845 df-seq 14055 df-exp 14115 df-hash 14382 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-limsup 15519 df-clim 15536 df-rlim 15537 df-sum 15737 df-xmet 21382 df-met 21383 df-ovol 25520 df-vol 25521 df-mbf 25675

This theorem is referenced by: mbflim 25724

W3C validator