| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > clim0cf | Structured version Visualization version GIF version | ||
| Description: Express the predicate 𝐹 converges to 0. Similar to clim 15415, but without the disjoint var constraint 𝐹𝑘. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| clim0cf.nf | ⊢ Ⅎ𝑘𝐹 |
| clim0cf.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| clim0cf.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| clim0cf.f | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
| clim0cf.fv | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
| clim0cf.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
| Ref | Expression |
|---|---|
| clim0cf | ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘𝐵) < 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clim0cf.nf | . . 3 ⊢ Ⅎ𝑘𝐹 | |
| 2 | clim0cf.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 3 | clim0cf.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | clim0cf.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 5 | clim0cf.fv | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
| 6 | 0cnd 11123 | . . 3 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 7 | clim0cf.b | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | clim2cf 45836 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 0)) < 𝑥)) |
| 9 | 2 | uztrn2 12768 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → 𝑘 ∈ 𝑍) |
| 10 | 7 | subid1d 11479 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐵 − 0) = 𝐵) |
| 11 | 10 | fveq2d 6836 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐵 − 0)) = (abs‘𝐵)) |
| 12 | 11 | breq1d 5106 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 13 | 9, 12 | sylan2 593 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗))) → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 14 | 13 | anassrs 467 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 15 | 14 | ralbidva 3155 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 0)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘𝐵) < 𝑥)) |
| 16 | 15 | rexbidva 3156 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 0)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘𝐵) < 𝑥)) |
| 17 | 16 | ralbidv 3157 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 0)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘𝐵) < 𝑥)) |
| 18 | 8, 17 | bitrd 279 | 1 ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘𝐵) < 𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Ⅎwnfc 2881 ∀wral 3049 ∃wrex 3058 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 ℂcc 11022 0cc0 11024 < clt 11164 − cmin 11362 ℤcz 12486 ℤ≥cuz 12749 ℝ+crp 12903 abscabs 15155 ⇝ cli 15405 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-po 5530 df-so 5531 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-z 12487 df-uz 12750 df-clim 15409 |
| This theorem is referenced by: etransclem48 46468 |
| Copyright terms: Public domain | W3C validator |