| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rpnnen2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for rpnnen2 16436. (Contributed by Mario Carneiro, 13-May-2013.) |
| Ref | Expression |
|---|---|
| rpnnen2.1 | ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) |
| Ref | Expression |
|---|---|
| rpnnen2lem1 | ⊢ ((𝐴 ⊆ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐹‘𝐴)‘𝑁) = if(𝑁 ∈ 𝐴, ((1 / 3)↑𝑁), 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnex 12380 | . . . . 5 ⊢ ℕ ∈ V | |
| 2 | 1 | elpw2 5302 | . . . 4 ⊢ (𝐴 ∈ 𝒫 ℕ ↔ 𝐴 ⊆ ℕ) |
| 3 | eleq2 2856 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑛 ∈ 𝑥 ↔ 𝑛 ∈ 𝐴)) | |
| 4 | 3 | ifbid 4508 | . . . . . 6 ⊢ (𝑥 = 𝐴 → if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0) = if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) |
| 5 | 4 | mpteq2dv 5204 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 6 | rpnnen2.1 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝑥, ((1 / 3)↑𝑛), 0))) | |
| 7 | 1 | mptex 7259 | . . . . 5 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) ∈ V |
| 8 | 5, 6, 7 | fvmpt 7023 | . . . 4 ⊢ (𝐴 ∈ 𝒫 ℕ → (𝐹‘𝐴) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 9 | 2, 8 | sylbir 238 | . . 3 ⊢ (𝐴 ⊆ ℕ → (𝐹‘𝐴) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))) |
| 10 | 9 | fveq1d 6917 | . 2 ⊢ (𝐴 ⊆ ℕ → ((𝐹‘𝐴)‘𝑁) = ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))‘𝑁)) |
| 11 | eleq1 2855 | . . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ 𝐴 ↔ 𝑁 ∈ 𝐴)) | |
| 12 | oveq2 7458 | . . . 4 ⊢ (𝑛 = 𝑁 → ((1 / 3)↑𝑛) = ((1 / 3)↑𝑁)) | |
| 13 | 11, 12 | ifbieq1d 4509 | . . 3 ⊢ (𝑛 = 𝑁 → if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0) = if(𝑁 ∈ 𝐴, ((1 / 3)↑𝑁), 0)) |
| 14 | eqid 2766 | . . 3 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0)) | |
| 15 | ovex 7483 | . . . 4 ⊢ ((1 / 3)↑𝑁) ∈ V | |
| 16 | c0ex 11338 | . . . 4 ⊢ 0 ∈ V | |
| 17 | 15, 16 | ifex 4535 | . . 3 ⊢ if(𝑁 ∈ 𝐴, ((1 / 3)↑𝑁), 0) ∈ V |
| 18 | 13, 14, 17 | fvmpt 7023 | . 2 ⊢ (𝑁 ∈ ℕ → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ 𝐴, ((1 / 3)↑𝑛), 0))‘𝑁) = if(𝑁 ∈ 𝐴, ((1 / 3)↑𝑁), 0)) |
| 19 | 10, 18 | sylan9eq 2821 | 1 ⊢ ((𝐴 ⊆ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐹‘𝐴)‘𝑁) = if(𝑁 ∈ 𝐴, ((1 / 3)↑𝑁), 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ⊆ wss 3899 ifcif 4484 𝒫 cpw 4559 ↦ cmpt 5191 ‘cfv 6565 (class class class)co 7450 0cc0 11238 1c1 11239 / cdiv 12012 ℕcn 12374 3c3 12437 ↑cexp 14243 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-mulcl 11300 ax-i2m1 11306 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 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 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-nn 12375 |
| This theorem is used by: rpnnen2lem3 16426 rpnnen2lem4 16427 rpnnen2lem9 16432 rpnnen2lem10 16433 rpnnen2lem11 16434 |
| Copyright terms: Public domain | W3C validator |