![]() |
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 44190 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = (.r‘𝐹)) |
10 | mnringmulrvald.7 | . . . 4 ⊢ · = (.r‘𝐹) | |
11 | 9, 10 | eqtr4di 2798 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = · ) |
12 | 11 | eqcomd 2746 | . 2 ⊢ (𝜑 → · = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))))) |
13 | fveq1 6919 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑥‘𝑎) = (𝑋‘𝑎)) | |
14 | fveq1 6919 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝑦‘𝑏) = (𝑌‘𝑏)) | |
15 | 13, 14 | oveqan12d 7467 | . . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥‘𝑎) ∙ (𝑦‘𝑏)) = ((𝑋‘𝑎) ∙ (𝑌‘𝑏))) |
16 | 15 | ifeq1d 4567 | . . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ) = if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )) |
17 | 16 | mpteq2dv 5268 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )) = (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))) |
18 | 17 | mpoeq3dv 7529 | . . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) |
19 | 18 | oveq2d 7464 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
20 | 19 | adantl 481 | . 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
21 | mnringmulrvald.10 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
22 | mnringmulrvald.11 | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
23 | ovexd 7483 | . 2 ⊢ (𝜑 → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) ∈ V) | |
24 | 12, 20, 21, 22, 23 | ovmpod 7602 | 1 ⊢ (𝜑 → (𝑋 · 𝑌) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ifcif 4548 ↦ cmpt 5249 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 Basecbs 17258 +gcplusg 17311 .rcmulr 17312 0gc0g 17499 Σg cgsu 17500 MndRing cmnring 44175 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-seq 14053 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-plusg 17324 df-mulr 17325 df-0g 17501 df-gsum 17502 df-mnring 44176 |
This theorem is referenced by: mnringmulrcld 44197 |
Copyright terms: Public domain | W3C validator |