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

Theorem clim 15547
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 15545 . . . . 5 Rel ⇝
21brrelex2i 5720 . . . 4 (𝐹𝐴𝐴 ∈ V)
32a1i 11 . . 3 (𝜑 → (𝐹𝐴𝐴 ∈ V))
4 elex 3476 . . . . 5 (𝐴 ∈ ℂ → 𝐴 ∈ V)
54adantr 485 . . . 4 ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V)
65a1i 11 . . 3 (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V))
7 clim.1 . . . 4 (𝜑𝐹𝑉)
8 simpr 489 . . . . . . . 8 ((𝑓 = 𝐹𝑦 = 𝐴) → 𝑦 = 𝐴)
98eleq1d 2848 . . . . . . 7 ((𝑓 = 𝐹𝑦 = 𝐴) → (𝑦 ∈ ℂ ↔ 𝐴 ∈ ℂ))
10 fveq1 6882 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → (𝑓𝑘) = (𝐹𝑘))
1110adantr 485 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑦 = 𝐴) → (𝑓𝑘) = (𝐹𝑘))
1211eleq1d 2848 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑓𝑘) ∈ ℂ ↔ (𝐹𝑘) ∈ ℂ))
13 oveq12 7421 . . . . . . . . . . . . . 14 (((𝑓𝑘) = (𝐹𝑘) ∧ 𝑦 = 𝐴) → ((𝑓𝑘) − 𝑦) = ((𝐹𝑘) − 𝐴))
1410, 13sylan 591 . . . . . . . . . . . . 13 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑓𝑘) − 𝑦) = ((𝐹𝑘) − 𝐴))
1514fveq2d 6887 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑦 = 𝐴) → (abs‘((𝑓𝑘) − 𝑦)) = (abs‘((𝐹𝑘) − 𝐴)))
1615breq1d 5120 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑦 = 𝐴) → ((abs‘((𝑓𝑘) − 𝑦)) < 𝑥 ↔ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))
1712, 16anbi12d 643 . . . . . . . . . 10 ((𝑓 = 𝐹𝑦 = 𝐴) → (((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
1817ralbidv 3188 . . . . . . . . 9 ((𝑓 = 𝐹𝑦 = 𝐴) → (∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
1918rexbidv 3189 . . . . . . . 8 ((𝑓 = 𝐹𝑦 = 𝐴) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
2019ralbidv 3188 . . . . . . 7 ((𝑓 = 𝐹𝑦 = 𝐴) → (∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))
219, 20anbi12d 643 . . . . . 6 ((𝑓 = 𝐹𝑦 = 𝐴) → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
22 df-clim 15541 . . . . . 6 ⇝ = {⟨𝑓, 𝑦⟩ ∣ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝑓𝑘) ∈ ℂ ∧ (abs‘((𝑓𝑘) − 𝑦)) < 𝑥))}
2321, 22brabga 5520 . . . . 5 ((𝐹𝑉𝐴 ∈ V) → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
2423ex 417 . . . 4 (𝐹𝑉 → (𝐴 ∈ V → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))))
257, 24syl 18 . . 3 (𝜑 → (𝐴 ∈ V → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)))))
263, 6, 25pm5.21ndd 382 . 2 (𝜑 → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥))))
27 eluzelz 12873 . . . . . . 7 (𝑘 ∈ (ℤ𝑗) → 𝑘 ∈ ℤ)
28 clim.3 . . . . . . . . 9 ((𝜑𝑘 ∈ ℤ) → (𝐹𝑘) = 𝐵)
2928eleq1d 2848 . . . . . . . 8 ((𝜑𝑘 ∈ ℤ) → ((𝐹𝑘) ∈ ℂ ↔ 𝐵 ∈ ℂ))
3028fvoveq1d 7434 . . . . . . . . 9 ((𝜑𝑘 ∈ ℤ) → (abs‘((𝐹𝑘) − 𝐴)) = (abs‘(𝐵𝐴)))
3130breq1d 5120 . . . . . . . 8 ((𝜑𝑘 ∈ ℤ) → ((abs‘((𝐹𝑘) − 𝐴)) < 𝑥 ↔ (abs‘(𝐵𝐴)) < 𝑥))
3229, 31anbi12d 643 . . . . . . 7 ((𝜑𝑘 ∈ ℤ) → (((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3327, 32sylan2 604 . . . . . 6 ((𝜑𝑘 ∈ (ℤ𝑗)) → (((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3433ralbidva 3186 . . . . 5 (𝜑 → (∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3534rexbidv 3189 . . . 4 (𝜑 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3635ralbidv 3188 . . 3 (𝜑 → (∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥)))
3736anbi2d 641 . 2 (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)((𝐹𝑘) ∈ ℂ ∧ (abs‘((𝐹𝑘) − 𝐴)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥))))
3826, 37bitrd 282 1 (𝜑 → (𝐹𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵𝐴)) < 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089  Vcvv 3455   class class class wbr 5110  cfv 6538  (class class class)co 7412  cc 11099   < clt 11244  cmin 11442  cz 12592  cuz 12863  +crp 13017  abscabs 15287  cli 15537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406  ax-cnex 11157  ax-resscn 11158
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7415  df-neg 11445  df-z 12593  df-uz 12864  df-clim 15541
This theorem is referenced by:  climcl  15552  clim2  15557  climshftlem  15627  climsuse  46304  0cnv  46436  climuzlem  46437  climisp  46440  climrescn  46442  climxrrelem  46443  climxrre  46444  ioodvbdlimc1lem2  46626  ioodvbdlimc2lem  46628
  Copyright terms: Public domain W3C validator