Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rpnnen2lem3 | Structured version Visualization version GIF version |
Description: Lemma for rpnnen2 15863. (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 10906 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
2 | 3nn 11982 | . . . . . . 7 ⊢ 3 ∈ ℕ | |
3 | nndivre 11944 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 3 ∈ ℕ) → (1 / 3) ∈ ℝ) | |
4 | 1, 2, 3 | mp2an 688 | . . . . . 6 ⊢ (1 / 3) ∈ ℝ |
5 | 4 | recni 10920 | . . . . 5 ⊢ (1 / 3) ∈ ℂ |
6 | 5 | a1i 11 | . . . 4 ⊢ (⊤ → (1 / 3) ∈ ℂ) |
7 | 0re 10908 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
8 | 3re 11983 | . . . . . . . . 9 ⊢ 3 ∈ ℝ | |
9 | 3pos 12008 | . . . . . . . . 9 ⊢ 0 < 3 | |
10 | 8, 9 | recgt0ii 11811 | . . . . . . . 8 ⊢ 0 < (1 / 3) |
11 | 7, 4, 10 | ltleii 11028 | . . . . . . 7 ⊢ 0 ≤ (1 / 3) |
12 | absid 14936 | . . . . . . 7 ⊢ (((1 / 3) ∈ ℝ ∧ 0 ≤ (1 / 3)) → (abs‘(1 / 3)) = (1 / 3)) | |
13 | 4, 11, 12 | mp2an 688 | . . . . . 6 ⊢ (abs‘(1 / 3)) = (1 / 3) |
14 | 1lt3 12076 | . . . . . . 7 ⊢ 1 < 3 | |
15 | recgt1 11801 | . . . . . . . 8 ⊢ ((3 ∈ ℝ ∧ 0 < 3) → (1 < 3 ↔ (1 / 3) < 1)) | |
16 | 8, 9, 15 | mp2an 688 | . . . . . . 7 ⊢ (1 < 3 ↔ (1 / 3) < 1) |
17 | 14, 16 | mpbi 229 | . . . . . 6 ⊢ (1 / 3) < 1 |
18 | 13, 17 | eqbrtri 5091 | . . . . 5 ⊢ (abs‘(1 / 3)) < 1 |
19 | 18 | a1i 11 | . . . 4 ⊢ (⊤ → (abs‘(1 / 3)) < 1) |
20 | 1nn0 12179 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
21 | 20 | a1i 11 | . . . 4 ⊢ (⊤ → 1 ∈ ℕ0) |
22 | ssid 3939 | . . . . . 6 ⊢ ℕ ⊆ ℕ | |
23 | simpr 484 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ (ℤ≥‘1)) | |
24 | nnuz 12550 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
25 | 23, 24 | eleqtrrdi 2850 | . . . . . 6 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℕ) |
26 | rpnnen2.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
27 | 26 | rpnnen2lem1 15851 | . . . . . 6 ⊢ ((ℕ ⊆ ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
28 | 22, 25, 27 | sylancr 586 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0)) |
29 | 25 | iftrued 4464 | . . . . 5 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → if(𝑘 ∈ ℕ, ((1 / 3)↑𝑘), 0) = ((1 / 3)↑𝑘)) |
30 | 28, 29 | eqtrd 2778 | . . . 4 ⊢ ((⊤ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘ℕ)‘𝑘) = ((1 / 3)↑𝑘)) |
31 | 6, 19, 21, 30 | geolim2 15511 | . . 3 ⊢ (⊤ → seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3)))) |
32 | 31 | mptru 1546 | . 2 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (((1 / 3)↑1) / (1 − (1 / 3))) |
33 | exp1 13716 | . . . . 5 ⊢ ((1 / 3) ∈ ℂ → ((1 / 3)↑1) = (1 / 3)) | |
34 | 5, 33 | ax-mp 5 | . . . 4 ⊢ ((1 / 3)↑1) = (1 / 3) |
35 | 3cn 11984 | . . . . . 6 ⊢ 3 ∈ ℂ | |
36 | ax-1cn 10860 | . . . . . 6 ⊢ 1 ∈ ℂ | |
37 | 3ne0 12009 | . . . . . . 7 ⊢ 3 ≠ 0 | |
38 | 35, 37 | pm3.2i 470 | . . . . . 6 ⊢ (3 ∈ ℂ ∧ 3 ≠ 0) |
39 | divsubdir 11599 | . . . . . 6 ⊢ ((3 ∈ ℂ ∧ 1 ∈ ℂ ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((3 − 1) / 3) = ((3 / 3) − (1 / 3))) | |
40 | 35, 36, 38, 39 | mp3an 1459 | . . . . 5 ⊢ ((3 − 1) / 3) = ((3 / 3) − (1 / 3)) |
41 | 3m1e2 12031 | . . . . . 6 ⊢ (3 − 1) = 2 | |
42 | 41 | oveq1i 7265 | . . . . 5 ⊢ ((3 − 1) / 3) = (2 / 3) |
43 | 35, 37 | dividi 11638 | . . . . . 6 ⊢ (3 / 3) = 1 |
44 | 43 | oveq1i 7265 | . . . . 5 ⊢ ((3 / 3) − (1 / 3)) = (1 − (1 / 3)) |
45 | 40, 42, 44 | 3eqtr3ri 2775 | . . . 4 ⊢ (1 − (1 / 3)) = (2 / 3) |
46 | 34, 45 | oveq12i 7267 | . . 3 ⊢ (((1 / 3)↑1) / (1 − (1 / 3))) = ((1 / 3) / (2 / 3)) |
47 | 2cnne0 12113 | . . . 4 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
48 | divcan7 11614 | . . . 4 ⊢ ((1 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (3 ∈ ℂ ∧ 3 ≠ 0)) → ((1 / 3) / (2 / 3)) = (1 / 2)) | |
49 | 36, 47, 38, 48 | mp3an 1459 | . . 3 ⊢ ((1 / 3) / (2 / 3)) = (1 / 2) |
50 | 46, 49 | eqtri 2766 | . 2 ⊢ (((1 / 3)↑1) / (1 − (1 / 3))) = (1 / 2) |
51 | 32, 50 | breqtri 5095 | 1 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ⊤wtru 1540 ∈ wcel 2108 ≠ wne 2942 ⊆ wss 3883 ifcif 4456 𝒫 cpw 4530 class class class wbr 5070 ↦ cmpt 5153 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 − cmin 11135 / cdiv 11562 ℕcn 11903 2c2 11958 3c3 11959 ℕ0cn0 12163 ℤ≥cuz 12511 seqcseq 13649 ↑cexp 13710 abscabs 14873 ⇝ cli 15121 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-pm 8576 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-inf 9132 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fz 13169 df-fzo 13312 df-fl 13440 df-seq 13650 df-exp 13711 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 df-rlim 15126 df-sum 15326 |
This theorem is referenced by: rpnnen2lem5 15855 rpnnen2lem12 15862 |
Copyright terms: Public domain | W3C validator |