![]() |
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 1883 | . 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 1883 | . . . . 5 ⊢ Ⅎ𝑘 𝑗 ∈ (ℤ≥‘𝐾) | |
9 | 7, 8 | nfan 1868 | . . . 4 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) |
10 | limsupequz.2 | . . . . . 6 ⊢ Ⅎ𝑘𝐹 | |
11 | nfcv 2793 | . . . . . 6 ⊢ Ⅎ𝑘𝑗 | |
12 | 10, 11 | nffv 6236 | . . . . 5 ⊢ Ⅎ𝑘(𝐹‘𝑗) |
13 | limsupequz.3 | . . . . . 6 ⊢ Ⅎ𝑘𝐺 | |
14 | 13, 11 | nffv 6236 | . . . . 5 ⊢ Ⅎ𝑘(𝐺‘𝑗) |
15 | 12, 14 | nfeq 2805 | . . . 4 ⊢ Ⅎ𝑘(𝐹‘𝑗) = (𝐺‘𝑗) |
16 | 9, 15 | nfim 1865 | . . 3 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
17 | eleq1 2718 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ (ℤ≥‘𝐾) ↔ 𝑗 ∈ (ℤ≥‘𝐾))) | |
18 | 17 | anbi2d 740 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ↔ (𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)))) |
19 | fveq2 6229 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
20 | fveq2 6229 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐺‘𝑘) = (𝐺‘𝑗)) | |
21 | 19, 20 | eqeq12d 2666 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) = (𝐺‘𝑘) ↔ (𝐹‘𝑗) = (𝐺‘𝑗))) |
22 | 18, 21 | imbi12d 333 | . . 3 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) ↔ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)))) |
23 | limsupequz.9 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) | |
24 | 16, 22, 23 | chvar 2298 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
25 | 1, 2, 3, 4, 5, 6, 24 | limsupequzlem 40272 | 1 ⊢ (𝜑 → (lim sup‘𝐹) = (lim sup‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 Ⅎwnf 1748 ∈ wcel 2030 Ⅎwnfc 2780 Fn wfn 5921 ‘cfv 5926 ℤcz 11415 ℤ≥cuz 11725 lim supclsp 14245 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 ax-pre-sup 10052 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-om 7108 df-1st 7210 df-2nd 7211 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-oadd 7609 df-er 7787 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-sup 8389 df-inf 8390 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-div 10723 df-nn 11059 df-n0 11331 df-z 11416 df-uz 11726 df-q 11827 df-ico 12219 df-limsup 14246 |
This theorem is referenced by: limsupequzmptlem 40278 smflimsuplem2 41348 |
Copyright terms: Public domain | W3C validator |