MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  clim Structured version   Visualization version   GIF version

Theorem clim 15504
Description: Express the predicate: The limit of complex number sequence 𝐹 is 𝐴, or 𝐹 converges to 𝐴. This means that for any real 𝑥, no matter how small, there always exists an integer 𝑗 such that the absolute difference of any later complex number in the sequence and the limit is less than 𝑥. (Contributed by NM, 28-Aug-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
Hypotheses
Ref Expression
clim.1 (𝜑𝐹𝑉)
clim.3 ((𝜑𝑘 ∈ ℤ) → (𝐹𝑘) = 𝐵)
Assertion
Ref Expression
clim (𝜑 → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥))))
Distinct variable groups:   𝑗,𝑘,𝑥,𝐴   𝑗,𝐹,𝑘,𝑥   𝜑,𝑗,𝑘,𝑥
Allowed substitution hints:   𝐵(𝑥,𝑗,𝑘)   𝑉(𝑥,𝑗,𝑘)

Proof of Theorem clim
Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 climrel 15502 . . . . 5 Rel ⇝
21brrelex2i 5702 . . . 4 (𝐹𝐴𝐴 ∈ V)
32a1i 11 . . 3 (𝜑 → (𝐹𝐴𝐴 ∈ V))
4 elex 3474 . . . . 5 (𝐴 ∈ ℂ → 𝐴 ∈ V)
54adantr 484 . . . 4 ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V)
65a1i 11 . . 3 (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V))
7 clim.1 . . . 4 (𝜑𝐹𝑉)
8 simpr 488 . . . . . . . 8 ((𝑓 = 𝐹𝑦 = 𝐴) → 𝑦 = 𝐴)
98eleq1d 2846 . . . . . . 7 ((𝑓 = 𝐹𝑦 = 𝐴) → (𝑦 ∈ ℂ ↔ 𝐴 ∈ ℂ))
10 fveq1 6862 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → (𝑓𝑘) = (𝐹𝑘))
1110adantr 484 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑦 = 𝐴) → (𝑓𝑘) = (𝐹𝑘))
1211eleq1d 2846 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑓𝑘) ∈ ℂ ↔ (𝐹𝑘) ∈ ℂ))
13 oveq12 7401 . . . . . . . . . . . . . 14 (((𝑓𝑘) = (𝐹𝑘) ∧ 𝑦 = 𝐴) → ((𝑓𝑘) − 𝑦) = ((𝐹𝑘) − 𝐴))
1410, 13sylan 589 . . . . . . . . . . . . 13 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑓𝑘) − 𝑦) = ((𝐹𝑘) − 𝐴))
1514fveq2d 6867 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑦 = 𝐴) → (abs‘((𝑓𝑘) − 𝑦)) = (abs‘((𝐹𝑘) − 𝐴)))
1615breq1d 5109 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑦 = 𝐴) → ((abs‘((𝑓𝑘) − 𝑦)) < 𝑥 ↔ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))
1712, 16anbi12d 641 . . . . . . . . . 10 ((𝑓 = 𝐹𝑦 = 𝐴) → (((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
1817ralbidv 3184 . . . . . . . . 9 ((𝑓 = 𝐹𝑦 = 𝐴) → (∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
1918rexbidv 3185 . . . . . . . 8 ((𝑓 = 𝐹𝑦 = 𝐴) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
2019ralbidv 3184 . . . . . . 7 ((𝑓 = 𝐹𝑦 = 𝐴) → (∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
219, 20anbi12d 641 . . . . . 6 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
22 df-clim 15498 . . . . . 6 ⇝ = {⟨𝑓, 𝑦⟩ ∣ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥))}
2321, 22brabga 5503 . . . . 5 ((𝐹𝑉𝐴 ∈ V) → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
2423ex 416 . . . 4 (𝐹𝑉 → (𝐴 ∈ V → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))))
257, 24syl 17 . . 3 (𝜑 → (𝐴 ∈ V → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))))
263, 6, 25pm5.21ndd 381 . 2 (𝜑 → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
27 eluzelz 12846 . . . . . . 7 (𝑘 ∈ (ℤ𝑗) → 𝑘 ∈ ℤ)
28 clim.3 . . . . . . . . 9 ((𝜑𝑘 ∈ ℤ) → (𝐹𝑘) = 𝐵)
2928eleq1d 2846 . . . . . . . 8 ((𝜑𝑘 ∈ ℤ) → ((𝐹𝑘) ∈ ℂ ↔ 𝐵 ∈ ℂ))
3028fvoveq1d 7414 . . . . . . . . 9 ((𝜑𝑘 ∈ ℤ) → (abs‘((𝐹𝑘) − 𝐴)) = (abs‘(𝐵𝐴)))
3130breq1d 5109 . . . . . . . 8 ((𝜑𝑘 ∈ ℤ) → ((abs‘((𝐹𝑘) − 𝐴)) < 𝑥 ↔ (abs‘(𝐵𝐴)) < 𝑥))
3229, 31anbi12d 641 . . . . . . 7 ((𝜑𝑘 ∈ ℤ) → (((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3327, 32sylan2 602 . . . . . 6 ((𝜑𝑘 ∈ (ℤ𝑗)) → (((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3433ralbidva 3182 . . . . 5 (𝜑 → (∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3534rexbidv 3185 . . . 4 (𝜑 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3635ralbidv 3184 . . 3 (𝜑 → (∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3736anbi2d 639 . 2 (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥))))
3826, 37bitrd 281 1 (𝜑 → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  Vcvv 3453   class class class wbr 5099  cfv 6517  (class class class)co 7392  cc 11068   < clt 11213  cmin 11411  cz 12565  cuz 12836  +crp 12990  abscabs 15244  cli 15494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389  ax-cnex 11126  ax-resscn 11127
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-fv 6525  df-ov 7395  df-neg 11414  df-z 12566  df-uz 12837  df-clim 15498
This theorem is referenced by:  climcl  15509  clim2  15514  climshftlem  15584  climsuse  46148  0cnv  46280  climuzlem  46281  climisp  46284  climrescn  46286  climxrrelem  46287  climxrre  46288  ioodvbdlimc1lem2  46470  ioodvbdlimc2lem  46472
  Copyright terms: Public domain W3C validator