Theorem limsupmnflem 45676

Description: The superior limit of a function is -∞ if and only if every real number is the upper bound of the restriction of the function to an upper interval of real numbers. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupmnflem.a	⊢ (𝜑 → 𝐴 ⊆ ℝ)
limsupmnflem.f	⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)
limsupmnflem.g	⊢ 𝐺 = (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ))

Assertion

Ref	Expression
limsupmnflem	⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))

Distinct variable groups:   𝐴,𝑗   𝑗,𝐹,𝑘,𝑥   𝜑,𝑗,𝑘,𝑥

Allowed substitution hints:   𝐴(𝑥,𝑘)   𝐺(𝑥,𝑗,𝑘)

Proof of Theorem limsupmnflem

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1912	. . . . 5 ⊢ Ⅎ𝑘𝜑
2		reex 11244	. . . . . . 7 ⊢ ℝ ∈ V
3	2	a1i 11	. . . . . 6 ⊢ (𝜑 → ℝ ∈ V)
4		limsupmnflem.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
5	3, 4	ssexd 5330	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ V)
6		limsupmnflem.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)
7		limsupmnflem.g	. . . . 5 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ))
8	1, 5, 6, 7	limsupval3 45648	. . . 4 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran 𝐺, ℝ*, < ))
9	7	rneqi 5951	. . . . . 6 ⊢ ran 𝐺 = ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ))
10	9	infeq1i 9516	. . . . 5 ⊢ inf(ran 𝐺, ℝ*, < ) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < )
11	10	a1i 11	. . . 4 ⊢ (𝜑 → inf(ran 𝐺, ℝ*, < ) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ))
12	8, 11	eqtrd 2775	. . 3 ⊢ (𝜑 → (lim sup‘𝐹) = inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ))
13	12	eqeq1d 2737	. 2 ⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = -∞))
14		nfv 1912	. . 3 ⊢ Ⅎ𝑥𝜑
15	6	fimassd 6758	. . . . 5 ⊢ (𝜑 → (𝐹 “ (𝑘[,)+∞)) ⊆ ℝ*)
16	15	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → (𝐹 “ (𝑘[,)+∞)) ⊆ ℝ*)
17	16	supxrcld 45047	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℝ) → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ∈ ℝ*)
18	1, 14, 17	infxrunb3rnmpt 45378	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑘 ∈ ℝ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ inf(ran (𝑘 ∈ ℝ ↦ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < )), ℝ*, < ) = -∞))
19	15	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹 “ (𝑘[,)+∞)) ⊆ ℝ*)
20		ressxr 11303	. . . . . . . . 9 ⊢ ℝ ⊆ ℝ*
21	20	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ℝ ⊆ ℝ*)
22	21	sselda 3995	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ*)
23		supxrleub 13365	. . . . . . 7 ⊢ (((𝐹 “ (𝑘[,)+∞)) ⊆ ℝ* ∧ 𝑥 ∈ ℝ*) → (sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥))
24	19, 22, 23	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥))
25	24	adantr 480	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥))
26	6	ffnd 6738	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹 Fn 𝐴)
27	26	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝐹 Fn 𝐴)
28		simplr 769	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑗 ∈ 𝐴)
29	20	sseli 3991	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℝ*)
30	29	ad3antlr 731	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑘 ∈ ℝ*)
31		pnfxr 11313	. . . . . . . . . . . . . . 15 ⊢ +∞ ∈ ℝ*
32	31	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → +∞ ∈ ℝ*)
33	20	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → ℝ ⊆ ℝ*)
34	4	sselda 3995	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝑗 ∈ ℝ)
35	33, 34	sseldd 3996	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝑗 ∈ ℝ*)
36	35	ad4ant13 751	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑗 ∈ ℝ*)
37		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑘 ≤ 𝑗)
38	34	ltpnfd 13161	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝑗 < +∞)
39	38	ad4ant13 751	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑗 < +∞)
40	30, 32, 36, 37, 39	elicod 13434	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → 𝑗 ∈ (𝑘[,)+∞))
41	27, 28, 40	fnfvimad 7254	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ∈ (𝐹 “ (𝑘[,)+∞)))
42	41	adantllr 719	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ∈ (𝐹 “ (𝑘[,)+∞)))
43		simpllr 776	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥)
44		breq1 5151	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑗) → (𝑦 ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥))
45	44	rspcva 3620	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑗) ∈ (𝐹 “ (𝑘[,)+∞)) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) → (𝐹‘𝑗) ≤ 𝑥)
46	42, 43, 45	syl2anc 584	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ≤ 𝑥)
47	46	adantl4r 755	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ≤ 𝑥)
48	47	ex 412	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
49	48	ralrimiva 3144	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥) → ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
50	49	ex 412	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥 → ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
51		nfcv 2903	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝐹
52	26	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐹 “ (𝑘[,)+∞))) → 𝐹 Fn 𝐴)
53		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐹 “ (𝑘[,)+∞))) → 𝑦 ∈ (𝐹 “ (𝑘[,)+∞)))
54	51, 52, 53	fvelimad 6976	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐹 “ (𝑘[,)+∞))) → ∃𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))(𝐹‘𝑗) = 𝑦)
55	54	ad4ant14 752	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑦 ∈ (𝐹 “ (𝑘[,)+∞))) → ∃𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))(𝐹‘𝑗) = 𝑦)
56		nfv 1912	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑘 ∈ ℝ)
57		nfra1 3282	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑗∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)
58	56, 57	nfan 1897	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
59		nfv 1912	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗 𝑦 ≤ 𝑥
60	29	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℝ ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → 𝑘 ∈ ℝ*)
61	31	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℝ ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → +∞ ∈ ℝ*)
62		elinel2 4212	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞)) → 𝑗 ∈ (𝑘[,)+∞))
63	62	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℝ ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → 𝑗 ∈ (𝑘[,)+∞))
64	60, 61, 63	icogelbd 45511	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ ℝ ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → 𝑘 ≤ 𝑗)
65	64	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → 𝑘 ≤ 𝑗)
66		elinel1 4211	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞)) → 𝑗 ∈ 𝐴)
67	66	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → 𝑗 ∈ 𝐴)
68		rspa 3246	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ∧ 𝑗 ∈ 𝐴) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
69	67, 68	syldan 591	. . . . . . . . . . . . . . . . . . 19 ⊢ ((∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
70	69	adantll 714	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥))
71	65, 70	mpd 15	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → (𝐹‘𝑗) ≤ 𝑥)
72		id 22	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹‘𝑗) = 𝑦 → (𝐹‘𝑗) = 𝑦)
73	72	eqcomd 2741	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹‘𝑗) = 𝑦 → 𝑦 = (𝐹‘𝑗))
74	73	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹‘𝑗) ≤ 𝑥 ∧ (𝐹‘𝑗) = 𝑦) → 𝑦 = (𝐹‘𝑗))
75		simpl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹‘𝑗) ≤ 𝑥 ∧ (𝐹‘𝑗) = 𝑦) → (𝐹‘𝑗) ≤ 𝑥)
76	74, 75	eqbrtrd 5170	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑗) ≤ 𝑥 ∧ (𝐹‘𝑗) = 𝑦) → 𝑦 ≤ 𝑥)
77	76	ex 412	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹‘𝑗) ≤ 𝑥 → ((𝐹‘𝑗) = 𝑦 → 𝑦 ≤ 𝑥))
78	71, 77	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → ((𝐹‘𝑗) = 𝑦 → 𝑦 ≤ 𝑥))
79	78	adantlll 718	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))) → ((𝐹‘𝑗) = 𝑦 → 𝑦 ≤ 𝑥))
80	79	ex 412	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → (𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞)) → ((𝐹‘𝑗) = 𝑦 → 𝑦 ≤ 𝑥)))
81	58, 59, 80	rexlimd 3264	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → (∃𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))(𝐹‘𝑗) = 𝑦 → 𝑦 ≤ 𝑥))
82	81	imp 406	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ ∃𝑗 ∈ (𝐴 ∩ (𝑘[,)+∞))(𝐹‘𝑗) = 𝑦) → 𝑦 ≤ 𝑥)
83	55, 82	syldan 591	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) ∧ 𝑦 ∈ (𝐹 “ (𝑘[,)+∞))) → 𝑦 ≤ 𝑥)
84	83	ralrimiva 3144	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥)
85	84	adantllr 719	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥)
86	24	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → (sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥))
87	85, 86	mpbird 257	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) ∧ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)) → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥)
88	87	ex 412	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥))
89	88, 25	sylibd 239	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥) → ∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥))
90	50, 89	impbid 212	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (∀𝑦 ∈ (𝐹 “ (𝑘[,)+∞))𝑦 ≤ 𝑥 ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
91	25, 90	bitrd 279	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ ℝ) → (sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
92	91	rexbidva 3175	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∃𝑘 ∈ ℝ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
93	92	ralbidva 3174	. 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ ∃𝑘 ∈ ℝ sup((𝐹 “ (𝑘[,)+∞)), ℝ*, < ) ≤ 𝑥 ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))
94	13, 18, 93	3bitr2d 307	1 ⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068  Vcvv 3478   ∩ cin 3962   ⊆ wss 3963   class class class wbr 5148   ↦ cmpt 5231  ran crn 5690   “ cima 5692   Fn wfn 6558  ⟶wf 6559  ‘cfv 6563  (class class class)co 7431  supcsup 9478  infcinf 9479  ℝcr 11152  +∞cpnf 11290  -∞cmnf 11291  ℝ^*cxr 11292   < clt 11293   ≤ cle 11294  [,)cico 13386  lim supclsp 15503

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-po 5597  df-so 5598  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-sup 9480  df-inf 9481  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-ico 13390  df-limsup 15504

This theorem is referenced by:  limsupmnf  45677