| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen2lem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen2 16406. (Contributed by Mario Carneiro, 13-May-2013.) |
| Ref | Expression |
|---|---|
| rpnnen2.1 | ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) |
| Ref | Expression |
|---|---|
| rpnnen2lem3 | ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1re 11318 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 2 | 3nn 12432 | . . . . . . 7 ⊢ 3 ∈ ℕ | |
| 3 | nndivre 12389 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 3 ∈ ℕ) → (1 / 3) ∈ ℝ) | |
| 4 | 1, 2, 3 | mp2an 705 | . . . . . 6 ⊢ (1 / 3) ∈ ℝ |
| 5 | 4 | recni 11333 | . . . . 5 ⊢ (1 / 3) ∈ ℂ |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (⊤ → (1 / 3) ∈ ℂ) |
| 7 | 0re 11320 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 8 | 3re 12433 | . . . . . . . . 9 ⊢ 3 ∈ ℝ | |
| 9 | 3pos 12461 | . . . . . . . . 9 ⊢ 0 < 3 | |
| 10 | 8, 9 | recgt0ii 12233 | . . . . . . . 8 ⊢ 0 < (1 / 3) |
| 11 | 7, 4, 10 | ltleii 11443 | . . . . . . 7 ⊢ 0 ≤ (1 / 3) |
| 12 | absid 15475 | . . . . . . 7 ⊢ (((1 / 3) ∈ ℝ ∧ 0 ≤ (1 / 3)) → (abs‘(1 / 3)) = (1 / 3)) | |
| 13 | 4, 11, 12 | mp2an 705 | . . . . . 6 ⊢ (abs‘(1 / 3)) = (1 / 3) |
| 14 | 1lt3 12528 | . . . . . . 7 ⊢ 1 < 3 | |
| 15 | recgt1 12223 | . . . . . . . 8 ⊢ ((3 ∈ ℝ ∧ 0 < 3) → (1 < 3 ↔ (1 / 3) < 1)) | |
| 16 | 8, 9, 15 | mp2an 705 | . . . . . . 7 ⊢ (1 < 3 ↔ (1 / 3) < 1) |
| 17 | 14, 16 | mpbi 233 | . . . . . 6 ⊢ (1 / 3) < 1 |
| 18 | 13, 17 | eqbrtri 5128 | . . . . 5 ⊢ (abs‘(1 / 3)) < 1 |
| 19 | 18 | a1i 11 | . . . 4 ⊢ (⊤ → (abs‘(1 / 3)) < 1) |
| 20 | 1nn0 12632 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 21 | 20 | a1i 11 | . . . 4 ⊢ (⊤ → 1 ∈ ℕ0) |
| 22 | ssid 3934 | . . . . . 6 ⊢ ℕ ⊆ ℕ | |
| 23 | simpr 490 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ (ℤ≥‘1)) | |
| 24 | nnuz 13014 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
| 25 | 23, 24 | eleqtrrdi 2874 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℕ) |
| 26 | rpnnen2.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
| 27 | 26 | rpnnen2lem1 16394 | . . . . . 6 ⊢ ((ℕ ⊆ ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
| 28 | 22, 25, 27 | sylancr 599 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
| 29 | 25 | iftrued 4492 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0) = ((1 / 3)↑𝑘)) |
| 30 | 28, 29 | eqtrd 2798 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = ((1 / 3)↑𝑘)) |
| 31 | 6, 19, 21, 30 | geolim2 16052 | . . 3 ⊢ (⊤ → seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3)))) |
| 32 | 31 | mptru 1576 | . 2 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3))) |
| 33 | exp1 14220 | . . . . 5 ⊢ ((1 / 3) ∈ ℂ → ((1 / 3)↑1) = (1 / 3)) | |
| 34 | 5, 33 | ax-mp 5 | . . . 4 ⊢ ((1 / 3)↑1) = (1 / 3) |
| 35 | 3cn 12434 | . . . . . 6 ⊢ 3 ∈ ℂ | |
| 36 | ax-1cn 11268 | . . . . . 6 ⊢ 1 ∈ ℂ | |
| 37 | 3ne0 12462 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 38 | 35, 37 | pm3.2i 476 | . . . . . 6 ⊢ (3 ∈ ℂ ∧ 3 ≠ 0) |
| 39 | divsubdir 12020 | . . . . . 6 ⊢ ((3 ∈ ℂ ∧ 1 ∈ ℂ ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((3 − 1) / 3) = ((3 / 3) − (1 / 3))) | |
| 40 | 35, 36, 38, 39 | mp3an 1490 | . . . . 5 ⊢ ((3 − 1) / 3) = ((3 / 3) − (1 / 3)) |
| 41 | 3m1e2 12480 | . . . . . 6 ⊢ (3 − 1) = 2 | |
| 42 | 41 | oveq1i 7437 | . . . . 5 ⊢ ((3 − 1) / 3) = (2 / 3) |
| 43 | 35, 37 | dividi 12060 | . . . . . 6 ⊢ (3 / 3) = 1 |
| 44 | 43 | oveq1i 7437 | . . . . 5 ⊢ ((3 / 3) − (1 / 3)) = (1 − (1 / 3)) |
| 45 | 40, 42, 44 | 3eqtr3ri 2795 | . . . 4 ⊢ (1 − (1 / 3)) = (2 / 3) |
| 46 | 34, 45 | oveq12i 7439 | . . 3 ⊢ (((1 / 3)↑1) / (1 − (1 / 3))) = ((1 / 3) / (2 / 3)) |
| 47 | 2cnne0 12565 | . . . 4 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
| 48 | divcan7 12036 | . . . 4 ⊢ ((1 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((1 / 3) / (2 / 3)) = (1 / 2)) | |
| 49 | 36, 47, 38, 48 | mp3an 1490 | . . 3 ⊢ ((1 / 3) / (2 / 3)) = (1 / 2) |
| 50 | 46, 49 | eqtri 2786 | . 2 ⊢ (((1 / 3)↑1) / (1 − (1 / 3))) = (1 / 2) |
| 51 | 32, 50 | breqtri 5132 | 1 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1569 ⊤wtru 1570 ∈ wcel 2146 ≠ wne 2958 ⊆ wss 3899 ifcif 4484 𝒫 cpw 4559 class class class wbr 5105 ↦ cmpt 5188 ‘cfv 6546 (class class class)co 7427 ℂcc 11208 ℝcr 11209 0cc0 11210 1c1 11211 + caddc 11213 < clt 11353 ≤ cle 11354 − cmin 11551 / cdiv 11983 ℕcn 12345 2c2 12407 3c3 12408 ℕ0cn0 12616 ℤ≥cuz 12975 seqcseq 14154 ↑cexp 14214 abscabs 15413 ⇝ cli 15663 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-inf2 9652 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 ax-pre-sup 11288 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-se 5608 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-isom 6555 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-er 8728 df-pm 8861 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9444 df-inf 9445 df-oi 9514 df-card 10030 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-3 12416 df-n0 12617 df-z 12704 df-uz 12976 df-rp 13131 df-fz 13650 df-fzo 13799 df-fl 13942 df-seq 14155 df-exp 14215 df-hash 14485 df-cj 15278 df-re 15279 df-im 15280 df-sqrt 15414 df-abs 15415 df-clim 15667 df-rlim 15668 df-sum 15866 |
| This theorem is used by: rpnnen2lem5 16398 rpnnen2lem12 16405 |
| Copyright terms: Public domain | W3C validator |