Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupmnfuz | Structured version Visualization version GIF version |
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 a set of upper integers. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsupmnfuz.1 | ⊢ Ⅎ𝑗𝐹 |
limsupmnfuz.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
limsupmnfuz.3 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
limsupmnfuz.4 | ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*) |
Ref | Expression |
---|---|
limsupmnfuz | ⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | limsupmnfuz.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
2 | limsupmnfuz.3 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
3 | limsupmnfuz.4 | . . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ*) | |
4 | 1, 2, 3 | limsupmnfuzlem 42005 | . 2 ⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ ∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦)) |
5 | breq2 5069 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑙) ≤ 𝑦 ↔ (𝐹‘𝑙) ≤ 𝑥)) | |
6 | 5 | ralbidv 3197 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥)) |
7 | 6 | rexbidv 3297 | . . . . 5 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥)) |
8 | fveq2 6669 | . . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (ℤ≥‘𝑖) = (ℤ≥‘𝑘)) | |
9 | 8 | raleqdv 3415 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥)) |
10 | limsupmnfuz.1 | . . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝐹 | |
11 | nfcv 2977 | . . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑙 | |
12 | 10, 11 | nffv 6679 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗(𝐹‘𝑙) |
13 | nfcv 2977 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗 ≤ | |
14 | nfcv 2977 | . . . . . . . . . . 11 ⊢ Ⅎ𝑗𝑥 | |
15 | 12, 13, 14 | nfbr 5112 | . . . . . . . . . 10 ⊢ Ⅎ𝑗(𝐹‘𝑙) ≤ 𝑥 |
16 | nfv 1911 | . . . . . . . . . 10 ⊢ Ⅎ𝑙(𝐹‘𝑗) ≤ 𝑥 | |
17 | fveq2 6669 | . . . . . . . . . . 11 ⊢ (𝑙 = 𝑗 → (𝐹‘𝑙) = (𝐹‘𝑗)) | |
18 | 17 | breq1d 5075 | . . . . . . . . . 10 ⊢ (𝑙 = 𝑗 → ((𝐹‘𝑙) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥)) |
19 | 15, 16, 18 | cbvralw 3441 | . . . . . . . . 9 ⊢ (∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) |
20 | 19 | a1i 11 | . . . . . . . 8 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
21 | 9, 20 | bitrd 281 | . . . . . . 7 ⊢ (𝑖 = 𝑘 → (∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
22 | 21 | cbvrexvw 3450 | . . . . . 6 ⊢ (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) |
23 | 22 | a1i 11 | . . . . 5 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
24 | 7, 23 | bitrd 281 | . . . 4 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
25 | 24 | cbvralvw 3449 | . . 3 ⊢ (∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) |
26 | 25 | a1i 11 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ ℝ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
27 | 4, 26 | bitrd 281 | 1 ⊢ (𝜑 → ((lim sup‘𝐹) = -∞ ↔ ∀𝑥 ∈ ℝ ∃𝑘 ∈ 𝑍 ∀𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1533 ∈ wcel 2110 Ⅎwnfc 2961 ∀wral 3138 ∃wrex 3139 class class class wbr 5065 ⟶wf 6350 ‘cfv 6354 ℝcr 10535 -∞cmnf 10672 ℝ*cxr 10673 ≤ cle 10675 ℤcz 11980 ℤ≥cuz 12242 lim supclsp 14826 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-pre-sup 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-sup 8905 df-inf 8906 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-n0 11897 df-z 11981 df-uz 12243 df-ico 12743 df-fl 13161 df-ceil 13162 df-limsup 14827 |
This theorem is referenced by: liminfpnfuz 42095 xlimmnflimsup2 42131 xlimmnflimsup 42135 |
Copyright terms: Public domain | W3C validator |