Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rpnnen2lem5 | Structured version Visualization version GIF version |
Description: Lemma for rpnnen2 15567. (Contributed by Mario Carneiro, 13-May-2013.) (Revised by Mario Carneiro, 30-Apr-2014.) |
Ref | Expression |
---|---|
rpnnen2.1 | ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) |
Ref | Expression |
---|---|
rpnnen2lem5 | ⊢ ((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) → seq𝑀( + , (𝐹‘𝐴)) ∈ dom ⇝ ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnuz 12269 | . . . 4 ⊢ ℕ = (ℤ≥‘1) | |
2 | 1nn 11637 | . . . . 5 ⊢ 1 ∈ ℕ | |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝐴 ⊆ ℕ → 1 ∈ ℕ) |
4 | ssid 3986 | . . . . . 6 ⊢ ℕ ⊆ ℕ | |
5 | rpnnen2.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
6 | 5 | rpnnen2lem2 15556 | . . . . . 6 ⊢ (ℕ ⊆ ℕ → (𝐹‘ℕ):ℕ⟶ℝ) |
7 | 4, 6 | mp1i 13 | . . . . 5 ⊢ (𝐴 ⊆ ℕ → (𝐹‘ℕ):ℕ⟶ℝ) |
8 | 7 | ffvelrnda 6843 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘ℕ)‘𝑘) ∈ ℝ) |
9 | 5 | rpnnen2lem2 15556 | . . . . 5 ⊢ (𝐴 ⊆ ℕ → (𝐹‘𝐴):ℕ⟶ℝ) |
10 | 9 | ffvelrnda 6843 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝐴)‘𝑘) ∈ ℝ) |
11 | 5 | rpnnen2lem3 15557 | . . . . 5 ⊢ seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) |
12 | seqex 13359 | . . . . . 6 ⊢ seq1( + , (𝐹‘ℕ)) ∈ V | |
13 | ovex 7178 | . . . . . 6 ⊢ (1 / 2) ∈ V | |
14 | 12, 13 | breldm 5770 | . . . . 5 ⊢ (seq1( + , (𝐹‘ℕ)) ⇝ (1 / 2) → seq1( + , (𝐹‘ℕ)) ∈ dom ⇝ ) |
15 | 11, 14 | mp1i 13 | . . . 4 ⊢ (𝐴 ⊆ ℕ → seq1( + , (𝐹‘ℕ)) ∈ dom ⇝ ) |
16 | elnnuz 12270 | . . . . . 6 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ≥‘1)) | |
17 | 5 | rpnnen2lem4 15558 | . . . . . . 7 ⊢ ((𝐴 ⊆ ℕ ∧ ℕ ⊆ ℕ ∧ 𝑘 ∈ ℕ) → (0 ≤ ((𝐹‘𝐴)‘𝑘) ∧ ((𝐹‘𝐴)‘𝑘) ≤ ((𝐹‘ℕ)‘𝑘))) |
18 | 4, 17 | mp3an2 1440 | . . . . . 6 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ ℕ) → (0 ≤ ((𝐹‘𝐴)‘𝑘) ∧ ((𝐹‘𝐴)‘𝑘) ≤ ((𝐹‘ℕ)‘𝑘))) |
19 | 16, 18 | sylan2br 594 | . . . . 5 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (0 ≤ ((𝐹‘𝐴)‘𝑘) ∧ ((𝐹‘𝐴)‘𝑘) ≤ ((𝐹‘ℕ)‘𝑘))) |
20 | 19 | simpld 495 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → 0 ≤ ((𝐹‘𝐴)‘𝑘)) |
21 | 19 | simprd 496 | . . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝐹‘𝐴)‘𝑘) ≤ ((𝐹‘ℕ)‘𝑘)) |
22 | 1, 3, 8, 10, 15, 20, 21 | cvgcmp 15159 | . . 3 ⊢ (𝐴 ⊆ ℕ → seq1( + , (𝐹‘𝐴)) ∈ dom ⇝ ) |
23 | 22 | adantr 481 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) → seq1( + , (𝐹‘𝐴)) ∈ dom ⇝ ) |
24 | simpr 485 | . . 3 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) → 𝑀 ∈ ℕ) | |
25 | 10 | adantlr 711 | . . . 4 ⊢ (((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝐴)‘𝑘) ∈ ℝ) |
26 | 25 | recnd 10657 | . . 3 ⊢ (((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) ∧ 𝑘 ∈ ℕ) → ((𝐹‘𝐴)‘𝑘) ∈ ℂ) |
27 | 1, 24, 26 | iserex 15001 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) → (seq1( + , (𝐹‘𝐴)) ∈ dom ⇝ ↔ seq𝑀( + , (𝐹‘𝐴)) ∈ dom ⇝ )) |
28 | 23, 27 | mpbid 233 | 1 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑀 ∈ ℕ) → seq𝑀( + , (𝐹‘𝐴)) ∈ dom ⇝ ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ⊆ wss 3933 ifcif 4463 𝒫 cpw 4535 class class class wbr 5057 ↦ cmpt 5137 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 0cc0 10525 1c1 10526 + caddc 10528 ≤ cle 10664 / cdiv 11285 ℕcn 11626 2c2 11680 3c3 11681 ℤ≥cuz 12231 seqcseq 13357 ↑cexp 13417 ⇝ cli 14829 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-inf 8895 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-ico 12732 df-fz 12881 df-fzo 13022 df-fl 13150 df-seq 13358 df-exp 13418 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-limsup 14816 df-clim 14833 df-rlim 14834 df-sum 15031 |
This theorem is referenced by: rpnnen2lem6 15560 rpnnen2lem7 15561 rpnnen2lem8 15562 rpnnen2lem9 15563 rpnnen2lem12 15566 |
Copyright terms: Public domain | W3C validator |