![]() |
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 44217 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = (.r‘𝐹)) |
10 | mnringmulrvald.7 | . . . 4 ⊢ · = (.r‘𝐹) | |
11 | 9, 10 | eqtr4di 2793 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))))) = · ) |
12 | 11 | eqcomd 2741 | . 2 ⊢ (𝜑 → · = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))))) |
13 | fveq1 6906 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑥‘𝑎) = (𝑋‘𝑎)) | |
14 | fveq1 6906 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝑦‘𝑏) = (𝑌‘𝑏)) | |
15 | 13, 14 | oveqan12d 7450 | . . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥‘𝑎) ∙ (𝑦‘𝑏)) = ((𝑋‘𝑎) ∙ (𝑌‘𝑏))) |
16 | 15 | ifeq1d 4550 | . . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ) = if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )) |
17 | 16 | mpteq2dv 5250 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )) = (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))) |
18 | 17 | mpoeq3dv 7512 | . . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 ))) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) |
19 | 18 | oveq2d 7447 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
20 | 19 | adantl 481 | . 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) ∙ (𝑦‘𝑏)), 𝟎 )))) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
21 | mnringmulrvald.10 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
22 | mnringmulrvald.11 | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
23 | ovexd 7466 | . 2 ⊢ (𝜑 → (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 )))) ∈ V) | |
24 | 12, 20, 21, 22, 23 | ovmpod 7585 | 1 ⊢ (𝜑 → (𝑋 · 𝑌) = (𝐹 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑋‘𝑎) ∙ (𝑌‘𝑏)), 𝟎 ))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ifcif 4531 ↦ cmpt 5231 ‘cfv 6563 (class class class)co 7431 ∈ cmpo 7433 Basecbs 17245 +gcplusg 17298 .rcmulr 17299 0gc0g 17486 Σg cgsu 17487 MndRing cmnring 44202 |
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 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-seq 14040 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-mulr 17312 df-0g 17488 df-gsum 17489 df-mnring 44203 |
This theorem is referenced by: mnringmulrcld 44224 |
Copyright terms: Public domain | W3C validator |