Theorem limsuppnf 45897

Description: If the restriction of a function to every upper interval is unbounded above, its lim sup is +∞. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
limsuppnf.j	⊢ Ⅎ𝑗𝐹
limsuppnf.a	⊢ (𝜑 → 𝐴 ⊆ ℝ)
limsuppnf.f	⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)

Assertion

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

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

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

Proof of Theorem limsuppnf

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

Step	Hyp	Ref	Expression
1		nfcv 2896	. . 3 ⊢ Ⅎ𝑙𝐹
2		limsuppnf.a	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
3		limsuppnf.f	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*)
4	1, 2, 3	limsuppnflem 45896	. 2 ⊢ (𝜑 → ((lim sup‘𝐹) = +∞ ↔ ∀𝑦 ∈ ℝ ∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))))
5		breq1 5099	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (𝑖 ≤ 𝑙 ↔ 𝑘 ≤ 𝑙))
6	5	anbi1d 631	. . . . . . . . 9 ⊢ (𝑖 = 𝑘 → ((𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ (𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))))
7	6	rexbidv 3158	. . . . . . . 8 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∃𝑙 ∈ 𝐴 (𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))))
8		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑗 𝑘 ≤ 𝑙
9		nfcv 2896	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑦
10		nfcv 2896	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
11		limsuppnf.j	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝐹
12		nfcv 2896	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝑙
13	11, 12	nffv 6842	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝐹‘𝑙)
14	9, 10, 13	nfbr 5143	. . . . . . . . . . 11 ⊢ Ⅎ𝑗 𝑦 ≤ (𝐹‘𝑙)
15	8, 14	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑗(𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))
16		nfv 1915	. . . . . . . . . 10 ⊢ Ⅎ𝑙(𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))
17		breq2 5100	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑗 → (𝑘 ≤ 𝑙 ↔ 𝑘 ≤ 𝑗))
18		fveq2 6832	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑗 → (𝐹‘𝑙) = (𝐹‘𝑗))
19	18	breq2d 5108	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑗 → (𝑦 ≤ (𝐹‘𝑙) ↔ 𝑦 ≤ (𝐹‘𝑗)))
20	17, 19	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑙 = 𝑗 → ((𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
21	15, 16, 20	cbvrexw 3277	. . . . . . . . 9 ⊢ (∃𝑙 ∈ 𝐴 (𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))
22	21	a1i 11	. . . . . . . 8 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ 𝐴 (𝑘 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
23	7, 22	bitrd 279	. . . . . . 7 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
24	23	cbvralvw 3212	. . . . . 6 ⊢ (∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))
25	24	a1i 11	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗))))
26		breq1 5099	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ (𝐹‘𝑗) ↔ 𝑥 ≤ (𝐹‘𝑗)))
27	26	anbi2d 630	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
28	27	rexbidv 3158	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
29	28	ralbidv 3157	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
30	25, 29	bitrd 279	. . . 4 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
31	30	cbvralvw 3212	. . 3 ⊢ (∀𝑦 ∈ ℝ ∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)))
32	31	a1i 11	. 2 ⊢ (𝜑 → (∀𝑦 ∈ ℝ ∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) ↔ ∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))
33	4, 32	bitrd 279	1 ⊢ (𝜑 → ((lim sup‘𝐹) = +∞ ↔ ∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  Ⅎwnfc 2881  ∀wral 3049  ∃wrex 3058   ⊆ wss 3899   class class class wbr 5096  ⟶wf 6486  ‘cfv 6490  ℝcr 11023  +∞cpnf 11161  ℝ^*cxr 11163   ≤ cle 11165  lim supclsp 15391

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 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-cnex 11080  ax-resscn 11081  ax-1cn 11082  ax-icn 11083  ax-addcl 11084  ax-addrcl 11085  ax-mulcl 11086  ax-mulrcl 11087  ax-mulcom 11088  ax-addass 11089  ax-mulass 11090  ax-distr 11091  ax-i2m1 11092  ax-1ne0 11093  ax-1rid 11094  ax-rnegex 11095  ax-rrecex 11096  ax-cnre 11097  ax-pre-lttri 11098  ax-pre-lttrn 11099  ax-pre-ltadd 11100  ax-pre-mulgt0 11101  ax-pre-sup 11102

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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-po 5530  df-so 5531  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-er 8633  df-en 8882  df-dom 8883  df-sdom 8884  df-sup 9343  df-inf 9344  df-pnf 11166  df-mnf 11167  df-xr 11168  df-ltxr 11169  df-le 11170  df-sub 11364  df-neg 11365  df-ico 13265  df-limsup 15392

This theorem is referenced by:  limsupre2lem  45910