Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ressmpladd | Structured version Visualization version GIF version |
Description: A restricted polynomial algebra has the same addition 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 |
---|---|
ressmpladd | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(+g‘𝑈)𝑌) = (𝑋(+g‘𝑃)𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ressmpl.u | . . . . . 6 ⊢ 𝑈 = (𝐼 mPoly 𝐻) | |
2 | eqid 2821 | . . . . . 6 ⊢ (𝐼 mPwSer 𝐻) = (𝐼 mPwSer 𝐻) | |
3 | ressmpl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑈) | |
4 | eqid 2821 | . . . . . 6 ⊢ (Base‘(𝐼 mPwSer 𝐻)) = (Base‘(𝐼 mPwSer 𝐻)) | |
5 | 1, 2, 3, 4 | mplbasss 20211 | . . . . 5 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝐻)) |
6 | 5 | sseli 3962 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ (Base‘(𝐼 mPwSer 𝐻))) |
7 | 5 | sseli 3962 | . . . 4 ⊢ (𝑌 ∈ 𝐵 → 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻))) |
8 | 6, 7 | anim12i 614 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∈ (Base‘(𝐼 mPwSer 𝐻)) ∧ 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻)))) |
9 | eqid 2821 | . . . 4 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
10 | ressmpl.h | . . . 4 ⊢ 𝐻 = (𝑅 ↾s 𝑇) | |
11 | eqid 2821 | . . . 4 ⊢ ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) = ((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))) | |
12 | ressmpl.2 | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubRing‘𝑅)) | |
13 | 9, 10, 2, 4, 11, 12 | resspsradd 20195 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘(𝐼 mPwSer 𝐻)) ∧ 𝑌 ∈ (Base‘(𝐼 mPwSer 𝐻)))) → (𝑋(+g‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋(+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
14 | 8, 13 | sylan2 594 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(+g‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋(+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌)) |
15 | 3 | fvexi 6683 | . . . 4 ⊢ 𝐵 ∈ V |
16 | 1, 2, 3 | mplval2 20210 | . . . . 5 ⊢ 𝑈 = ((𝐼 mPwSer 𝐻) ↾s 𝐵) |
17 | eqid 2821 | . . . . 5 ⊢ (+g‘(𝐼 mPwSer 𝐻)) = (+g‘(𝐼 mPwSer 𝐻)) | |
18 | 16, 17 | ressplusg 16611 | . . . 4 ⊢ (𝐵 ∈ V → (+g‘(𝐼 mPwSer 𝐻)) = (+g‘𝑈)) |
19 | 15, 18 | ax-mp 5 | . . 3 ⊢ (+g‘(𝐼 mPwSer 𝐻)) = (+g‘𝑈) |
20 | 19 | oveqi 7168 | . 2 ⊢ (𝑋(+g‘(𝐼 mPwSer 𝐻))𝑌) = (𝑋(+g‘𝑈)𝑌) |
21 | fvex 6682 | . . . . 5 ⊢ (Base‘𝑆) ∈ V | |
22 | ressmpl.s | . . . . . . 7 ⊢ 𝑆 = (𝐼 mPoly 𝑅) | |
23 | eqid 2821 | . . . . . . 7 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
24 | 22, 9, 23 | mplval2 20210 | . . . . . 6 ⊢ 𝑆 = ((𝐼 mPwSer 𝑅) ↾s (Base‘𝑆)) |
25 | eqid 2821 | . . . . . 6 ⊢ (+g‘(𝐼 mPwSer 𝑅)) = (+g‘(𝐼 mPwSer 𝑅)) | |
26 | 24, 25 | ressplusg 16611 | . . . . 5 ⊢ ((Base‘𝑆) ∈ V → (+g‘(𝐼 mPwSer 𝑅)) = (+g‘𝑆)) |
27 | 21, 26 | ax-mp 5 | . . . 4 ⊢ (+g‘(𝐼 mPwSer 𝑅)) = (+g‘𝑆) |
28 | fvex 6682 | . . . . 5 ⊢ (Base‘(𝐼 mPwSer 𝐻)) ∈ V | |
29 | 11, 25 | ressplusg 16611 | . . . . 5 ⊢ ((Base‘(𝐼 mPwSer 𝐻)) ∈ V → (+g‘(𝐼 mPwSer 𝑅)) = (+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))) |
30 | 28, 29 | ax-mp 5 | . . . 4 ⊢ (+g‘(𝐼 mPwSer 𝑅)) = (+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻)))) |
31 | ressmpl.p | . . . . . 6 ⊢ 𝑃 = (𝑆 ↾s 𝐵) | |
32 | eqid 2821 | . . . . . 6 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
33 | 31, 32 | ressplusg 16611 | . . . . 5 ⊢ (𝐵 ∈ V → (+g‘𝑆) = (+g‘𝑃)) |
34 | 15, 33 | ax-mp 5 | . . . 4 ⊢ (+g‘𝑆) = (+g‘𝑃) |
35 | 27, 30, 34 | 3eqtr3i 2852 | . . 3 ⊢ (+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻)))) = (+g‘𝑃) |
36 | 35 | oveqi 7168 | . 2 ⊢ (𝑋(+g‘((𝐼 mPwSer 𝑅) ↾s (Base‘(𝐼 mPwSer 𝐻))))𝑌) = (𝑋(+g‘𝑃)𝑌) |
37 | 14, 20, 36 | 3eqtr3g 2879 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋(+g‘𝑈)𝑌) = (𝑋(+g‘𝑃)𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ‘cfv 6354 (class class class)co 7155 Basecbs 16482 ↾s cress 16483 +gcplusg 16564 SubRingcsubrg 19530 mPwSer cmps 20130 mPoly cmpl 20132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-of 7408 df-om 7580 df-1st 7688 df-2nd 7689 df-supp 7830 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-fsupp 8833 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-5 11702 df-6 11703 df-7 11704 df-8 11705 df-9 11706 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 df-struct 16484 df-ndx 16485 df-slot 16486 df-base 16488 df-sets 16489 df-ress 16490 df-plusg 16577 df-mulr 16578 df-sca 16580 df-vsca 16581 df-tset 16583 df-subg 18275 df-ring 19298 df-subrg 19532 df-psr 20135 df-mpl 20137 |
This theorem is referenced by: ressply1add 20397 |
Copyright terms: Public domain | W3C validator |