Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mnringmulrvald | Structured version Visualization version GIF version |
Description: Value of multiplication in a monoid ring. (Contributed by Rohan Ridenour, 14-May-2024.) |
Ref | Expression |
---|---|
mnringmulrvald.1 | ⊢ 𝐹 = (𝑅 MndRing 𝑀) |
mnringmulrvald.2 | ⊢ 𝐵 = (Base‘𝐹) |
mnringmulrvald.3 | ⊢ ∙ = (.r‘𝑅) |
mnringmulrvald.4 | ⊢ 𝟎 = (0g‘𝑅) |
mnringmulrvald.5 | ⊢ 𝐴 = (Base‘𝑀) |
mnringmulrvald.6 | ⊢ + = (+g‘𝑀) |
mnringmulrvald.7 | ⊢ · = (.r‘𝐹) |
mnringmulrvald.8 | ⊢ (𝜑 → 𝑅 ∈ 𝑈) |
mnringmulrvald.9 | ⊢ (𝜑 → 𝑀 ∈ 𝑊) |
mnringmulrvald.10 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
mnringmulrvald.11 | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
mnringmulrvald | ⊢ (𝜑 → (𝑋 · 𝑌) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnringmulrvald.1 | . . . . 5 ⊢ 𝐹 = (𝑅 MndRing 𝑀) | |
2 | mnringmulrvald.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
3 | mnringmulrvald.3 | . . . . 5 ⊢ ∙ = (.r‘𝑅) | |
4 | mnringmulrvald.4 | . . . . 5 ⊢ 𝟎 = (0g‘𝑅) | |
5 | mnringmulrvald.5 | . . . . 5 ⊢ 𝐴 = (Base‘𝑀) | |
6 | mnringmulrvald.6 | . . . . 5 ⊢ + = (+g‘𝑀) | |
7 | mnringmulrvald.8 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝑈) | |
8 | mnringmulrvald.9 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ 𝑊) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | mnringmulrd 41839 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = (.r‘𝐹)) |
10 | mnringmulrvald.7 | . . . 4 ⊢ · = (.r‘𝐹) | |
11 | 9, 10 | eqtr4di 2796 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = · ) |
12 | 11 | eqcomd 2744 | . 2 ⊢ (𝜑 → · = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))))) |
13 | fveq1 6773 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑥‘𝑎) = (𝑋‘𝑎)) | |
14 | fveq1 6773 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝑦‘𝑏) = (𝑌‘𝑏)) | |
15 | 13, 14 | oveqan12d 7294 | . . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥‘𝑎) ∙ (𝑦‘𝑏)) = ((𝑋‘𝑎) ∙ (𝑌‘𝑏))) |
16 | 15 | ifeq1d 4478 | . . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ) = if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )) |
17 | 16 | mpteq2dv 5176 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )) = (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))) |
18 | 17 | mpoeq3dv 7354 | . . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) |
19 | 18 | oveq2d 7291 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
20 | 19 | adantl 482 | . 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
21 | mnringmulrvald.10 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
22 | mnringmulrvald.11 | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
23 | ovexd 7310 | . 2 ⊢ (𝜑 → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) ∈ V) | |
24 | 12, 20, 21, 22, 23 | ovmpod 7425 | 1 ⊢ (𝜑 → (𝑋 · 𝑌) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ifcif 4459 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 Basecbs 16912 +gcplusg 16962 .rcmulr 16963 0gc0g 17150 Σg cgsu 17151 MndRing cmnring 41824 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-seq 13722 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-plusg 16975 df-mulr 16976 df-0g 17152 df-gsum 17153 df-mnring 41825 |
This theorem is referenced by: mnringmulrcld 41846 |
Copyright terms: Public domain | W3C validator |