| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > limsuppnfd | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| limsuppnfd.j | ⊢ Ⅎ𝑗𝐹 |
| limsuppnfd.a | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| limsuppnfd.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) |
| limsuppnfd.u | ⊢ (𝜑 → ∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) |
| Ref | Expression |
|---|---|
| limsuppnfd | ⊢ (𝜑 → (lim sup‘𝐹) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | limsuppnfd.a | . 2 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 2 | limsuppnfd.f | . 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ*) | |
| 3 | limsuppnfd.u | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗))) | |
| 4 | breq1 5111 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ≤ (𝐹‘𝑗) ↔ 𝑦 ≤ (𝐹‘𝑗))) | |
| 5 | 4 | anbi2d 642 | . . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))) |
| 6 | 5 | rexbidv 3190 | . . . 4 ⊢ (𝑥 = 𝑦 → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))) |
| 7 | breq1 5111 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
| 8 | 7 | anbi1d 643 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ (𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))) |
| 9 | 8 | rexbidv 3190 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∃𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)))) |
| 10 | nfv 1949 | . . . . . . 7 ⊢ Ⅎ𝑙(𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) | |
| 11 | nfv 1949 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑙 | |
| 12 | nfcv 2926 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝑦 | |
| 13 | nfcv 2926 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
| 14 | limsuppnfd.j | . . . . . . . . . 10 ⊢ Ⅎ𝑗𝐹 | |
| 15 | nfcv 2926 | . . . . . . . . . 10 ⊢ Ⅎ𝑗𝑙 | |
| 16 | 14, 15 | nffv 6926 | . . . . . . . . 9 ⊢ Ⅎ𝑗(𝐹‘𝑙) |
| 17 | 12, 13, 16 | nfbr 5158 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑦 ≤ (𝐹‘𝑙) |
| 18 | 11, 17 | nfan 1934 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)) |
| 19 | breq2 5112 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑙)) | |
| 20 | fveq2 6916 | . . . . . . . . 9 ⊢ (𝑗 = 𝑙 → (𝐹‘𝑗) = (𝐹‘𝑙)) | |
| 21 | 20 | breq2d 5120 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → (𝑦 ≤ (𝐹‘𝑗) ↔ 𝑦 ≤ (𝐹‘𝑙))) |
| 22 | 19, 21 | anbi12d 644 | . . . . . . 7 ⊢ (𝑗 = 𝑙 → ((𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)))) |
| 23 | 10, 18, 22 | cbvrexw 3309 | . . . . . 6 ⊢ (∃𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))) |
| 24 | 23 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ 𝐴 (𝑖 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)))) |
| 25 | 9, 24 | bitrd 282 | . . . 4 ⊢ (𝑘 = 𝑖 → (∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑦 ≤ (𝐹‘𝑗)) ↔ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙)))) |
| 26 | 6, 25 | cbvral2vw 3248 | . . 3 ⊢ (∀𝑥 ∈ ℝ ∀𝑘 ∈ ℝ ∃𝑗 ∈ 𝐴 (𝑘 ≤ 𝑗 ∧ 𝑥 ≤ (𝐹‘𝑗)) ↔ ∀𝑦 ∈ ℝ ∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))) |
| 27 | 3, 26 | sylib 221 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ ℝ ∀𝑖 ∈ ℝ ∃𝑙 ∈ 𝐴 (𝑖 ≤ 𝑙 ∧ 𝑦 ≤ (𝐹‘𝑙))) |
| 28 | eqid 2763 | . 2 ⊢ (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) = (𝑖 ∈ ℝ ↦ sup(((𝐹 “ (𝑖[,)+∞)) ∩ ℝ*), ℝ*, < )) | |
| 29 | 1, 2, 27, 28 | limsuppnfdlem 47045 | 1 ⊢ (𝜑 → (lim sup‘𝐹) = +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 Ⅎwnfc 2911 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 ∩ cin 4092 class class class wbr 5108 ↦ cmpt 5192 “ cima 5661 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 supcsup 9469 ℝcr 11238 +∞cpnf 11379 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 [,)cico 13518 lim supclsp 15681 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-ico 13522 df-limsup 15682 |
| This theorem is used by: limsupub 47048 limsuppnflem 47054 |
| Copyright terms: Public domain | W3C validator |