Theorem limsupref 39917

Description: If a sequence is bounded, then the limsup is real. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsupref.j	⊢ Ⅎ𝑗𝐹
limsupref.a	⊢ (𝜑 → 𝐴 ⊆ ℝ)
limsupref.s	⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞)
limsupref.f	⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
limsupref.b	⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))

Assertion

Ref	Expression
limsupref	⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)

Distinct variable groups:   𝐴,𝑏,𝑗,𝑘   𝐹,𝑏,𝑘

Allowed substitution hints:   𝜑(𝑗,𝑘,𝑏)   𝐹(𝑗)

Proof of Theorem limsupref

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

Step	Hyp	Ref	Expression
1		limsupref.a	. 2 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
2		limsupref.s	. 2 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞)
3		limsupref.f	. 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
4		limsupref.b	. . 3 ⊢ (𝜑 → ∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏))
5		breq2 4657	. . . . . . . 8 ⊢ (𝑏 = 𝑦 → ((abs‘(𝐹‘𝑗)) ≤ 𝑏 ↔ (abs‘(𝐹‘𝑗)) ≤ 𝑦))
6	5	imbi2d 330	. . . . . . 7 ⊢ (𝑏 = 𝑦 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)))
7	6	ralbidv 2986	. . . . . 6 ⊢ (𝑏 = 𝑦 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)))
8	7	rexbidv 3052	. . . . 5 ⊢ (𝑏 = 𝑦 → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)))
9		breq1 4656	. . . . . . . . . 10 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗))
10	9	imbi1d 331	. . . . . . . . 9 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)))
11	10	ralbidv 2986	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)))
12		nfv 1843	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦)
13		nfv 1843	. . . . . . . . . . 11 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑥
14		nfcv 2764	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗abs
15		limsupref.j	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝐹
16		nfcv 2764	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑗𝑥
17	15, 16	nffv 6198	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗(𝐹‘𝑥)
18	14, 17	nffv 6198	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥))
19		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
20		nfcv 2764	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑦
21	18, 19, 20	nfbr 4699	. . . . . . . . . . 11 ⊢ Ⅎ𝑗(abs‘(𝐹‘𝑥)) ≤ 𝑦
22	13, 21	nfim 1825	. . . . . . . . . 10 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)
23		breq2 4657	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑥 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑥))
24		fveq2 6191	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑥 → (𝐹‘𝑗) = (𝐹‘𝑥))
25	24	fveq2d 6195	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑥 → (abs‘(𝐹‘𝑗)) = (abs‘(𝐹‘𝑥)))
26	25	breq1d 4663	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑥 → ((abs‘(𝐹‘𝑗)) ≤ 𝑦 ↔ (abs‘(𝐹‘𝑥)) ≤ 𝑦))
27	23, 26	imbi12d 334	. . . . . . . . . 10 ⊢ (𝑗 = 𝑥 → ((𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)))
28	12, 22, 27	cbvral 3167	. . . . . . . . 9 ⊢ (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))
29	28	a1i 11	. . . . . . . 8 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)))
30	11, 29	bitrd 268	. . . . . . 7 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)))
31	30	cbvrexv 3172	. . . . . 6 ⊢ (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))
32	31	a1i 11	. . . . 5 ⊢ (𝑏 = 𝑦 → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑦) ↔ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)))
33	8, 32	bitrd 268	. . . 4 ⊢ (𝑏 = 𝑦 → (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦)))
34	33	cbvrexv 3172	. . 3 ⊢ (∃𝑏 ∈ ℝ ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 → (abs‘(𝐹‘𝑗)) ≤ 𝑏) ↔ ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))
35	4, 34	sylib 208	. 2 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∃𝑖 ∈ ℝ ∀𝑥 ∈ 𝐴 (𝑖 ≤ 𝑥 → (abs‘(𝐹‘𝑥)) ≤ 𝑦))
36	1, 2, 3, 35	limsupre 39873	1 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)

Syntax hints:   → wi 4   ↔ wb 196   = wceq 1483   ∈ wcel 1990  Ⅎwnfc 2751  ∀wral 2912  ∃wrex 2913   ⊆ wss 3574   class class class wbr 4653  ⟶wf 5884  ‘cfv 5888  supcsup 8346  ℝcr 9935  +∞cpnf 10071  ℝ^*cxr 10073   < clt 10074   ≤ cle 10075  abscabs 13974  lim supclsp 14201

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-sup 8348  df-inf 8349  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-rp 11833  df-ico 12181  df-seq 12802  df-exp 12861  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-limsup 14202

This theorem is referenced by: (None)