| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen2lem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen2 16438. (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 11347 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 2 | 3nn 12462 | . . . . . . 7 ⊢ 3 ∈ ℕ | |
| 3 | nndivre 12419 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 3 ∈ ℕ) → (1 / 3) ∈ ℝ) | |
| 4 | 1, 2, 3 | mp2an 705 | . . . . . 6 ⊢ (1 / 3) ∈ ℝ |
| 5 | 4 | recni 11362 | . . . . 5 ⊢ (1 / 3) ∈ ℂ |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (⊤ → (1 / 3) ∈ ℂ) |
| 7 | 0re 11349 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 8 | 3re 12463 | . . . . . . . . 9 ⊢ 3 ∈ ℝ | |
| 9 | 3pos 12491 | . . . . . . . . 9 ⊢ 0 < 3 | |
| 10 | 8, 9 | recgt0ii 12263 | . . . . . . . 8 ⊢ 0 < (1 / 3) |
| 11 | 7, 4, 10 | ltleii 11472 | . . . . . . 7 ⊢ 0 ≤ (1 / 3) |
| 12 | absid 15506 | . . . . . . 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 12558 | . . . . . . 7 ⊢ 1 < 3 | |
| 15 | recgt1 12253 | . . . . . . . 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 5132 | . . . . 5 ⊢ (abs‘(1 / 3)) < 1 |
| 19 | 18 | a1i 11 | . . . 4 ⊢ (⊤ → (abs‘(1 / 3)) < 1) |
| 20 | 1nn0 12662 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 21 | 20 | a1i 11 | . . . 4 ⊢ (⊤ → 1 ∈ ℕ0) |
| 22 | ssid 3935 | . . . . . 6 ⊢ ℕ ⊆ ℕ | |
| 23 | simpr 490 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ (ℤ≥‘1)) | |
| 24 | nnuz 13044 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
| 25 | 23, 24 | eleqtrrdi 2875 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℕ) |
| 26 | rpnnen2.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
| 27 | 26 | rpnnen2lem1 16426 | . . . . . 6 ⊢ ((ℕ ⊆ ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
| 28 | 22, 25, 27 | sylancr 599 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
| 29 | 25 | iftrued 4493 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0) = ((1 / 3)↑𝑘)) |
| 30 | 28, 29 | eqtrd 2798 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = ((1 / 3)↑𝑘)) |
| 31 | 6, 19, 21, 30 | geolim2 16084 | . . 3 ⊢ (⊤ → seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3)))) |
| 32 | 31 | mptru 1577 | . 2 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3))) |
| 33 | exp1 14250 | . . . . 5 ⊢ ((1 / 3) ∈ ℂ → ((1 / 3)↑1) = (1 / 3)) | |
| 34 | 5, 33 | ax-mp 5 | . . . 4 ⊢ ((1 / 3)↑1) = (1 / 3) |
| 35 | 3cn 12464 | . . . . . 6 ⊢ 3 ∈ ℂ | |
| 36 | ax-1cn 11297 | . . . . . 6 ⊢ 1 ∈ ℂ | |
| 37 | 3ne0 12492 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 38 | 35, 37 | pm3.2i 476 | . . . . . 6 ⊢ (3 ∈ ℂ ∧ 3 ≠ 0) |
| 39 | divsubdir 12050 | . . . . . 6 ⊢ ((3 ∈ ℂ ∧ 1 ∈ ℂ ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((3 − 1) / 3) = ((3 / 3) − (1 / 3))) | |
| 40 | 35, 36, 38, 39 | mp3an 1491 | . . . . 5 ⊢ ((3 − 1) / 3) = ((3 / 3) − (1 / 3)) |
| 41 | 3m1e2 12510 | . . . . . 6 ⊢ (3 − 1) = 2 | |
| 42 | 41 | oveq1i 7461 | . . . . 5 ⊢ ((3 − 1) / 3) = (2 / 3) |
| 43 | 35, 37 | dividi 12090 | . . . . . 6 ⊢ (3 / 3) = 1 |
| 44 | 43 | oveq1i 7461 | . . . . 5 ⊢ ((3 / 3) − (1 / 3)) = (1 − (1 / 3)) |
| 45 | 40, 42, 44 | 3eqtr3ri 2795 | . . . 4 ⊢ (1 − (1 / 3)) = (2 / 3) |
| 46 | 34, 45 | oveq12i 7463 | . . 3 ⊢ (((1 / 3)↑1) / (1 − (1 / 3))) = ((1 / 3) / (2 / 3)) |
| 47 | 2cnne0 12595 | . . . 4 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
| 48 | divcan7 12066 | . . . 4 ⊢ ((1 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((1 / 3) / (2 / 3)) = (1 / 2)) | |
| 49 | 36, 47, 38, 48 | mp3an 1491 | . . 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 5136 | 1 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∈ wcel 2147 ≠ wne 2959 ⊆ wss 3900 ifcif 4485 𝒫 cpw 4560 class class class wbr 5108 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 < clt 11382 ≤ cle 11383 − cmin 11580 / cdiv 12013 ℕcn 12375 2c2 12437 3c3 12438 ℕ0cn0 12646 ℤ≥cuz 13005 seqcseq 14184 ↑cexp 14244 abscabs 15444 ⇝ cli 15695 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-fz 13680 df-fzo 13829 df-fl 13972 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 df-rlim 15700 df-sum 15898 |
| This theorem is used by: rpnnen2lem5 16430 rpnnen2lem12 16437 |
| Copyright terms: Public domain | W3C validator |