| 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 1944 | . 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 1944 | . . . . 5 ⊢ Ⅎ𝑘 𝑗 ∈ (ℤ≥‘𝐾) | |
| 9 | 7, 8 | nfan 1929 | . . . 4 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) |
| 10 | limsupequz.2 | . . . . . 6 ⊢ Ⅎ𝑘𝐹 | |
| 11 | nfcv 2925 | . . . . . 6 ⊢ Ⅎ𝑘𝑗 | |
| 12 | 10, 11 | nffv 6891 | . . . . 5 ⊢ Ⅎ𝑘(𝐹‘𝑗) |
| 13 | limsupequz.3 | . . . . . 6 ⊢ Ⅎ𝑘𝐺 | |
| 14 | 13, 11 | nffv 6891 | . . . . 5 ⊢ Ⅎ𝑘(𝐺‘𝑗) |
| 15 | 12, 14 | nfeq 2938 | . . . 4 ⊢ Ⅎ𝑘(𝐹‘𝑗) = (𝐺‘𝑗) |
| 16 | 9, 15 | nfim 1926 | . . 3 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
| 17 | eleq1w 2846 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝑘 ∈ (ℤ≥‘𝐾) ↔ 𝑗 ∈ (ℤ≥‘𝐾))) | |
| 18 | 17 | anbi2d 641 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) ↔ (𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)))) |
| 19 | fveq2 6881 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐹‘𝑘) = (𝐹‘𝑗)) | |
| 20 | fveq2 6881 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐺‘𝑘) = (𝐺‘𝑗)) | |
| 21 | 19, 20 | eqeq12d 2779 | . . . 4 ⊢ (𝑘 = 𝑗 → ((𝐹‘𝑘) = (𝐺‘𝑘) ↔ (𝐹‘𝑗) = (𝐺‘𝑗))) |
| 22 | 18, 21 | imbi12d 347 | . . 3 ⊢ (𝑘 = 𝑗 → (((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) ↔ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)))) |
| 23 | limsupequz.9 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑘) = (𝐺‘𝑘)) | |
| 24 | 16, 22, 23 | chvarfv 2276 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑗) = (𝐺‘𝑗)) |
| 25 | 1, 2, 3, 4, 5, 6, 24 | limsupequzlem 46436 | 1 ⊢ (𝜑 → (lim sup‘𝐹) = (lim sup‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 Fn wfn 6531 ‘cfv 6536 ℤcz 12586 ℤ≥cuz 12857 lim supclsp 15517 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-inf 9399 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-q 12968 df-ico 13373 df-limsup 15518 |
| This theorem is referenced by: limsupequzmptlem 46442 smflimsuplem2 47535 |
| Copyright terms: Public domain | W3C validator |