Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupbnd1f | Structured version Visualization version GIF version |
Description: If a sequence is eventually at most 𝐴, then the limsup is also at most 𝐴. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsupbnd1f.1 | ⊢ Ⅎ𝑗𝐹 |
limsupbnd1f.2 | ⊢ (𝜑 → 𝐵 ⊆ ℝ) |
limsupbnd1f.3 | ⊢ (𝜑 → 𝐹:𝐵⟶ℝ*) |
limsupbnd1f.4 | ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
limsupbnd1f.5 | ⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴)) |
Ref | Expression |
---|---|
limsupbnd1f | ⊢ (𝜑 → (lim sup‘𝐹) ≤ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | limsupbnd1f.2 | . 2 ⊢ (𝜑 → 𝐵 ⊆ ℝ) | |
2 | limsupbnd1f.3 | . 2 ⊢ (𝜑 → 𝐹:𝐵⟶ℝ*) | |
3 | limsupbnd1f.4 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
4 | limsupbnd1f.5 | . . 3 ⊢ (𝜑 → ∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴)) | |
5 | breq1 4656 | . . . . . . 7 ⊢ (𝑘 = 𝑖 → (𝑘 ≤ 𝑗 ↔ 𝑖 ≤ 𝑗)) | |
6 | 5 | imbi1d 331 | . . . . . 6 ⊢ (𝑘 = 𝑖 → ((𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ (𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴))) |
7 | 6 | ralbidv 2986 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ ∀𝑗 ∈ 𝐵 (𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴))) |
8 | nfv 1843 | . . . . . . 7 ⊢ Ⅎ𝑙(𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) | |
9 | nfv 1843 | . . . . . . . 8 ⊢ Ⅎ𝑗 𝑖 ≤ 𝑙 | |
10 | limsupbnd1f.1 | . . . . . . . . . 10 ⊢ Ⅎ𝑗𝐹 | |
11 | nfcv 2764 | . . . . . . . . . 10 ⊢ Ⅎ𝑗𝑙 | |
12 | 10, 11 | nffv 6198 | . . . . . . . . 9 ⊢ Ⅎ𝑗(𝐹‘𝑙) |
13 | nfcv 2764 | . . . . . . . . 9 ⊢ Ⅎ𝑗 ≤ | |
14 | nfcv 2764 | . . . . . . . . 9 ⊢ Ⅎ𝑗𝐴 | |
15 | 12, 13, 14 | nfbr 4699 | . . . . . . . 8 ⊢ Ⅎ𝑗(𝐹‘𝑙) ≤ 𝐴 |
16 | 9, 15 | nfim 1825 | . . . . . . 7 ⊢ Ⅎ𝑗(𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴) |
17 | breq2 4657 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → (𝑖 ≤ 𝑗 ↔ 𝑖 ≤ 𝑙)) | |
18 | fveq2 6191 | . . . . . . . . 9 ⊢ (𝑗 = 𝑙 → (𝐹‘𝑗) = (𝐹‘𝑙)) | |
19 | 18 | breq1d 4663 | . . . . . . . 8 ⊢ (𝑗 = 𝑙 → ((𝐹‘𝑗) ≤ 𝐴 ↔ (𝐹‘𝑙) ≤ 𝐴)) |
20 | 17, 19 | imbi12d 334 | . . . . . . 7 ⊢ (𝑗 = 𝑙 → ((𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴))) |
21 | 8, 16, 20 | cbvral 3167 | . . . . . 6 ⊢ (∀𝑗 ∈ 𝐵 (𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ ∀𝑙 ∈ 𝐵 (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴)) |
22 | 21 | a1i 11 | . . . . 5 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐵 (𝑖 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ ∀𝑙 ∈ 𝐵 (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴))) |
23 | 7, 22 | bitrd 268 | . . . 4 ⊢ (𝑘 = 𝑖 → (∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ ∀𝑙 ∈ 𝐵 (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴))) |
24 | 23 | cbvrexv 3172 | . . 3 ⊢ (∃𝑘 ∈ ℝ ∀𝑗 ∈ 𝐵 (𝑘 ≤ 𝑗 → (𝐹‘𝑗) ≤ 𝐴) ↔ ∃𝑖 ∈ ℝ ∀𝑙 ∈ 𝐵 (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴)) |
25 | 4, 24 | sylib 208 | . 2 ⊢ (𝜑 → ∃𝑖 ∈ ℝ ∀𝑙 ∈ 𝐵 (𝑖 ≤ 𝑙 → (𝐹‘𝑙) ≤ 𝐴)) |
26 | 1, 2, 3, 25 | limsupbnd1 14213 | 1 ⊢ (𝜑 → (lim sup‘𝐹) ≤ 𝐴) |
Colors of variables: wff setvar class |
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 ℝcr 9935 ℝ*cxr 10073 ≤ cle 10075 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-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-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 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-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-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-ico 12181 df-limsup 14202 |
This theorem is referenced by: limsuppnflem 39942 |
Copyright terms: Public domain | W3C validator |