| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clim0 | Structured version Visualization version GIF version | ||
| Description: Express the predicate 𝐹 converges to 0. (Contributed by NM, 24-Feb-2008.) (Revised by Mario Carneiro, 31-Jan-2014.) |
| Ref | Expression |
|---|---|
| clim0.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| clim0.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| clim0.3 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
| clim0.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
| Ref | Expression |
|---|---|
| clim0 | ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clim0.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | clim0.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 3 | clim0.3 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 4 | clim0.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
| 5 | 1, 2, 3, 4 | clim2 15715 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ (0 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥)))) |
| 6 | 0cn 11337 | . . . 4 ⊢ 0 ∈ ℂ | |
| 7 | 6 | biantrur 540 | . . 3 ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥) ↔ (0 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥))) |
| 8 | subid1 11617 | . . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 − 0) = 𝐵) | |
| 9 | 8 | fveq2d 6920 | . . . . . . . 8 ⊢ (𝐵 ∈ ℂ → (abs‘(𝐵 − 0)) = (abs‘𝐵)) |
| 10 | 9 | breq1d 5118 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → ((abs‘(𝐵 − 0)) < 𝑥 ↔ (abs‘𝐵) < 𝑥)) |
| 11 | 10 | pm5.32i 585 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥)) |
| 12 | 11 | ralbii 3112 | . . . . 5 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥)) |
| 13 | 12 | rexbii 3113 | . . . 4 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥)) |
| 14 | 13 | ralbii 3112 | . . 3 ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥)) |
| 15 | 7, 14 | bitr3i 280 | . 2 ⊢ ((0 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 0)) < 𝑥)) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥)) |
| 16 | 5, 15 | bitrdi 290 | 1 ⊢ (𝜑 → (𝐹 ⇝ 0 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘𝐵) < 𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 0cc0 11239 < clt 11382 − cmin 11580 ℤcz 12733 ℤ≥cuz 13005 ℝ+crp 13160 abscabs 15444 ⇝ cli 15695 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-z 12734 df-uz 13006 df-clim 15699 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |