limsupvaluz - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupvaluz		Structured version Visualization version GIF version

Theorem limsupvaluz 44411

Description: The superior limit, when the domain of the function is a set of upper integers (the first condition is needed, otherwise the l.h.s. would be -∞ and the r.h.s. would be +∞). (Contributed by Glauco Siliprandi, 23-Oct-2021.)

**Hypotheses**
Ref	Expression
limsupvaluz.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
limsupvaluz.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
limsupvaluz.f	⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)

**Assertion**
Ref	Expression
limsupvaluz	⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < )), ℝ^, < ))

Distinct variable groups: 𝑘,𝐹 𝑘,𝑍 Allowed substitution hints: 𝜑(𝑘) 𝑀(𝑘)

Proof of Theorem limsupvaluz Dummy variables 𝑖 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2733	. . 3 ⊢ (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ))
2		limsupvaluz.f	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
3		limsupvaluz.z	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4	3	fvexi 6903	. . . . 5 ⊢ 𝑍 ∈ V
5	4	a1i 11	. . . 4 ⊢ (𝜑 → 𝑍 ∈ V)
6	2, 5	fexd 7226	. . 3 ⊢ (𝜑 → 𝐹 ∈ V)
7		uzssre 12841	. . . . 5 ⊢ (ℤ_≥‘𝑀) ⊆ ℝ
8	3, 7	eqsstri 4016	. . . 4 ⊢ 𝑍 ⊆ ℝ
9	8	a1i 11	. . 3 ⊢ (𝜑 → 𝑍 ⊆ ℝ)
10		limsupvaluz.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
11	3	uzsup 13825	. . . 4 ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ^*, < ) = +∞)
12	10, 11	syl 17	. . 3 ⊢ (𝜑 → sup(𝑍, ℝ^*, < ) = +∞)
13	1, 6, 9, 12	limsupval2 15421	. 2 ⊢ (𝜑 → (lim sup‘𝐹) = inf(((𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) “ 𝑍), ℝ^*, < ))
14	9	mptima2 43936	. . . 4 ⊢ (𝜑 → ((𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) “ 𝑍) = ran (𝑖 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )))
15		oveq1 7413	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑛 → (𝑖[,)+∞) = (𝑛[,)+∞))
16	15	imaeq2d 6058	. . . . . . . . . 10 ⊢ (𝑖 = 𝑛 → (𝐹 “ (𝑖[,)+∞)) = (𝐹 “ (𝑛[,)+∞)))
17	16	ineq1d 4211	. . . . . . . . 9 ⊢ (𝑖 = 𝑛 → ((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^) = ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^))
18	17	supeq1d 9438	. . . . . . . 8 ⊢ (𝑖 = 𝑛 → sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < ) = sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^), ℝ^, < ))
19	18	cbvmptv 5261	. . . . . . 7 ⊢ (𝑖 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑛 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^), ℝ^, < ))
20	19	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑖 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑛 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^), ℝ^, < )))
21		fimass 6736	. . . . . . . . . . . 12 ⊢ (𝐹:𝑍⟶ℝ^* → (𝐹 “ (𝑛[,)+∞)) ⊆ ℝ^*)
22	2, 21	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 “ (𝑛[,)+∞)) ⊆ ℝ^*)
23		df-ss 3965	. . . . . . . . . . . 12 ⊢ ((𝐹 “ (𝑛[,)+∞)) ⊆ ℝ^* ↔ ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^*) = (𝐹 “ (𝑛[,)+∞)))
24	23	biimpi 215	. . . . . . . . . . 11 ⊢ ((𝐹 “ (𝑛[,)+∞)) ⊆ ℝ^* → ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^*) = (𝐹 “ (𝑛[,)+∞)))
25	22, 24	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^*) = (𝐹 “ (𝑛[,)+∞)))
26	25	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^*) = (𝐹 “ (𝑛[,)+∞)))
27		df-ima 5689	. . . . . . . . . 10 ⊢ (𝐹 “ (𝑛[,)+∞)) = ran (𝐹 ↾ (𝑛[,)+∞))
28	27	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 “ (𝑛[,)+∞)) = ran (𝐹 ↾ (𝑛[,)+∞)))
29	2	freld 6721	. . . . . . . . . . . . 13 ⊢ (𝜑 → Rel 𝐹)
30		resindm 6029	. . . . . . . . . . . . 13 ⊢ (Rel 𝐹 → (𝐹 ↾ ((𝑛[,)+∞) ∩ dom 𝐹)) = (𝐹 ↾ (𝑛[,)+∞)))
31	29, 30	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ↾ ((𝑛[,)+∞) ∩ dom 𝐹)) = (𝐹 ↾ (𝑛[,)+∞)))
32	31	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 ↾ ((𝑛[,)+∞) ∩ dom 𝐹)) = (𝐹 ↾ (𝑛[,)+∞)))
33		incom 4201	. . . . . . . . . . . . . . 15 ⊢ ((𝑛[,)+∞) ∩ 𝑍) = (𝑍 ∩ (𝑛[,)+∞))
34	3	ineq1i 4208	. . . . . . . . . . . . . . 15 ⊢ (𝑍 ∩ (𝑛[,)+∞)) = ((ℤ_≥‘𝑀) ∩ (𝑛[,)+∞))
35	33, 34	eqtri 2761	. . . . . . . . . . . . . 14 ⊢ ((𝑛[,)+∞) ∩ 𝑍) = ((ℤ_≥‘𝑀) ∩ (𝑛[,)+∞))
36	35	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑛[,)+∞) ∩ 𝑍) = ((ℤ_≥‘𝑀) ∩ (𝑛[,)+∞)))
37	2	fdmd 6726	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → dom 𝐹 = 𝑍)
38	37	ineq2d 4212	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑛[,)+∞) ∩ dom 𝐹) = ((𝑛[,)+∞) ∩ 𝑍))
39	38	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑛[,)+∞) ∩ dom 𝐹) = ((𝑛[,)+∞) ∩ 𝑍))
40	3	eleq2i 2826	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ 𝑍 ↔ 𝑛 ∈ (ℤ_≥‘𝑀))
41	40	biimpi 215	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ_≥‘𝑀))
42	41	adantl 483	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ (ℤ_≥‘𝑀))
43	42	uzinico2 44262	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (ℤ_≥‘𝑛) = ((ℤ_≥‘𝑀) ∩ (𝑛[,)+∞)))
44	36, 39, 43	3eqtr4d 2783	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑛[,)+∞) ∩ dom 𝐹) = (ℤ_≥‘𝑛))
45	44	reseq2d 5980	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 ↾ ((𝑛[,)+∞) ∩ dom 𝐹)) = (𝐹 ↾ (ℤ_≥‘𝑛)))
46	32, 45	eqtr3d 2775	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 ↾ (𝑛[,)+∞)) = (𝐹 ↾ (ℤ_≥‘𝑛)))
47	46	rneqd 5936	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ran (𝐹 ↾ (𝑛[,)+∞)) = ran (𝐹 ↾ (ℤ_≥‘𝑛)))
48	26, 28, 47	3eqtrd 2777	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^*) = ran (𝐹 ↾ (ℤ_≥‘𝑛)))
49	48	supeq1d 9438	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^), ℝ^, < ) = sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^*, < ))
50	49	mpteq2dva 5248	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑛[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^*, < )))
51	20, 50	eqtrd 2773	. . . . 5 ⊢ (𝜑 → (𝑖 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^*, < )))
52	51	rneqd 5936	. . . 4 ⊢ (𝜑 → ran (𝑖 ∈ 𝑍 ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) = ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^*, < )))
53	14, 52	eqtrd 2773	. . 3 ⊢ (𝜑 → ((𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) “ 𝑍) = ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^*, < )))
54	53	infeq1d 9469	. 2 ⊢ (𝜑 → inf(((𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ^), ℝ^, < )) “ 𝑍), ℝ^, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < )), ℝ^*, < ))
55		fveq2 6889	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (ℤ_≥‘𝑛) = (ℤ_≥‘𝑘))
56	55	reseq2d 5980	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝐹 ↾ (ℤ_≥‘𝑛)) = (𝐹 ↾ (ℤ_≥‘𝑘)))
57	56	rneqd 5936	. . . . . . 7 ⊢ (𝑛 = 𝑘 → ran (𝐹 ↾ (ℤ_≥‘𝑛)) = ran (𝐹 ↾ (ℤ_≥‘𝑘)))
58	57	supeq1d 9438	. . . . . 6 ⊢ (𝑛 = 𝑘 → sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < ) = sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < ))
59	58	cbvmptv 5261	. . . . 5 ⊢ (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < )) = (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < ))
60	59	rneqi 5935	. . . 4 ⊢ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < )) = ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < ))
61	60	infeq1i 9470	. . 3 ⊢ inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < )), ℝ^, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < )), ℝ^, < )
62	61	a1i 11	. 2 ⊢ (𝜑 → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑛)), ℝ^, < )), ℝ^, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < )), ℝ^, < ))
63	13, 54, 62	3eqtrd 2777	1 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ_≥‘𝑘)), ℝ^, < )), ℝ^, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3475 ∩ cin 3947 ⊆ wss 3948 ↦ cmpt 5231 dom cdm 5676 ran crn 5677 ↾ cres 5678 “ cima 5679 Rel wrel 5681 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 supcsup 9432 infcinf 9433 ℝcr 11106 +∞cpnf 11242 ℝ^*cxr 11244 < clt 11245 ℤcz 12555 ℤ_≥cuz 12819 [,)cico 13323 lim supclsp 15411

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-sup 9434 df-inf 9435 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-n0 12470 df-z 12556 df-uz 12820 df-ico 13327 df-fl 13754 df-limsup 15412

This theorem is referenced by: limsupvaluzmpt 44420 limsupvaluz2 44441 limsupgtlem 44480

W3C validator