Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > clim2cf | Structured version Visualization version GIF version |
Description: Express the predicate 𝐹 converges to 𝐴. Similar to clim2 15304, but without the disjoint var constraint 𝐹𝑘. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
clim2cf.nf | ⊢ Ⅎ𝑘𝐹 |
clim2cf.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
clim2cf.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
clim2cf.f | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
clim2cf.fv | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
clim2cf.a | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
clim2cf.b | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
Ref | Expression |
---|---|
clim2cf | ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clim2cf.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | 1 | biantrurd 533 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
3 | clim2cf.z | . . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 3 | uztrn2 12694 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → 𝑘 ∈ 𝑍) |
5 | clim2cf.b | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) | |
6 | 5 | biantrurd 533 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
7 | 4, 6 | sylan2 593 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗))) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
8 | 7 | anassrs 468 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
9 | 8 | ralbidva 3168 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
10 | 9 | rexbidva 3169 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
11 | 10 | ralbidv 3170 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
12 | clim2cf.nf | . . 3 ⊢ Ⅎ𝑘𝐹 | |
13 | clim2cf.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
14 | clim2cf.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
15 | clim2cf.fv | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
16 | 12, 3, 13, 14, 15 | clim2f 43502 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
17 | 2, 11, 16 | 3bitr4rd 311 | 1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1540 ∈ wcel 2105 Ⅎwnfc 2884 ∀wral 3061 ∃wrex 3070 class class class wbr 5089 ‘cfv 6473 (class class class)co 7329 ℂcc 10962 < clt 11102 − cmin 11298 ℤcz 12412 ℤ≥cuz 12675 ℝ+crp 12823 abscabs 15036 ⇝ cli 15284 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5240 ax-nul 5247 ax-pow 5305 ax-pr 5369 ax-un 7642 ax-cnex 11020 ax-resscn 11021 ax-pre-lttri 11038 ax-pre-lttrn 11039 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rab 3404 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4269 df-if 4473 df-pw 4548 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4852 df-br 5090 df-opab 5152 df-mpt 5173 df-id 5512 df-po 5526 df-so 5527 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6425 df-fun 6475 df-fn 6476 df-f 6477 df-f1 6478 df-fo 6479 df-f1o 6480 df-fv 6481 df-ov 7332 df-er 8561 df-en 8797 df-dom 8798 df-sdom 8799 df-pnf 11104 df-mnf 11105 df-xr 11106 df-ltxr 11107 df-le 11108 df-neg 11301 df-z 12413 df-uz 12676 df-clim 15288 |
This theorem is referenced by: clim0cf 43520 |
Copyright terms: Public domain | W3C validator |