| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen2lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen2 16339. (Contributed by Mario Carneiro, 13-May-2013.) (Revised by Mario Carneiro, 23-Aug-2014.) |
| Ref | Expression |
|---|---|
| rpnnen2.1 | ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) |
| Ref | Expression |
|---|---|
| rpnnen2lem2 | ⊢ (𝐴 ⊆ ℕ → (𝐹‘𝐴):ℕ⟶ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnex 12288 | . . . 4 ⊢ ℕ ∈ V | |
| 2 | 1 | elpw2 5299 | . . 3 ⊢ (𝐴 ∈ 𝒫 ℕ ↔ 𝐴 ⊆ ℕ) |
| 3 | eleq2 2849 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑛 ∈ 𝑥 ↔ 𝑛 ∈ 𝐴)) | |
| 4 | 3 | ifbid 4506 | . . . . 5 ⊢ (𝑥 = 𝐴 → if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0) = if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) |
| 5 | 4 | mpteq2dv 5199 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 6 | rpnnen2.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
| 7 | 1 | mptex 7225 | . . . 4 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) ∈ V |
| 8 | 5, 6, 7 | fvmpt 6989 | . . 3 ⊢ (𝐴 ∈ 𝒫 ℕ → (𝐹‘𝐴) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 9 | 2, 8 | sylbir 238 | . 2 ⊢ (𝐴 ⊆ ℕ → (𝐹‘𝐴) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 10 | 1re 11257 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 11 | 3nn 12369 | . . . . . 6 ⊢ 3 ∈ ℕ | |
| 12 | nndivre 12326 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ 3 ∈ ℕ) → (1 / 3) ∈ ℝ) | |
| 13 | 10, 11, 12 | mp2an 705 | . . . . 5 ⊢ (1 / 3) ∈ ℝ |
| 14 | nnnn0 12560 | . . . . 5 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ0) | |
| 15 | reexpcl 14167 | . . . . 5 ⊢ (((1 / 3) ∈ ℝ ∧ 𝑛 ∈ ℕ0) → ((1 / 3)↑𝑛) ∈ ℝ) | |
| 16 | 13, 14, 15 | sylancr 599 | . . . 4 ⊢ (𝑛 ∈ ℕ → ((1 / 3)↑𝑛) ∈ ℝ) |
| 17 | 0re 11259 | . . . 4 ⊢ 0 ∈ ℝ | |
| 18 | ifcl 4528 | . . . 4 ⊢ ((((1 / 3)↑𝑛) ∈ ℝ ∧ 0 ∈ ℝ) → if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0) ∈ ℝ) | |
| 19 | 16, 17, 18 | sylancl 598 | . . 3 ⊢ (𝑛 ∈ ℕ → if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0) ∈ ℝ) |
| 20 | 19 | adantl 487 | . 2 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑛 ∈ ℕ) → if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0) ∈ ℝ) |
| 21 | 9, 20 | fmpt3d 7112 | 1 ⊢ (𝐴 ⊆ ℕ → (𝐹‘𝐴):ℕ⟶ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ifcif 4482 𝒫 cpw 4557 ↦ cmpt 5186 ⟶wf 6531 ‘cfv 6535 (class class class)co 7416 ℝcr 11148 0cc0 11149 1c1 11150 / cdiv 11920 ℕcn 12282 3c3 12345 ℕ0cn0 12553 ↑cexp 14150 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-er 8703 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-div 11921 df-nn 12283 df-2 12352 df-3 12353 df-n0 12554 df-z 12641 df-uz 12913 df-seq 14091 df-exp 14151 |
| This theorem is used by: rpnnen2lem5 16331 rpnnen2lem6 16332 rpnnen2lem7 16333 rpnnen2lem8 16334 rpnnen2lem9 16335 rpnnen2lem10 16336 rpnnen2lem12 16338 |
| Copyright terms: Public domain | W3C validator |