| 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 2765 | . . 3 ⊢ (1o mPoly 𝑅) = (1o mPoly 𝑅) | |
| 2 | ressply1.h | . . 3 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
| 3 | eqid 2765 | . . 3 ⊢ (1o mPoly 𝐻) = (1o mPoly 𝐻) | |
| 4 | ressply1.u | . . . 4 ⊢ 𝑈 = (Poly1‘𝐻) | |
| 5 | ressply1.b | . . . 4 ⊢ 𝐵 = (Base‘𝑈) | |
| 6 | 4, 5 | ply1bas 22410 | . . 3 ⊢ 𝐵 = (Base‘(1o mPoly 𝐻)) |
| 7 | 1on 8473 | . . . 4 ⊢ 1o ∈ On | |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝜑 → 1o ∈ On) |
| 9 | ressply1.2 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
| 10 | eqid 2765 | . . 3 ⊢ ((1o mPoly 𝑅) ↾s 𝐵) = ((1o mPoly 𝑅) ↾s 𝐵) | |
| 11 | 1, 2, 3, 6, 8, 9, 10 | ressmplvsca 22236 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘(1o mPoly 𝐻))𝑌) = (𝑋( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))𝑌)) |
| 12 | eqid 2765 | . . . 4 ⊢ ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘𝑈) | |
| 13 | 4, 3, 12 | ply1vsca 22439 | . . 3 ⊢ ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘(1o mPoly 𝐻)) |
| 14 | 13 | oveqi 7433 | . 2 ⊢ (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘(1o mPoly 𝐻))𝑌) |
| 15 | ressply1.s | . . . . 5 ⊢ 𝑆 = (Poly1‘𝑅) | |
| 16 | eqid 2765 | . . . . 5 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆) | |
| 17 | 15, 1, 16 | ply1vsca 22439 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘(1o mPoly 𝑅)) |
| 18 | 5 | fvexi 6900 | . . . . 5 ⊢ 𝐵 ∈ V |
| 19 | ressply1.p | . . . . . 6 ⊢ 𝑃 = (𝑆 ↾s 𝐵) | |
| 20 | 19, 16 | ressvsca 17424 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃)) |
| 21 | 18, 20 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑃) |
| 22 | eqid 2765 | . . . . . 6 ⊢ ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘(1o mPoly 𝑅)) | |
| 23 | 10, 22 | ressvsca 17424 | . . . . 5 ⊢ (𝐵 ∈ V → ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))) |
| 24 | 18, 23 | ax-mp 5 | . . . 4 ⊢ ( ·𝑠 ‘(1o mPoly 𝑅)) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵)) |
| 25 | 17, 21, 24 | 3eqtr3i 2796 | . . 3 ⊢ ( ·𝑠 ‘𝑃) = ( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵)) |
| 26 | 25 | oveqi 7433 | . 2 ⊢ (𝑋( ·𝑠 ‘𝑃)𝑌) = (𝑋( ·𝑠 ‘((1o mPoly 𝑅) ↾s 𝐵))𝑌) |
| 27 | 11, 14, 26 | 3eqtr4g 2825 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝐵)) → (𝑋( ·𝑠 ‘𝑈)𝑌) = (𝑋( ·𝑠 ‘𝑃)𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 Oncon0 6365 ‘cfv 6541 (class class class)co 7420 1oc1o 8453 Basecbs 17296 ↾s cress 17317 ·𝑠 cvsca 17341 SubRingcsubrg 20723 mPoly cmpl 22111 Poly1cpl1 22392 |
| 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 7743 ax-cnex 11176 ax-resscn 11177 ax-1cn 11178 ax-icn 11179 ax-addcl 11180 ax-addrcl 11181 ax-mulcl 11182 ax-mulrcl 11183 ax-mulcom 11184 ax-addass 11185 ax-mulass 11186 ax-distr 11187 ax-i2m1 11188 ax-1ne0 11189 ax-1rid 11190 ax-rnegex 11191 ax-rrecex 11192 ax-cnre 11193 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 ax-pre-mulgt0 11197 |
| 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-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 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7685 df-om 7870 df-1st 7993 df-2nd 7994 df-supp 8164 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8460 df-er 8701 df-map 8833 df-en 8951 df-dom 8952 df-sdom 8953 df-fin 8954 df-fsupp 9330 df-pnf 11265 df-mnf 11266 df-xr 11267 df-ltxr 11268 df-le 11269 df-sub 11463 df-neg 11464 df-nn 12254 df-2 12323 df-3 12324 df-4 12325 df-5 12326 df-6 12327 df-7 12328 df-8 12329 df-9 12330 df-n0 12525 df-z 12612 df-dec 12733 df-uz 12884 df-fz 13557 df-struct 17234 df-sets 17251 df-slot 17269 df-ndx 17281 df-base 17297 df-ress 17318 df-plusg 17350 df-mulr 17351 df-sca 17353 df-vsca 17354 df-tset 17356 df-ple 17357 df-subg 19238 df-ring 20366 df-subrg 20724 df-psr 22114 df-mpl 22116 df-opsr 22118 df-psr1 22395 df-ply1 22397 |
| This theorem is used by: evls1vsca 22588 asclply1subcl 22589 |
| Copyright terms: Public domain | W3C validator |