Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ressmplvsca | 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 |
---|---|
ressmpl.s | ⊢ 𝑆 = (𝐼 mPoly 𝑅) |
ressmpl.h | ⊢ 𝐻 = (𝑅 ↾s 𝑇) |
ressmpl.u | ⊢ 𝑈 = (𝐼 mPoly 𝐻) |
ressmpl.b | ⊢ 𝐵 = (Base‘𝑈) |
ressmpl.1 | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
ressmpl.2 | ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) |
ressmpl.p | ⊢ 𝑃 = (𝑆 ↾s 𝐵) |
Ref | Expression |
---|---|
ressmplvsca | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ressmpl.u | . . . . 5 ⊢ 𝑈 = (𝐼 mPoly 𝐻) | |
2 | eqid 2734 | . . . . 5 ⊢ (𝐼 mPwSer 𝐻) = (𝐼 mPwSer 𝐻) | |
3 | ressmpl.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑈) | |
4 | eqid 2734 | . . . . 5 ⊢ (Base‘(𝐼 mPwSer 𝐻)) = (Base‘(𝐼 mPwSer 𝐻)) | |
5 | 1, 2, 3, 4 | mplbasss 20931 | . . . 4 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝐻)) |
6 | 5 | sseli 3887 | . . 3 ⊢ (𝑌 ∈ 𝐵 → 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻))) |
7 | eqid 2734 | . . . 4 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
8 | ressmpl.h | . . . 4 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
9 | eqid 2734 | . . . 4 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) = ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) | |
10 | ressmpl.2 | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
11 | 7, 8, 2, 4, 9, 10 | resspsrvsca 20915 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻)))) → (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
12 | 6, 11 | sylanr2 683 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
13 | 3 | fvexi 6720 | . . . 4 ⊢ 𝐵 ∈ V |
14 | 1, 2, 3 | mplval2 20930 | . . . . 5 ⊢ 𝑈 = ((𝐼 mPwSer 𝐻) ↾s 𝐵) |
15 | eqid 2734 | . . . . 5 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) | |
16 | 14, 15 | ressvsca 16853 | . . . 4 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘𝑈)) |
17 | 13, 16 | ax-mp 5 | . . 3 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘𝑈) |
18 | 17 | oveqi 7215 | . 2 ⊢ (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘𝑈)𝑌) |
19 | fvex 6719 | . . . . 5 ⊢ (Base‘𝑆) ∈ V | |
20 | ressmpl.s | . . . . . . 7 ⊢ 𝑆 = (𝐼 mPoly 𝑅) | |
21 | eqid 2734 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
22 | 20, 7, 21 | mplval2 20930 | . . . . . 6 ⊢ 𝑆 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑆)) |
23 | eqid 2734 | . . . . . 6 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) | |
24 | 22, 23 | ressvsca 16853 | . . . . 5 ⊢ ((Base‘𝑆) ∈ V → ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘𝑆)) |
25 | 19, 24 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘𝑆) |
26 | fvex 6719 | . . . . 5 ⊢ (Base‘(𝐼 mPwSer 𝐻)) ∈ V | |
27 | 9, 23 | ressvsca 16853 | . . . . 5 ⊢ ((Base‘(𝐼 mPwSer 𝐻)) ∈ V → ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))) |
28 | 26, 27 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻)))) |
29 | ressmpl.p | . . . . . 6 ⊢ 𝑃 = (𝑆 ↾s 𝐵) | |
30 | eqid 2734 | . . . . . 6 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆) | |
31 | 29, 30 | ressvsca 16853 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃)) |
32 | 13, 31 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃) |
33 | 25, 28, 32 | 3eqtr3i 2770 | . . 3 ⊢ ( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻)))) = ( ·𝑠 ‘𝑃) |
34 | 33 | oveqi 7215 | . 2 ⊢ (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌) |
35 | 12, 18, 34 | 3eqtr3g 2797 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 Vcvv 3401 ‘cfv 6369 (class class class)co 7202 Basecbs 16684 ↾s cress 16685 ·𝑠 cvsca 16771 SubRingcsubrg 19768 mPwSer cmps 20835 mPoly cmpl 20837 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-of 7458 df-om 7634 df-1st 7750 df-2nd 7751 df-supp 7893 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-er 8380 df-map 8499 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-fsupp 8975 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-nn 11814 df-2 11876 df-3 11877 df-4 11878 df-5 11879 df-6 11880 df-7 11881 df-8 11882 df-9 11883 df-n0 12074 df-z 12160 df-uz 12422 df-fz 13079 df-struct 16686 df-ndx 16687 df-slot 16688 df-base 16690 df-sets 16691 df-ress 16692 df-plusg 16780 df-mulr 16781 df-sca 16783 df-vsca 16784 df-tset 16786 df-subg 18512 df-ring 19536 df-subrg 19770 df-psr 20840 df-mpl 20842 |
This theorem is referenced by: ressply1vsca 21125 |
Copyright terms: Public domain | W3C validator |