Users' Mathboxes Mathbox for Rohan Ridenour < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mnringvald Structured version   Visualization version   GIF version

Theorem mnringvald 44370
Description: Value of the monoid ring function. (Contributed by Rohan Ridenour, 14-May-2024.)
Hypotheses
Ref Expression
mnringvald.1 𝐹 = (𝑅 MndRing 𝑀)
mnringvald.2 · = (.r𝑅)
mnringvald.3 0 = (0g𝑅)
mnringvald.4 𝐴 = (Base‘𝑀)
mnringvald.5 + = (+g𝑀)
mnringvald.6 𝑉 = (𝑅 freeLMod 𝐴)
mnringvald.7 𝐵 = (Base‘𝑉)
mnringvald.8 (𝜑𝑅𝑈)
mnringvald.9 (𝜑𝑀𝑊)
Assertion
Ref Expression
mnringvald (𝜑𝐹 = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
Distinct variable groups:   𝑅,𝑎,𝑏,𝑖,𝑥,𝑦   𝑀,𝑎,𝑏,𝑖,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑖,𝑎,𝑏)   𝐴(𝑥,𝑦,𝑖,𝑎,𝑏)   𝐵(𝑥,𝑦,𝑖,𝑎,𝑏)   + (𝑥,𝑦,𝑖,𝑎,𝑏)   · (𝑥,𝑦,𝑖,𝑎,𝑏)   𝑈(𝑥,𝑦,𝑖,𝑎,𝑏)   𝐹(𝑥,𝑦,𝑖,𝑎,𝑏)   𝑉(𝑥,𝑦,𝑖,𝑎,𝑏)   𝑊(𝑥,𝑦,𝑖,𝑎,𝑏)   0 (𝑥,𝑦,𝑖,𝑎,𝑏)

Proof of Theorem mnringvald
Dummy variables 𝑚 𝑟 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mnringvald.1 . 2 𝐹 = (𝑅 MndRing 𝑀)
2 mnringvald.8 . . . 4 (𝜑𝑅𝑈)
32elexd 3461 . . 3 (𝜑𝑅 ∈ V)
4 mnringvald.9 . . . 4 (𝜑𝑀𝑊)
54elexd 3461 . . 3 (𝜑𝑀 ∈ V)
6 nfv 1915 . . . . 5 𝑣(𝑟 = 𝑅𝑚 = 𝑀)
7 nfcvd 2896 . . . . 5 ((𝑟 = 𝑅𝑚 = 𝑀) → 𝑣(𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
8 ovexd 7390 . . . . 5 ((𝑟 = 𝑅𝑚 = 𝑀) → (𝑟 freeLMod (Base‘𝑚)) ∈ V)
9 simpr 484 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑟 freeLMod (Base‘𝑚)))
10 simpll 766 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑟 = 𝑅)
11 fveq2 6831 . . . . . . . . . . 11 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
12 mnringvald.4 . . . . . . . . . . 11 𝐴 = (Base‘𝑀)
1311, 12eqtr4di 2786 . . . . . . . . . 10 (𝑚 = 𝑀 → (Base‘𝑚) = 𝐴)
1413ad2antlr 727 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑚) = 𝐴)
1510, 14oveq12d 7373 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑟 freeLMod (Base‘𝑚)) = (𝑅 freeLMod 𝐴))
169, 15eqtrd 2768 . . . . . . 7 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑅 freeLMod 𝐴))
17 mnringvald.6 . . . . . . 7 𝑉 = (𝑅 freeLMod 𝐴)
1816, 17eqtr4di 2786 . . . . . 6 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = 𝑉)
1918fveq2d 6835 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = (Base‘𝑉))
20 mnringvald.7 . . . . . . . . 9 𝐵 = (Base‘𝑉)
2119, 20eqtr4di 2786 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = 𝐵)
22 fveq2 6831 . . . . . . . . . . . . . . . 16 (𝑚 = 𝑀 → (+g𝑚) = (+g𝑀))
23 mnringvald.5 . . . . . . . . . . . . . . . 16 + = (+g𝑀)
2422, 23eqtr4di 2786 . . . . . . . . . . . . . . 15 (𝑚 = 𝑀 → (+g𝑚) = + )
2524oveqd 7372 . . . . . . . . . . . . . 14 (𝑚 = 𝑀 → (𝑎(+g𝑚)𝑏) = (𝑎 + 𝑏))
2625ad2antlr 727 . . . . . . . . . . . . 13 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎(+g𝑚)𝑏) = (𝑎 + 𝑏))
2726eqeq2d 2744 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 = (𝑎(+g𝑚)𝑏) ↔ 𝑖 = (𝑎 + 𝑏)))
28 fveq2 6831 . . . . . . . . . . . . . . 15 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
29 mnringvald.2 . . . . . . . . . . . . . . 15 · = (.r𝑅)
3028, 29eqtr4di 2786 . . . . . . . . . . . . . 14 (𝑟 = 𝑅 → (.r𝑟) = · )
3130oveqd 7372 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → ((𝑥𝑎)(.r𝑟)(𝑦𝑏)) = ((𝑥𝑎) · (𝑦𝑏)))
3231ad2antrr 726 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ((𝑥𝑎)(.r𝑟)(𝑦𝑏)) = ((𝑥𝑎) · (𝑦𝑏)))
33 fveq2 6831 . . . . . . . . . . . . . 14 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
34 mnringvald.3 . . . . . . . . . . . . . 14 0 = (0g𝑅)
3533, 34eqtr4di 2786 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (0g𝑟) = 0 )
3635ad2antrr 726 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (0g𝑟) = 0 )
3727, 32, 36ifbieq12d 4505 . . . . . . . . . . 11 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)) = if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))
3814, 37mpteq12dv 5182 . . . . . . . . . 10 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))) = (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))
3914, 14, 38mpoeq123dv 7430 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)))) = (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))))
4018, 39oveq12d 7373 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))) = (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))
4121, 21, 40mpoeq123dv 7430 . . . . . . 7 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)))))) = (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))))))
4241opeq2d 4833 . . . . . 6 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩ = ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩)
4318, 42oveq12d 7373 . . . . 5 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
446, 7, 8, 43csbiedf 3876 . . . 4 ((𝑟 = 𝑅𝑚 = 𝑀) → (𝑟 freeLMod (Base‘𝑚)) / 𝑣(𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
45 df-mnring 44369 . . . 4 MndRing = (𝑟 ∈ V, 𝑚 ∈ V ↦ (𝑟 freeLMod (Base‘𝑚)) / 𝑣(𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩))
46 ovex 7388 . . . 4 (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩) ∈ V
4744, 45, 46ovmpoa 7510 . . 3 ((𝑅 ∈ V ∧ 𝑀 ∈ V) → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
483, 5, 47syl2anc 584 . 2 (𝜑 → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
491, 48eqtrid 2780 1 (𝜑𝐹 = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3437  csb 3846  ifcif 4476  cop 4583  cmpt 5176  cfv 6489  (class class class)co 7355  cmpo 7357   sSet csts 17081  ndxcnx 17111  Basecbs 17127  +gcplusg 17168  .rcmulr 17169  0gc0g 17350   Σg cgsu 17351   freeLMod cfrlm 21692   MndRing cmnring 44368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-mnring 44369
This theorem is referenced by:  mnringnmulrd  44371  mnringmulrd  44380
  Copyright terms: Public domain W3C validator