| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mvrf | Structured version Visualization version GIF version | ||
| Description: The power series variable function is a function from the index set to elements of the power series structure representing 𝑋𝑖 for each 𝑖. (Contributed by Mario Carneiro, 29-Dec-2014.) |
| Ref | Expression |
|---|---|
| mvrf.s | ⊢ 𝑆 = (𝐼 mPwSer 𝑅) |
| mvrf.v | ⊢ 𝑉 = (𝐼 mVar 𝑅) |
| mvrf.b | ⊢ 𝐵 = (Base‘𝑆) |
| mvrf.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| mvrf.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| Ref | Expression |
|---|---|
| mvrf | ⊢ (𝜑 → 𝑉:𝐼⟶𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mvrf.v | . . 3 ⊢ 𝑉 = (𝐼 mVar 𝑅) | |
| 2 | eqid 2765 | . . 3 ⊢ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} | |
| 3 | eqid 2765 | . . 3 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 4 | eqid 2765 | . . 3 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 5 | mvrf.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 6 | mvrf.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 7 | 1, 2, 3, 4, 5, 6 | mvrfval 22159 | . 2 ⊢ (𝜑 → 𝑉 = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))))) |
| 8 | eqid 2765 | . . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 9 | 8, 4 | ringidcl 20372 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ (Base‘𝑅)) |
| 10 | 6, 9 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (1r‘𝑅) ∈ (Base‘𝑅)) |
| 11 | 8, 3 | ring0cl 20374 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → (0g‘𝑅) ∈ (Base‘𝑅)) |
| 12 | 6, 11 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (0g‘𝑅) ∈ (Base‘𝑅)) |
| 13 | 10, 12 | ifcld 4536 | . . . . . 6 ⊢ (𝜑 → if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅)) ∈ (Base‘𝑅)) |
| 14 | 13 | ad2antrr 739 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) → if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅)) ∈ (Base‘𝑅)) |
| 15 | 14 | fmpttd 7114 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))):{ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 16 | fvex 6898 | . . . . 5 ⊢ (Base‘𝑅) ∈ V | |
| 17 | ovex 7449 | . . . . . 6 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 18 | 17 | rabex 5311 | . . . . 5 ⊢ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ∈ V |
| 19 | 16, 18 | elmap 8871 | . . . 4 ⊢ ((𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))) ∈ ((Base‘𝑅) ↑m {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}) ↔ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))):{ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 20 | 15, 19 | sylibr 237 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))) ∈ ((Base‘𝑅) ↑m {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})) |
| 21 | mvrf.s | . . . . 5 ⊢ 𝑆 = (𝐼 mPwSer 𝑅) | |
| 22 | mvrf.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑆) | |
| 23 | 21, 8, 2, 22, 5 | psrbas 22113 | . . . 4 ⊢ (𝜑 → 𝐵 = ((Base‘𝑅) ↑m {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})) |
| 24 | 23 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐵 = ((Base‘𝑅) ↑m {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})) |
| 25 | 20, 24 | eleqtrrd 2868 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑅), (0g‘𝑅))) ∈ 𝐵) |
| 26 | 7, 25 | fmpt3d 7115 | 1 ⊢ (𝜑 → 𝑉:𝐼⟶𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3418 ifcif 4489 ↦ cmpt 5194 ◡ccnv 5662 “ cima 5666 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ↑m cmap 8826 Fincfn 8945 0cc0 11111 1c1 11112 ℕcn 12244 ℕ0cn0 12515 Basecbs 17286 0gc0g 17509 1rcur 20286 Ringcrg 20338 mPwSer cmps 22083 mVar cmvr 22084 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7680 df-om 7865 df-1st 7988 df-2nd 7989 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-fsupp 9325 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-nn 12245 df-2 12314 df-3 12315 df-4 12316 df-5 12317 df-6 12318 df-7 12319 df-8 12320 df-9 12321 df-n0 12516 df-z 12603 df-uz 12874 df-fz 13547 df-struct 17224 df-sets 17241 df-slot 17259 df-ndx 17271 df-base 17287 df-plusg 17340 df-mulr 17341 df-sca 17343 df-vsca 17344 df-tset 17346 df-0g 17511 df-mgm 18715 df-sgrp 18798 df-mnd 18814 df-grp 19026 df-mgp 20240 df-ur 20287 df-ring 20340 df-psr 22088 df-mvr 22089 |
| This theorem is used by: mvrf1 22164 mvrcl2 22165 mvrf2 22171 subrgmvrf 22214 mplbas2 22222 evlseu 22263 |
| Copyright terms: Public domain | W3C validator |