Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupequz | Structured version Visualization version GIF version |
Description: Two functions that are eventually equal to one another have the same superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
Ref | Expression |
---|---|
limsupequz.1 | ⊢ Ⅎ𝑘𝜑 |
limsupequz.2 | ⊢ Ⅎ𝑘𝐹 |
limsupequz.3 | ⊢ Ⅎ𝑘𝐺 |
limsupequz.4 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
limsupequz.5 | ⊢ (𝜑 → 𝐹 Fn (ℤ≥‘𝑀)) |
limsupequz.6 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
limsupequz.7 | ⊢ (𝜑 → 𝐺 Fn (ℤ≥‘𝑁)) |
limsupequz.8 | ⊢ (𝜑 → 𝐾 ∈ ℤ) |
limsupequz.9 | ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) |
Ref | Expression |
---|---|
limsupequz | ⊢ (𝜑 → (lim sup‘𝐹) = (lim sup‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1918 | . 2 ⊢ Ⅎ𝑗𝜑 | |
2 | limsupequz.4 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | limsupequz.5 | . 2 ⊢ (𝜑 → 𝐹 Fn (ℤ≥‘𝑀)) | |
4 | limsupequz.6 | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
5 | limsupequz.7 | . 2 ⊢ (𝜑 → 𝐺 Fn (ℤ≥‘𝑁)) | |
6 | limsupequz.8 | . 2 ⊢ (𝜑 → 𝐾 ∈ ℤ) | |
7 | limsupequz.1 | . . . . 5 ⊢ Ⅎ𝑘𝜑 | |
8 | nfv 1918 | . . . . 5 ⊢ Ⅎ𝑘 𝑗 ∈ (ℤ≥‘𝐾) | |
9 | 7, 8 | nfan 1903 | . . . 4 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) |
10 | limsupequz.2 | . . . . . 6 ⊢ Ⅎ𝑘𝐹 | |
11 | nfcv 2906 | . . . . . 6 ⊢ Ⅎ𝑘𝑗 | |
12 | 10, 11 | nffv 6766 | . . . . 5 ⊢ Ⅎ𝑘(𝐹‘𝑗) |
13 | limsupequz.3 | . . . . . 6 ⊢ Ⅎ𝑘𝐺 | |
14 | 13, 11 | nffv 6766 | . . . . 5 ⊢ Ⅎ𝑘(𝐺‘𝑗) |
15 | 12, 14 | nfeq 2919 | . . . 4 ⊢ Ⅎ𝑘(𝐹‘𝑗) = (𝐺‘𝑗) |
16 | 9, 15 | nfim 1900 | . . 3 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
17 | eleq1w 2821 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ (ℤ≥‘𝐾) ↔ 𝑗 ∈ (ℤ≥‘𝐾))) | |
18 | 17 | anbi2d 628 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ↔ (𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)))) |
19 | fveq2 6756 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
20 | fveq2 6756 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐺‘𝑘) = (𝐺‘𝑗)) | |
21 | 19, 20 | eqeq12d 2754 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) = (𝐺‘𝑘) ↔ (𝐹‘𝑗) = (𝐺‘𝑗))) |
22 | 18, 21 | imbi12d 344 | . . 3 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) ↔ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)))) |
23 | limsupequz.9 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) | |
24 | 16, 22, 23 | chvarfv 2236 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
25 | 1, 2, 3, 4, 5, 6, 24 | limsupequzlem 43153 | 1 ⊢ (𝜑 → (lim sup‘𝐹) = (lim sup‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 Ⅎwnf 1787 ∈ wcel 2108 Ⅎwnfc 2886 Fn wfn 6413 ‘cfv 6418 ℤcz 12249 ℤ≥cuz 12511 lim supclsp 15107 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-q 12618 df-ico 13014 df-limsup 15108 |
This theorem is referenced by: limsupequzmptlem 43159 smflimsuplem2 44241 |
Copyright terms: Public domain | W3C validator |