![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > limsupequzmptf | 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 |
---|---|
limsupequzmptf.j | ⊢ Ⅎ𝑗𝜑 |
limsupequzmptf.o | ⊢ Ⅎ𝑗𝐴 |
limsupequzmptf.p | ⊢ Ⅎ𝑗𝐵 |
limsupequzmptf.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
limsupequzmptf.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
limsupequzmptf.a | ⊢ 𝐴 = (ℤ≥‘𝑀) |
limsupequzmptf.b | ⊢ 𝐵 = (ℤ≥‘𝑁) |
limsupequzmptf.c | ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑉) |
limsupequzmptf.d | ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐵) → 𝐶 ∈ 𝑊) |
Ref | Expression |
---|---|
limsupequzmptf | ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1915 | . . 3 ⊢ Ⅎ𝑘𝜑 | |
2 | limsupequzmptf.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | limsupequzmptf.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
4 | limsupequzmptf.a | . . 3 ⊢ 𝐴 = (ℤ≥‘𝑀) | |
5 | limsupequzmptf.b | . . 3 ⊢ 𝐵 = (ℤ≥‘𝑁) | |
6 | limsupequzmptf.j | . . . . . 6 ⊢ Ⅎ𝑗𝜑 | |
7 | limsupequzmptf.o | . . . . . . 7 ⊢ Ⅎ𝑗𝐴 | |
8 | 7 | nfcri 2888 | . . . . . 6 ⊢ Ⅎ𝑗 𝑘 ∈ 𝐴 |
9 | 6, 8 | nfan 1900 | . . . . 5 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑘 ∈ 𝐴) |
10 | nfcsb1v 3917 | . . . . . 6 ⊢ Ⅎ𝑗⦋𝑘 / 𝑗⦌𝐶 | |
11 | nfcv 2901 | . . . . . 6 ⊢ Ⅎ𝑗𝑉 | |
12 | 10, 11 | nfel 2915 | . . . . 5 ⊢ Ⅎ𝑗⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑉 |
13 | 9, 12 | nfim 1897 | . . . 4 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑘 ∈ 𝐴) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑉) |
14 | eleq1w 2814 | . . . . . 6 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴)) | |
15 | 14 | anbi2d 627 | . . . . 5 ⊢ (𝑗 = 𝑘 → ((𝜑 ∧ 𝑗 ∈ 𝐴) ↔ (𝜑 ∧ 𝑘 ∈ 𝐴))) |
16 | csbeq1a 3906 | . . . . . 6 ⊢ (𝑗 = 𝑘 → 𝐶 = ⦋𝑘 / 𝑗⦌𝐶) | |
17 | 16 | eleq1d 2816 | . . . . 5 ⊢ (𝑗 = 𝑘 → (𝐶 ∈ 𝑉 ↔ ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑉)) |
18 | 15, 17 | imbi12d 343 | . . . 4 ⊢ (𝑗 = 𝑘 → (((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑉) ↔ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑉))) |
19 | limsupequzmptf.c | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐶 ∈ 𝑉) | |
20 | 13, 18, 19 | chvarfv 2231 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑉) |
21 | limsupequzmptf.p | . . . . . . 7 ⊢ Ⅎ𝑗𝐵 | |
22 | 21 | nfcri 2888 | . . . . . 6 ⊢ Ⅎ𝑗 𝑘 ∈ 𝐵 |
23 | 6, 22 | nfan 1900 | . . . . 5 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑘 ∈ 𝐵) |
24 | nfcv 2901 | . . . . . 6 ⊢ Ⅎ𝑗𝑊 | |
25 | 10, 24 | nfel 2915 | . . . . 5 ⊢ Ⅎ𝑗⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑊 |
26 | 23, 25 | nfim 1897 | . . . 4 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑘 ∈ 𝐵) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑊) |
27 | eleq1w 2814 | . . . . . 6 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐵 ↔ 𝑘 ∈ 𝐵)) | |
28 | 27 | anbi2d 627 | . . . . 5 ⊢ (𝑗 = 𝑘 → ((𝜑 ∧ 𝑗 ∈ 𝐵) ↔ (𝜑 ∧ 𝑘 ∈ 𝐵))) |
29 | 16 | eleq1d 2816 | . . . . 5 ⊢ (𝑗 = 𝑘 → (𝐶 ∈ 𝑊 ↔ ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑊)) |
30 | 28, 29 | imbi12d 343 | . . . 4 ⊢ (𝑗 = 𝑘 → (((𝜑 ∧ 𝑗 ∈ 𝐵) → 𝐶 ∈ 𝑊) ↔ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑊))) |
31 | limsupequzmptf.d | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐵) → 𝐶 ∈ 𝑊) | |
32 | 26, 30, 31 | chvarfv 2231 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐵) → ⦋𝑘 / 𝑗⦌𝐶 ∈ 𝑊) |
33 | 1, 2, 3, 4, 5, 20, 32 | limsupequzmpt 44743 | . 2 ⊢ (𝜑 → (lim sup‘(𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐶)) = (lim sup‘(𝑘 ∈ 𝐵 ↦ ⦋𝑘 / 𝑗⦌𝐶))) |
34 | nfcv 2901 | . . . . 5 ⊢ Ⅎ𝑘𝐴 | |
35 | nfcv 2901 | . . . . 5 ⊢ Ⅎ𝑘𝐶 | |
36 | 7, 34, 35, 10, 16 | cbvmptf 5256 | . . . 4 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐶) |
37 | 36 | fveq2i 6893 | . . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐶)) |
38 | 37 | a1i 11 | . 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐶))) |
39 | nfcv 2901 | . . . . 5 ⊢ Ⅎ𝑘𝐵 | |
40 | 21, 39, 35, 10, 16 | cbvmptf 5256 | . . . 4 ⊢ (𝑗 ∈ 𝐵 ↦ 𝐶) = (𝑘 ∈ 𝐵 ↦ ⦋𝑘 / 𝑗⦌𝐶) |
41 | 40 | fveq2i 6893 | . . 3 ⊢ (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑘 ∈ 𝐵 ↦ ⦋𝑘 / 𝑗⦌𝐶)) |
42 | 41 | a1i 11 | . 2 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶)) = (lim sup‘(𝑘 ∈ 𝐵 ↦ ⦋𝑘 / 𝑗⦌𝐶))) |
43 | 33, 38, 42 | 3eqtr4d 2780 | 1 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝐴 ↦ 𝐶)) = (lim sup‘(𝑗 ∈ 𝐵 ↦ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1539 Ⅎwnf 1783 ∈ wcel 2104 Ⅎwnfc 2881 ⦋csb 3892 ↦ cmpt 5230 ‘cfv 6542 ℤcz 12562 ℤ≥cuz 12826 lim supclsp 15418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-n0 12477 df-z 12563 df-uz 12827 df-q 12937 df-ico 13334 df-limsup 15419 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |