![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clim2c | Structured version Visualization version GIF version |
Description: Express the predicate 𝐹 converges to 𝐴. (Contributed by NM, 24-Feb-2008.) (Revised by Mario Carneiro, 31-Jan-2014.) |
Ref | Expression |
---|---|
clim2.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
clim2.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
clim2.3 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
clim2.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
clim2c.5 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
clim2c.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
Ref | Expression |
---|---|
clim2c | ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clim2c.5 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | 1 | biantrurd 532 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
3 | clim2.1 | . . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 3 | uztrn2 12857 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → 𝑘 ∈ 𝑍) |
5 | clim2c.6 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) | |
6 | 5 | biantrurd 532 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
7 | 4, 6 | sylan2 592 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗))) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
8 | 7 | anassrs 467 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
9 | 8 | ralbidva 3170 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
10 | 9 | rexbidva 3171 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
11 | 10 | ralbidv 3172 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
12 | clim2.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
13 | clim2.3 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
14 | clim2.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
15 | 3, 12, 13, 14 | clim2 15466 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
16 | 2, 11, 15 | 3bitr4rd 312 | 1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∀wral 3056 ∃wrex 3065 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 ℂcc 11122 < clt 11264 − cmin 11460 ℤcz 12574 ℤ≥cuz 12838 ℝ+crp 12992 abscabs 15199 ⇝ cli 15446 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-cnex 11180 ax-resscn 11181 ax-pre-lttri 11198 ax-pre-lttrn 11199 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-po 5584 df-so 5585 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 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-ov 7417 df-er 8716 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11266 df-mnf 11267 df-xr 11268 df-ltxr 11269 df-le 11270 df-neg 11463 df-z 12575 df-uz 12839 df-clim 15450 |
This theorem is referenced by: clim0c 15469 climconst 15505 rlimclim1 15507 2clim 15534 climcn1 15554 climcn2 15555 climsqz 15603 climsqz2 15604 climsup 15634 ulmclm 26297 itgulm 26318 climinf 44907 |
Copyright terms: Public domain | W3C validator |