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 41279
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 3429 . . 3 (𝜑𝑅 ∈ V)
4 mnringvald.9 . . . 4 (𝜑𝑀𝑊)
54elexd 3429 . . 3 (𝜑𝑀 ∈ V)
6 nfv 1916 . . . . 5 𝑣(𝑟 = 𝑅𝑚 = 𝑀)
7 nfcvd 2918 . . . . 5 ((𝑟 = 𝑅𝑚 = 𝑀) → 𝑣(𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
8 ovexd 7178 . . . . 5 ((𝑟 = 𝑅𝑚 = 𝑀) → (𝑟 freeLMod (Base‘𝑚)) ∈ V)
9 simpr 489 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑟 freeLMod (Base‘𝑚)))
10 simpll 767 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑟 = 𝑅)
11 fveq2 6651 . . . . . . . . . . 11 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
12 mnringvald.4 . . . . . . . . . . 11 𝐴 = (Base‘𝑀)
1311, 12eqtr4di 2812 . . . . . . . . . 10 (𝑚 = 𝑀 → (Base‘𝑚) = 𝐴)
1413ad2antlr 727 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑚) = 𝐴)
1510, 14oveq12d 7161 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑟 freeLMod (Base‘𝑚)) = (𝑅 freeLMod 𝐴))
169, 15eqtrd 2794 . . . . . . 7 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑅 freeLMod 𝐴))
17 mnringvald.6 . . . . . . 7 𝑉 = (𝑅 freeLMod 𝐴)
1816, 17eqtr4di 2812 . . . . . 6 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = 𝑉)
1918fveq2d 6655 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = (Base‘𝑉))
20 mnringvald.7 . . . . . . . . 9 𝐵 = (Base‘𝑉)
2119, 20eqtr4di 2812 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = 𝐵)
22 fveq2 6651 . . . . . . . . . . . . . . . 16 (𝑚 = 𝑀 → (+g𝑚) = (+g𝑀))
23 mnringvald.5 . . . . . . . . . . . . . . . 16 + = (+g𝑀)
2422, 23eqtr4di 2812 . . . . . . . . . . . . . . 15 (𝑚 = 𝑀 → (+g𝑚) = + )
2524oveqd 7160 . . . . . . . . . . . . . 14 (𝑚 = 𝑀 → (𝑎(+g𝑚)𝑏) = (𝑎 + 𝑏))
2625ad2antlr 727 . . . . . . . . . . . . 13 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎(+g𝑚)𝑏) = (𝑎 + 𝑏))
2726eqeq2d 2770 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 = (𝑎(+g𝑚)𝑏) ↔ 𝑖 = (𝑎 + 𝑏)))
28 fveq2 6651 . . . . . . . . . . . . . . 15 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
29 mnringvald.2 . . . . . . . . . . . . . . 15 · = (.r𝑅)
3028, 29eqtr4di 2812 . . . . . . . . . . . . . 14 (𝑟 = 𝑅 → (.r𝑟) = · )
3130oveqd 7160 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → ((𝑥𝑎)(.r𝑟)(𝑦𝑏)) = ((𝑥𝑎) · (𝑦𝑏)))
3231ad2antrr 726 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ((𝑥𝑎)(.r𝑟)(𝑦𝑏)) = ((𝑥𝑎) · (𝑦𝑏)))
33 fveq2 6651 . . . . . . . . . . . . . 14 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
34 mnringvald.3 . . . . . . . . . . . . . 14 0 = (0g𝑅)
3533, 34eqtr4di 2812 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (0g𝑟) = 0 )
3635ad2antrr 726 . . . . . . . . . . . 12 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (0g𝑟) = 0 )
3727, 32, 36ifbieq12d 4441 . . . . . . . . . . 11 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)) = if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))
3814, 37mpteq12dv 5110 . . . . . . . . . 10 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))) = (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))
3914, 14, 38mpoeq123dv 7216 . . . . . . . . 9 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)))) = (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))))
4018, 39oveq12d 7161 . . . . . . . 8 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))) = (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))
4121, 21, 40mpoeq123dv 7216 . . . . . . 7 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟)))))) = (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 ))))))
4241opeq2d 4763 . . . . . 6 (((𝑟 = 𝑅𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩ = ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩)
4318, 42oveq12d 7161 . . . . 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 3831 . . . 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 41278 . . . 4 MndRing = (𝑟 ∈ V, 𝑚 ∈ V ↦ (𝑟 freeLMod (Base‘𝑚)) / 𝑣(𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g𝑚)𝑏), ((𝑥𝑎)(.r𝑟)(𝑦𝑏)), (0g𝑟))))))⟩))
46 ovex 7176 . . . 4 (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩) ∈ V
4744, 45, 46ovmpoa 7293 . . 3 ((𝑅 ∈ V ∧ 𝑀 ∈ V) → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
483, 5, 47syl2anc 588 . 2 (𝜑 → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
491, 48syl5eq 2806 1 (𝜑𝐹 = (𝑉 sSet ⟨(.r‘ndx), (𝑥𝐵, 𝑦𝐵 ↦ (𝑉 Σg (𝑎𝐴, 𝑏𝐴 ↦ (𝑖𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥𝑎) · (𝑦𝑏)), 0 )))))⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1539  wcel 2112  Vcvv 3407  csb 3801  ifcif 4413  cop 4521  cmpt 5105  cfv 6328  (class class class)co 7143  cmpo 7145  ndxcnx 16523   sSet csts 16524  Basecbs 16526  +gcplusg 16608  .rcmulr 16609  0gc0g 16756   Σg cgsu 16757   freeLMod cfrlm 20496   MndRing cmnring 41277
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 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5162  ax-nul 5169  ax-pr 5291
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2071  df-mo 2558  df-eu 2589  df-clab 2737  df-cleq 2751  df-clel 2831  df-nfc 2899  df-ral 3073  df-rex 3074  df-rab 3077  df-v 3409  df-sbc 3694  df-csb 3802  df-dif 3857  df-un 3859  df-in 3861  df-ss 3871  df-nul 4222  df-if 4414  df-sn 4516  df-pr 4518  df-op 4522  df-uni 4792  df-br 5026  df-opab 5088  df-mpt 5106  df-id 5423  df-xp 5523  df-rel 5524  df-cnv 5525  df-co 5526  df-dm 5527  df-iota 6287  df-fun 6330  df-fv 6336  df-ov 7146  df-oprab 7147  df-mpo 7148  df-mnring 41278
This theorem is referenced by:  mnringnmulrd  41280  mnringmulrd  41289
  Copyright terms: Public domain W3C validator