| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ressply1vsca | Structured version Visualization version GIF version | ||
| Description: A restricted power series algebra has the same scalar multiplication operation. (Contributed by Mario Carneiro, 3-Jul-2015.) |
| Ref | Expression |
|---|---|
| ressply1.s | ⊢ 𝑆 = (Poly1‘𝑅) |
| ressply1.h | ⊢ 𝐻 = (𝑅 ↾s 𝑇) |
| ressply1.u | ⊢ 𝑈 = (Poly1‘𝐻) |
| ressply1.b | ⊢ 𝐵 = (Base‘𝑈) |
| ressply1.2 | ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) |
| ressply1.p | ⊢ 𝑃 = (𝑆 ↾s 𝐵) |
| Ref | Expression |
|---|---|
| ressply1vsca | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . 3 ⊢ (1o mPoly 𝑅) = (1o mPoly 𝑅) | |
| 2 | ressply1.h | . . 3 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
| 3 | eqid 2737 | . . 3 ⊢ (1o mPoly 𝐻) = (1o mPoly 𝐻) | |
| 4 | ressply1.u | . . . 4 ⊢ 𝑈 = (Poly1‘𝐻) | |
| 5 | ressply1.b | . . . 4 ⊢ 𝐵 = (Base‘𝑈) | |
| 6 | 4, 5 | ply1bas 22168 | . . 3 ⊢ 𝐵 = (Base‘(1o mPoly 𝐻)) |
| 7 | 1on 8410 | . . . 4 ⊢ 1o ∈ On | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝜑 → 1o ∈ On) |
| 9 | ressply1.2 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
| 10 | eqid 2737 | . . 3 ⊢ ((1o mPoly 𝑅) ↾s 𝐵) = ((1o mPoly 𝑅) ↾s 𝐵) | |
| 11 | 1, 2, 3, 6, 8, 9, 10 | ressmplvsca 22019 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘(1o mPoly 𝐻))𝑌) = (𝑋( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))𝑌)) |
| 12 | eqid 2737 | . . . 4 ⊢ ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘𝑈) | |
| 13 | 4, 3, 12 | ply1vsca 22198 | . . 3 ⊢ ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘(1o mPoly 𝐻)) |
| 14 | 13 | oveqi 7373 | . 2 ⊢ (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘(1o mPoly 𝐻))𝑌) |
| 15 | ressply1.s | . . . . 5 ⊢ 𝑆 = (Poly1‘𝑅) | |
| 16 | eqid 2737 | . . . . 5 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆) | |
| 17 | 15, 1, 16 | ply1vsca 22198 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘(1o mPoly 𝑅)) |
| 18 | 5 | fvexi 6848 | . . . . 5 ⊢ 𝐵 ∈ V |
| 19 | ressply1.p | . . . . . 6 ⊢ 𝑃 = (𝑆 ↾s 𝐵) | |
| 20 | 19, 16 | ressvsca 17298 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃)) |
| 21 | 18, 20 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃) |
| 22 | eqid 2737 | . . . . . 6 ⊢ ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘(1o mPoly 𝑅)) | |
| 23 | 10, 22 | ressvsca 17298 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))) |
| 24 | 18, 23 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵)) |
| 25 | 17, 21, 24 | 3eqtr3i 2768 | . . 3 ⊢ ( ·𝑠 ‘𝑃) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵)) |
| 26 | 25 | oveqi 7373 | . 2 ⊢ (𝑋( ·𝑠 ‘𝑃)𝑌) = (𝑋( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))𝑌) |
| 27 | 11, 14, 26 | 3eqtr4g 2797 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 Oncon0 6317 ‘cfv 6492 (class class class)co 7360 1oc1o 8391 Basecbs 17170 ↾s cress 17191 ·𝑠 cvsca 17215 SubRingcsubrg 20537 mPoly cmpl 21896 Poly1cpl1 22150 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-supp 8104 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-fsupp 9268 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-fz 13453 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-sca 17227 df-vsca 17228 df-tset 17230 df-ple 17231 df-subg 19090 df-ring 20207 df-subrg 20538 df-psr 21899 df-mpl 21901 df-opsr 21903 df-psr1 22153 df-ply1 22155 |
| This theorem is referenced by: evls1vsca 22348 asclply1subcl 22349 |
| Copyright terms: Public domain | W3C validator |