Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > clim2c | 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 303 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
3 | clim2.1 | . . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 3 | uztrn2 9474 | . . . . . . 7 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → 𝑘 ∈ 𝑍) |
5 | clim2c.6 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) | |
6 | 5 | biantrurd 303 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
7 | 4, 6 | sylan2 284 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘𝑗))) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
8 | 7 | anassrs 398 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → ((abs‘(𝐵 − 𝐴)) < 𝑥 ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
9 | 8 | ralbidva 2460 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
10 | 9 | rexbidva 2461 | . . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
11 | 10 | ralbidv 2464 | . 2 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))) |
12 | clim2.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
13 | clim2.3 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
14 | clim2.4 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
15 | 3, 12, 13, 14 | clim2 11210 | . 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))) |
16 | 2, 11, 15 | 3bitr4rd 220 | 1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐵 − 𝐴)) < 𝑥)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1342 ∈ wcel 2135 ∀wral 2442 ∃wrex 2443 class class class wbr 3976 ‘cfv 5182 (class class class)co 5836 ℂcc 7742 < clt 7924 − cmin 8060 ℤcz 9182 ℤ≥cuz 9457 ℝ+crp 9580 abscabs 10925 ⇝ cli 11205 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1cn 7837 ax-1re 7838 ax-icn 7839 ax-addcl 7840 ax-addrcl 7841 ax-mulcl 7842 ax-addcom 7844 ax-addass 7846 ax-distr 7848 ax-i2m1 7849 ax-0lt1 7850 ax-0id 7852 ax-rnegex 7853 ax-cnre 7855 ax-pre-ltirr 7856 ax-pre-ltwlin 7857 ax-pre-lttrn 7858 ax-pre-apti 7859 ax-pre-ltadd 7860 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-reu 2449 df-rab 2451 df-v 2723 df-sbc 2947 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-if 3516 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-int 3819 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 df-riota 5792 df-ov 5839 df-oprab 5840 df-mpo 5841 df-pnf 7926 df-mnf 7927 df-xr 7928 df-ltxr 7929 df-le 7930 df-sub 8062 df-neg 8063 df-inn 8849 df-n0 9106 df-z 9183 df-uz 9458 df-clim 11206 |
This theorem is referenced by: clim0c 11213 climconst 11217 2clim 11228 climcn1 11235 climcn2 11236 climsqz 11262 climsqz2 11263 climrecvg1n 11275 |
Copyright terms: Public domain | W3C validator |