Theorem limsupvaluz2 45736

Description: The superior limit, when the domain of a real-valued function is a set of upper integers, and the superior limit is real. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupvaluz2.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
limsupvaluz2.z	⊢ 𝑍 = (ℤ≥‘𝑀)
limsupvaluz2.f	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
limsupvaluz2.r	⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)

Assertion

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

Distinct variable groups:   𝑘,𝐹   𝑘,𝑍

Allowed substitution hints:   𝜑(𝑘)   𝑀(𝑘)

Proof of Theorem limsupvaluz2

Dummy variables 𝑖 𝑗 𝑥 𝑛 𝑚 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limsupvaluz2.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
2		limsupvaluz2.z	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
3		limsupvaluz2.f	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
4	3	frexr 45381	. . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*)
5	1, 2, 4	limsupvaluz 45706	. 2 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ))
6	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝐹:𝑍⟶ℝ)
7	2	uzssd3 45422	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ⊆ 𝑍)
8	7	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ⊆ 𝑍)
9	6, 8	feqresmpt 6930	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)))
10	9	rneqd 5902	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)))
11	10	supeq1d 9397	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ))
12		nfcv 2891	. . . . . . . . . 10 ⊢ Ⅎ𝑚𝐹
13		limsupvaluz2.r	. . . . . . . . . . 11 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)
14	13	renepnfd 11225	. . . . . . . . . 10 ⊢ (𝜑 → (lim sup‘𝐹) ≠ +∞)
15	12, 2, 3, 14	limsupubuz 45711	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥)
16	15	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥)
17		ssralv 4015	. . . . . . . . . . 11 ⊢ ((ℤ≥‘𝑛) ⊆ 𝑍 → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
18	7, 17	syl 17	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑍 → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
19	18	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
20	19	reximdv 3148	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (∃𝑥 ∈ ℝ ∀𝑚 ∈ 𝑍 (𝐹‘𝑚) ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
21	16, 20	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥)
22		nfv 1914	. . . . . . . 8 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍)
23	2	eluzelz2 45399	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ ℤ)
24		uzid 12808	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
25		ne0i 4304	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘𝑛) → (ℤ≥‘𝑛) ≠ ∅)
26	23, 24, 25	3syl 18	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ≠ ∅)
27	26	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (ℤ≥‘𝑛) ≠ ∅)
28	6	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝐹:𝑍⟶ℝ)
29	8	sselda 3946	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → 𝑚 ∈ 𝑍)
30	28, 29	ffvelcdmd 7057	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ≥‘𝑛)) → (𝐹‘𝑚) ∈ ℝ)
31	22, 27, 30	supxrre3rnmpt 45425	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ) ∈ ℝ ↔ ∃𝑥 ∈ ℝ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝐹‘𝑚) ≤ 𝑥))
32	21, 31	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ (𝐹‘𝑚)), ℝ*, < ) ∈ ℝ)
33	11, 32	eqeltrd 2828	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) ∈ ℝ)
34	33	fmpttd 7087	. . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )):𝑍⟶ℝ)
35	34	frnd 6696	. . 3 ⊢ (𝜑 → ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ⊆ ℝ)
36		nfv 1914	. . . 4 ⊢ Ⅎ𝑛𝜑
37		eqid 2729	. . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
38	1, 2	uzn0d 45421	. . . 4 ⊢ (𝜑 → 𝑍 ≠ ∅)
39	36, 33, 37, 38	rnmptn0 6217	. . 3 ⊢ (𝜑 → ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ≠ ∅)
40		nfcv 2891	. . . . . . . . 9 ⊢ Ⅎ𝑗𝐹
41	40, 1, 2, 4	limsupre3uz 45734	. . . . . . . 8 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)(𝐹‘𝑗) ≤ 𝑥)))
42	13, 41	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) ∧ ∃𝑥 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑖)(𝐹‘𝑗) ≤ 𝑥))
43	42	simpld 494	. . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗))
44		simp-4r 783	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ∈ ℝ)
45	44	rexrd 11224	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ∈ ℝ*)
46	4	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝐹:𝑍⟶ℝ*)
47	2	uztrn2 12812	. . . . . . . . . . . . 13 ⊢ ((𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝑗 ∈ 𝑍)
48	47	3adant1 1130	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → 𝑗 ∈ 𝑍)
49	46, 48	ffvelcdmd 7057	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ∈ ℝ*)
50	49	ad5ant134 1369	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → (𝐹‘𝑗) ∈ ℝ*)
51		rnresss 5988	. . . . . . . . . . . . . 14 ⊢ ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ran 𝐹
52	3	frnd 6696	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
53	52	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran 𝐹 ⊆ ℝ)
54	51, 53	sstrid 3958	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ)
55	54	ssrexr 45428	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ*)
56	55	supxrcld 45101	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ∈ ℝ*)
57	56	ad5ant13 756	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ∈ ℝ*)
58		simpr 484	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ≤ (𝐹‘𝑗))
59	55	3adant3 1132	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ran (𝐹 ↾ (ℤ≥‘𝑖)) ⊆ ℝ*)
60		fvres 6877	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ (ℤ≥‘𝑖) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) = (𝐹‘𝑗))
61	60	eqcomd 2735	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ (ℤ≥‘𝑖) → (𝐹‘𝑗) = ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗))
62	61	3ad2ant3 1135	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) = ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗))
63	3	ffnd 6689	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 Fn 𝑍)
64	2	uzssd3 45422	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ 𝑍 → (ℤ≥‘𝑖) ⊆ 𝑍)
65		fnssres 6641	. . . . . . . . . . . . . . 15 ⊢ ((𝐹 Fn 𝑍 ∧ (ℤ≥‘𝑖) ⊆ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖))
66	63, 64, 65	syl2an 596	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍) → (𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖))
67		fnfvelrn 7052	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ↾ (ℤ≥‘𝑖)) Fn (ℤ≥‘𝑖) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
68	66, 67	stoic3 1776	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → ((𝐹 ↾ (ℤ≥‘𝑖))‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
69	62, 68	eqeltrd 2828	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ∈ ran (𝐹 ↾ (ℤ≥‘𝑖)))
70		eqid 2729	. . . . . . . . . . . 12 ⊢ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )
71	59, 69, 70	supxrubd 45107	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑖)) → (𝐹‘𝑗) ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
72	71	ad5ant134 1369	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → (𝐹‘𝑗) ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
73	45, 50, 57, 58, 72	xrletrd 13122	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑖)) ∧ 𝑥 ≤ (𝐹‘𝑗)) → 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
74	73	rexlimdva2 3136	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑖 ∈ 𝑍) → (∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
75	74	ralimdva 3145	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
76	75	reximdva 3146	. . . . . 6 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑖)𝑥 ≤ (𝐹‘𝑗) → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < )))
77	43, 76	mpd 15	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
78		fveq2 6858	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑖 → (ℤ≥‘𝑛) = (ℤ≥‘𝑖))
79	78	reseq2d 5950	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑖 → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝐹 ↾ (ℤ≥‘𝑖)))
80	79	rneqd 5902	. . . . . . . . . 10 ⊢ (𝑛 = 𝑖 → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝐹 ↾ (ℤ≥‘𝑖)))
81	80	supeq1d 9397	. . . . . . . . 9 ⊢ (𝑛 = 𝑖 → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ))
82		eqcom 2736	. . . . . . . . 9 ⊢ (𝑛 = 𝑖 ↔ 𝑖 = 𝑛)
83		eqcom 2736	. . . . . . . . 9 ⊢ (sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
84	81, 82, 83	3imtr3i 291	. . . . . . . 8 ⊢ (𝑖 = 𝑛 → sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
85	84	breq2d 5119	. . . . . . 7 ⊢ (𝑖 = 𝑛 → (𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )))
86	85	cbvralvw 3215	. . . . . 6 ⊢ (∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
87	86	rexbii 3076	. . . . 5 ⊢ (∃𝑥 ∈ ℝ ∀𝑖 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑖)), ℝ*, < ) ↔ ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
88	77, 87	sylib 218	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))
89	36, 33	rnmptbd2 45243	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑥 ≤ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦))
90	88, 89	mpbid 232	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦)
91		infxrre 13297	. . 3 ⊢ ((ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ))𝑥 ≤ 𝑦) → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ))
92	35, 39, 90, 91	syl3anc 1373	. 2 ⊢ (𝜑 → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ*, < ) = inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ))
93		fveq2 6858	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (ℤ≥‘𝑛) = (ℤ≥‘𝑘))
94	93	reseq2d 5950	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → (𝐹 ↾ (ℤ≥‘𝑛)) = (𝐹 ↾ (ℤ≥‘𝑘)))
95	94	rneqd 5902	. . . . . . 7 ⊢ (𝑛 = 𝑘 → ran (𝐹 ↾ (ℤ≥‘𝑛)) = ran (𝐹 ↾ (ℤ≥‘𝑘)))
96	95	supeq1d 9397	. . . . . 6 ⊢ (𝑛 = 𝑘 → sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < ) = sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
97	96	cbvmptv 5211	. . . . 5 ⊢ (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
98	97	rneqi 5901	. . . 4 ⊢ ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )) = ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < ))
99	98	infeq1i 9430	. . 3 ⊢ inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < )
100	99	a1i 11	. 2 ⊢ (𝜑 → inf(ran (𝑛 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑛)), ℝ*, < )), ℝ, < ) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < ))
101	5, 92, 100	3eqtrd 2768	1 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ 𝑍 ↦ sup(ran (𝐹 ↾ (ℤ≥‘𝑘)), ℝ*, < )), ℝ, < ))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053   ⊆ wss 3914  ∅c0 4296   class class class wbr 5107   ↦ cmpt 5188  ran crn 5639   ↾ cres 5640   Fn wfn 6506  ⟶wf 6507  ‘cfv 6511  supcsup 9391  infcinf 9392  ℝcr 11067  ℝ^*cxr 11207   < clt 11208   ≤ cle 11209  ℤcz 12529  ℤ_≥cuz 12793  lim supclsp 15436

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145  ax-pre-sup 11146

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-sup 9393  df-inf 9394  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-n0 12443  df-z 12530  df-uz 12794  df-ico 13312  df-fz 13469  df-fl 13754  df-ceil 13755  df-limsup 15437

This theorem is referenced by:  supcnvlimsup  45738