![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ressply1mul | Structured version Visualization version GIF version |
Description: A restricted polynomial algebra has the same 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 |
---|---|
ressply1mul | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑃)𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2651 | . . 3 ⊢ (1𝑜 mPoly 𝑅) = (1𝑜 mPoly 𝑅) | |
2 | ressply1.h | . . 3 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
3 | eqid 2651 | . . 3 ⊢ (1𝑜 mPoly 𝐻) = (1𝑜 mPoly 𝐻) | |
4 | ressply1.u | . . . 4 ⊢ 𝑈 = (Poly1‘𝐻) | |
5 | eqid 2651 | . . . 4 ⊢ (PwSer1‘𝐻) = (PwSer1‘𝐻) | |
6 | ressply1.b | . . . 4 ⊢ 𝐵 = (Base‘𝑈) | |
7 | 4, 5, 6 | ply1bas 19613 | . . 3 ⊢ 𝐵 = (Base‘(1𝑜 mPoly 𝐻)) |
8 | 1on 7612 | . . . 4 ⊢ 1𝑜 ∈ On | |
9 | 8 | a1i 11 | . . 3 ⊢ (𝜑 → 1𝑜 ∈ On) |
10 | ressply1.2 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
11 | eqid 2651 | . . 3 ⊢ ((1𝑜 mPoly 𝑅) ↾s 𝐵) = ((1𝑜 mPoly 𝑅) ↾s 𝐵) | |
12 | 1, 2, 3, 7, 9, 10, 11 | ressmplmul 19506 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘(1𝑜 mPoly 𝐻))𝑌) = (𝑋(.r‘((1𝑜 mPoly 𝑅) ↾s 𝐵))𝑌)) |
13 | eqid 2651 | . . . 4 ⊢ (.r‘𝑈) = (.r‘𝑈) | |
14 | 4, 3, 13 | ply1mulr 19645 | . . 3 ⊢ (.r‘𝑈) = (.r‘(1𝑜 mPoly 𝐻)) |
15 | 14 | oveqi 6703 | . 2 ⊢ (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘(1𝑜 mPoly 𝐻))𝑌) |
16 | ressply1.s | . . . . 5 ⊢ 𝑆 = (Poly1‘𝑅) | |
17 | eqid 2651 | . . . . 5 ⊢ (.r‘𝑆) = (.r‘𝑆) | |
18 | 16, 1, 17 | ply1mulr 19645 | . . . 4 ⊢ (.r‘𝑆) = (.r‘(1𝑜 mPoly 𝑅)) |
19 | fvex 6239 | . . . . . 6 ⊢ (Base‘𝑈) ∈ V | |
20 | 6, 19 | eqeltri 2726 | . . . . 5 ⊢ 𝐵 ∈ V |
21 | ressply1.p | . . . . . 6 ⊢ 𝑃 = (𝑆 ↾s 𝐵) | |
22 | 21, 17 | ressmulr 16053 | . . . . 5 ⊢ (𝐵 ∈ V → (.r‘𝑆) = (.r‘𝑃)) |
23 | 20, 22 | ax-mp 5 | . . . 4 ⊢ (.r‘𝑆) = (.r‘𝑃) |
24 | eqid 2651 | . . . . . 6 ⊢ (.r‘(1𝑜 mPoly 𝑅)) = (.r‘(1𝑜 mPoly 𝑅)) | |
25 | 11, 24 | ressmulr 16053 | . . . . 5 ⊢ (𝐵 ∈ V → (.r‘(1𝑜 mPoly 𝑅)) = (.r‘((1𝑜 mPoly 𝑅) ↾s 𝐵))) |
26 | 20, 25 | ax-mp 5 | . . . 4 ⊢ (.r‘(1𝑜 mPoly 𝑅)) = (.r‘((1𝑜 mPoly 𝑅) ↾s 𝐵)) |
27 | 18, 23, 26 | 3eqtr3i 2681 | . . 3 ⊢ (.r‘𝑃) = (.r‘((1𝑜 mPoly 𝑅) ↾s 𝐵)) |
28 | 27 | oveqi 6703 | . 2 ⊢ (𝑋(.r‘𝑃)𝑌) = (𝑋(.r‘((1𝑜 mPoly 𝑅) ↾s 𝐵))𝑌) |
29 | 12, 15, 28 | 3eqtr4g 2710 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(.r‘𝑈)𝑌) = (𝑋(.r‘𝑃)𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 ∈ wcel 2030 Vcvv 3231 Oncon0 5761 ‘cfv 5926 (class class class)co 6690 1𝑜c1o 7598 Basecbs 15904 ↾s cress 15905 .rcmulr 15989 SubRingcsubrg 18824 mPoly cmpl 19401 PwSer1cps1 19593 Poly1cpl1 19595 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-of 6939 df-ofr 6940 df-om 7108 df-1st 7210 df-2nd 7211 df-supp 7341 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-2o 7606 df-oadd 7609 df-er 7787 df-map 7901 df-pm 7902 df-ixp 7951 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-fsupp 8317 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-nn 11059 df-2 11117 df-3 11118 df-4 11119 df-5 11120 df-6 11121 df-7 11122 df-8 11123 df-9 11124 df-n0 11331 df-z 11416 df-dec 11532 df-uz 11726 df-fz 12365 df-seq 12842 df-struct 15906 df-ndx 15907 df-slot 15908 df-base 15910 df-sets 15911 df-ress 15912 df-plusg 16001 df-mulr 16002 df-sca 16004 df-vsca 16005 df-tset 16007 df-ple 16008 df-0g 16149 df-gsum 16150 df-mgm 17289 df-sgrp 17331 df-mnd 17342 df-submnd 17383 df-grp 17472 df-minusg 17473 df-subg 17638 df-mgp 18536 df-ring 18595 df-subrg 18826 df-psr 19404 df-mpl 19406 df-opsr 19408 df-psr1 19598 df-ply1 19600 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |