| 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 2763 | . . . . 5 ⊢ (𝐼 mPwSer 𝐻) = (𝐼 mPwSer 𝐻) | |
| 3 | ressmpl.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑈) | |
| 4 | eqid 2763 | . . . . 5 ⊢ (Base‘(𝐼 mPwSer 𝐻)) = (Base‘(𝐼 mPwSer 𝐻)) | |
| 5 | 1, 2, 3, 4 | mplbasss 22331 | . . . 4 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝐻)) |
| 6 | 5 | sseli 3909 | . . 3 ⊢ (𝑌 ∈ 𝐵 → 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻))) |
| 7 | eqid 2763 | . . . 4 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 8 | ressmpl.h | . . . 4 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
| 9 | eqid 2763 | . . . 4 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) = ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) | |
| 10 | ressmpl.2 | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
| 11 | 7, 8, 2, 4, 9, 10 | resspsrvsca 22311 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻)))) → (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
| 12 | 6, 11 | sylanr2 696 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
| 13 | 3 | fvexi 6919 | . . . 4 ⊢ 𝐵 ∈ V |
| 14 | 1, 2, 3 | mplval2 22330 | . . . . 5 ⊢ 𝑈 = ((𝐼 mPwSer 𝐻) ↾s 𝐵) |
| 15 | eqid 2763 | . . . . 5 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) | |
| 16 | 14, 15 | ressvsca 17541 | . . . 4 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘𝑈)) |
| 17 | 13, 16 | ax-mp 5 | . . 3 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝐻)) = ( ·𝑠 ‘𝑈) |
| 18 | 17 | oveqi 7453 | . 2 ⊢ (𝑋( ·𝑠 ‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋( ·𝑠 ‘𝑈)𝑌) |
| 19 | fvex 6918 | . . . . 5 ⊢ (Base‘𝑆) ∈ V | |
| 20 | ressmpl.s | . . . . . . 7 ⊢ 𝑆 = (𝐼 mPoly 𝑅) | |
| 21 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 22 | 20, 7, 21 | mplval2 22330 | . . . . . 6 ⊢ 𝑆 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑆)) |
| 23 | eqid 2763 | . . . . . 6 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) | |
| 24 | 22, 23 | ressvsca 17541 | . . . . 5 ⊢ ((Base‘𝑆) ∈ V → ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘𝑆)) |
| 25 | 19, 24 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) = ( ·𝑠 ‘𝑆) |
| 26 | fvex 6918 | . . . . 5 ⊢ (Base‘(𝐼 mPwSer 𝐻)) ∈ V | |
| 27 | 9, 23 | ressvsca 17541 | . . . . 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 2763 | . . . . . 6 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆) | |
| 31 | 29, 30 | ressvsca 17541 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃)) |
| 32 | 13, 31 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃) |
| 33 | 25, 28, 32 | 3eqtr3i 2794 | . . 3 ⊢ ( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻)))) = ( ·𝑠 ‘𝑃) |
| 34 | 33 | oveqi 7453 | . 2 ⊢ (𝑋( ·𝑠 ‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌) |
| 35 | 12, 18, 34 | 3eqtr3g 2821 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 ↾s cress 17434 ·𝑠 cvsca 17458 SubRingcsubrg 20848 mPwSer cmps 22239 mPoly cmpl 22241 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 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 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-of 7714 df-om 7899 df-1st 8022 df-2nd 8023 df-supp 8202 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-fsupp 9379 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-4 12431 df-5 12432 df-6 12433 df-7 12434 df-8 12435 df-9 12436 df-n0 12631 df-z 12718 df-uz 12990 df-fz 13664 df-struct 17351 df-sets 17368 df-slot 17386 df-ndx 17398 df-base 17414 df-ress 17435 df-plusg 17467 df-mulr 17468 df-sca 17470 df-vsca 17471 df-tset 17473 df-subg 19359 df-ring 20488 df-subrg 20849 df-psr 22244 df-mpl 22246 |
| This theorem is used by: ressply1vsca 22576 |
| Copyright terms: Public domain | W3C validator |