limsupre - Mathbox for Glauco Siliprandi

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

Theorem limsupre 45885

Description: If a sequence is bounded, then the limsup is real. (Contributed by Glauco Siliprandi, 11-Dec-2019.) (Revised by AV, 13-Sep-2020.)

**Hypotheses**
Ref	Expression
limsupre.1	⊢ (𝜑 → 𝐵 ⊆ ℝ)
limsupre.2	⊢ (𝜑 → sup(𝐵, ℝ^*, < ) = +∞)
limsupre.f	⊢ (𝜑 → 𝐹:𝐵⟶ℝ)
limsupre.bnd	⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))

**Assertion**
Ref	Expression
limsupre	⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)

Distinct variable groups: 𝐵,𝑗,𝑘 𝐹,𝑏,𝑗,𝑘 𝜑,𝑏,𝑗,𝑘 Allowed substitution hint: 𝐵(𝑏)

Proof of Theorem limsupre Dummy variables ℎ 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mnfxr 11189	. . . . 5 ⊢ -∞ ∈ ℝ^*
2	1	a1i 11	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → -∞ ∈ ℝ^*)
3		renegcl 11444	. . . . . 6 ⊢ (𝑏 ∈ ℝ → -𝑏 ∈ ℝ)
4	3	rexrd 11182	. . . . 5 ⊢ (𝑏 ∈ ℝ → -𝑏 ∈ ℝ^*)
5	4	ad2antlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → -𝑏 ∈ ℝ^*)
6		limsupre.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐵⟶ℝ)
7		reex 11117	. . . . . . . . 9 ⊢ ℝ ∈ V
8	7	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ℝ ∈ V)
9		limsupre.1	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ⊆ ℝ)
10	8, 9	ssexd 5269	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ V)
11	6, 10	fexd 7173	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ V)
12		limsupcl 15396	. . . . . 6 ⊢ (𝐹 ∈ V → (lim sup‘𝐹) ∈ ℝ^*)
13	11, 12	syl 17	. . . . 5 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ^*)
14	13	ad2antrr 726	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (lim sup‘𝐹) ∈ ℝ^*)
15	3	mnfltd 13038	. . . . 5 ⊢ (𝑏 ∈ ℝ → -∞ < -𝑏)
16	15	ad2antlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → -∞ < -𝑏)
17	9	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → 𝐵 ⊆ ℝ)
18		ressxr 11176	. . . . . . . 8 ⊢ ℝ ⊆ ℝ^*
19	18	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℝ^*)
20	6, 19	fssd 6679	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐵⟶ℝ^*)
21	20	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → 𝐹:𝐵⟶ℝ^*)
22		limsupre.2	. . . . . 6 ⊢ (𝜑 → sup(𝐵, ℝ^*, < ) = +∞)
23	22	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → sup(𝐵, ℝ^*, < ) = +∞)
24		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
25		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑏 ∈ ℝ)
26		nfre1 3261	. . . . . . . . 9 ⊢ Ⅎ𝑘∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)
27	25, 26	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
28		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑏 ∈ ℝ)
29		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 𝑘 ∈ ℝ
30		nfra1 3260	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)
31	28, 29, 30	nf3an 1902	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
32		simp13 1206	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
33		simp2 1137	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → 𝑗 ∈ 𝐵)
34		simp3 1138	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → 𝑘 ≤ 𝑗)
35		rspa 3225	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ∧ 𝑗 ∈ 𝐵) → (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
36	35	imp 406	. . . . . . . . . . . . . . 15 ⊢ (((∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ∧ 𝑗 ∈ 𝐵) ∧ 𝑘 ≤ 𝑗) → (abs‘(𝐹‘𝑗)) ≤ 𝑏)
37	32, 33, 34, 36	syl21anc 837	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → (abs‘(𝐹‘𝑗)) ≤ 𝑏)
38		simp11l 1285	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → 𝜑)
39	6	ffvelcdmda 7029	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐵) → (𝐹‘𝑗) ∈ ℝ)
40	38, 33, 39	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ∈ ℝ)
41		simp11r 1286	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → 𝑏 ∈ ℝ)
42	40, 41	absled 15356	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (-𝑏 ≤ (𝐹‘𝑗) ∧ (𝐹‘𝑗) ≤ 𝑏)))
43	37, 42	mpbid 232	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → (-𝑏 ≤ (𝐹‘𝑗) ∧ (𝐹‘𝑗) ≤ 𝑏))
44	43	simpld 494	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → -𝑏 ≤ (𝐹‘𝑗))
45	44	3exp 1119	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (𝑗 ∈ 𝐵 → (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
46	31, 45	ralrimi 3234	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))
47	46	3exp 1119	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → (𝑘 ∈ ℝ → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))))
48	47	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (𝑘 ∈ ℝ → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))))
49	27, 48	reximdai 3238	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
50	24, 49	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))
51		breq2 5102	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (ℎ ≤ 𝑖 ↔ ℎ ≤ 𝑗))
52		fveq2 6834	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (𝐹‘𝑖) = (𝐹‘𝑗))
53	52	breq2d 5110	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (-𝑏 ≤ (𝐹‘𝑖) ↔ -𝑏 ≤ (𝐹‘𝑗)))
54	51, 53	imbi12d 344	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ((ℎ ≤ 𝑖 → -𝑏 ≤ (𝐹‘𝑖)) ↔ (ℎ ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
55	54	cbvralvw 3214	. . . . . . . 8 ⊢ (∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → -𝑏 ≤ (𝐹‘𝑖)) ↔ ∀𝑗 ∈ 𝐵 (ℎ ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))
56		breq1 5101	. . . . . . . . . 10 ⊢ (ℎ = 𝑘 → (ℎ ≤ 𝑗 ↔ 𝑘 ≤ 𝑗))
57	56	imbi1d 341	. . . . . . . . 9 ⊢ (ℎ = 𝑘 → ((ℎ ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)) ↔ (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
58	57	ralbidv 3159	. . . . . . . 8 ⊢ (ℎ = 𝑘 → (∀𝑗 ∈ 𝐵 (ℎ ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)) ↔ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
59	55, 58	bitrid 283	. . . . . . 7 ⊢ (ℎ = 𝑘 → (∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → -𝑏 ≤ (𝐹‘𝑖)) ↔ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗))))
60	59	cbvrexvw 3215	. . . . . 6 ⊢ (∃ℎ ∈ ℝ ∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → -𝑏 ≤ (𝐹‘𝑖)) ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → -𝑏 ≤ (𝐹‘𝑗)))
61	50, 60	sylibr 234	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∃ℎ ∈ ℝ ∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → -𝑏 ≤ (𝐹‘𝑖)))
62	17, 21, 5, 23, 61	limsupbnd2 15406	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → -𝑏 ≤ (lim sup‘𝐹))
63	2, 5, 14, 16, 62	xrltletrd 13075	. . 3 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → -∞ < (lim sup‘𝐹))
64		limsupre.bnd	. . 3 ⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
65	63, 64	r19.29a 3144	. 2 ⊢ (𝜑 → -∞ < (lim sup‘𝐹))
66		rexr 11178	. . . . 5 ⊢ (𝑏 ∈ ℝ → 𝑏 ∈ ℝ^*)
67	66	ad2antlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → 𝑏 ∈ ℝ^*)
68		pnfxr 11186	. . . . 5 ⊢ +∞ ∈ ℝ^*
69	68	a1i 11	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → +∞ ∈ ℝ^*)
70	43	simprd 495	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) ∧ 𝑗 ∈ 𝐵 ∧ 𝑘 ≤ 𝑗) → (𝐹‘𝑗) ≤ 𝑏)
71	70	3exp 1119	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (𝑗 ∈ 𝐵 → (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
72	31, 71	ralrimi 3234	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ 𝑘 ∈ ℝ ∧ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))
73	72	3exp 1119	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ ℝ) → (𝑘 ∈ ℝ → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))))
74	73	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (𝑘 ∈ ℝ → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))))
75	27, 74	reximdai 3238	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
76	24, 75	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))
77	52	breq1d 5108	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝐹‘𝑖) ≤ 𝑏 ↔ (𝐹‘𝑗) ≤ 𝑏))
78	51, 77	imbi12d 344	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ((ℎ ≤ 𝑖 → (𝐹‘𝑖) ≤ 𝑏) ↔ (ℎ ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
79	78	cbvralvw 3214	. . . . . . . 8 ⊢ (∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → (𝐹‘𝑖) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐵 (ℎ ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))
80	56	imbi1d 341	. . . . . . . . 9 ⊢ (ℎ = 𝑘 → ((ℎ ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
81	80	ralbidv 3159	. . . . . . . 8 ⊢ (ℎ = 𝑘 → (∀𝑗 ∈ 𝐵 (ℎ ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
82	79, 81	bitrid 283	. . . . . . 7 ⊢ (ℎ = 𝑘 → (∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → (𝐹‘𝑖) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏)))
83	82	cbvrexvw 3215	. . . . . 6 ⊢ (∃ℎ ∈ ℝ ∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → (𝐹‘𝑖) ≤ 𝑏) ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝑏))
84	76, 83	sylibr 234	. . . . 5 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → ∃ℎ ∈ ℝ ∀𝑖 ∈ 𝐵 (ℎ ≤ 𝑖 → (𝐹‘𝑖) ≤ 𝑏))
85	17, 21, 67, 84	limsupbnd1 15405	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (lim sup‘𝐹) ≤ 𝑏)
86		ltpnf 13034	. . . . 5 ⊢ (𝑏 ∈ ℝ → 𝑏 < +∞)
87	86	ad2antlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → 𝑏 < +∞)
88	14, 67, 69, 85, 87	xrlelttrd 13074	. . 3 ⊢ (((𝜑 ∧ 𝑏 ∈ ℝ) ∧ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏)) → (lim sup‘𝐹) < +∞)
89	88, 64	r19.29a 3144	. 2 ⊢ (𝜑 → (lim sup‘𝐹) < +∞)
90		xrrebnd 13083	. . 3 ⊢ ((lim sup‘𝐹) ∈ ℝ^* → ((lim sup‘𝐹) ∈ ℝ ↔ (-∞ < (lim sup‘𝐹) ∧ (lim sup‘𝐹) < +∞)))
91	13, 90	syl 17	. 2 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℝ ↔ (-∞ < (lim sup‘𝐹) ∧ (lim sup‘𝐹) < +∞)))
92	65, 89, 91	mpbir2and 713	1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 Vcvv 3440 ⊆ wss 3901 class class class wbr 5098 ⟶wf 6488 ‘cfv 6492 supcsup 9343 ℝcr 11025 +∞cpnf 11163 -∞cmnf 11164 ℝ^*cxr 11165 < clt 11166 ≤ cle 11167 -cneg 11365 abscabs 15157 lim supclsp 15393

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-ico 13267 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-limsup 15394

This theorem is referenced by: limsupref 45929 ioodvbdlimc1lem2 46176 ioodvbdlimc2lem 46178

W3C validator