Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > clim2d | Structured version Visualization version GIF version |
Description: The limit of complex number sequence 𝐹 is eventually approximated. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
clim2d.k | ⊢ Ⅎ𝑘𝜑 |
clim2d.f | ⊢ Ⅎ𝑘𝐹 |
clim2d.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
clim2d.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
clim2d.c | ⊢ (𝜑 → 𝐹 ⇝ 𝐴) |
clim2d.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
clim2d.x | ⊢ (𝜑 → 𝑋 ∈ ℝ+) |
Ref | Expression |
---|---|
clim2d | ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clim2d.x | . 2 ⊢ (𝜑 → 𝑋 ∈ ℝ+) | |
2 | clim2d.c | . . . 4 ⊢ (𝜑 → 𝐹 ⇝ 𝐴) | |
3 | clim2d.k | . . . . 5 ⊢ Ⅎ𝑘𝜑 | |
4 | clim2d.f | . . . . 5 ⊢ Ⅎ𝑘𝐹 | |
5 | clim2d.z | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
6 | clim2d.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
7 | climrel 14851 | . . . . . . 7 ⊢ Rel ⇝ | |
8 | 7 | a1i 11 | . . . . . 6 ⊢ (𝜑 → Rel ⇝ ) |
9 | brrelex1 5607 | . . . . . 6 ⊢ ((Rel ⇝ ∧ 𝐹 ⇝ 𝐴) → 𝐹 ∈ V) | |
10 | 8, 2, 9 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ V) |
11 | clim2d.b | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
12 | 3, 4, 5, 6, 10, 11 | clim2f2 41958 | . . . 4 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
13 | 2, 12 | mpbid 234 | . . 3 ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
14 | 13 | simprd 498 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)) |
15 | breq2 5072 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝑋)) | |
16 | 15 | anbi2d 630 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋))) |
17 | 16 | ralbidv 3199 | . . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋))) |
18 | 17 | rexbidv 3299 | . . 3 ⊢ (𝑥 = 𝑋 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋))) |
19 | 18 | rspcva 3623 | . 2 ⊢ ((𝑋 ∈ ℝ+ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋)) |
20 | 1, 14, 19 | syl2anc 586 | 1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 Ⅎwnfc 2963 ∀wral 3140 ∃wrex 3141 Vcvv 3496 class class class wbr 5068 Rel wrel 5562 ‘cfv 6357 (class class class)co 7158 ℂcc 10537 < clt 10677 − cmin 10872 ℤcz 11984 ℤ≥cuz 12246 ℝ+crp 12392 abscabs 14595 ⇝ cli 14843 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-pre-lttri 10613 ax-pre-lttrn 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-neg 10875 df-z 11985 df-uz 12247 df-clim 14847 |
This theorem is referenced by: climleltrp 41964 |
Copyright terms: Public domain | W3C validator |