Theorem mnringvald 41779

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.

Step	Hyp	Ref	Expression
1		mnringvald.1	. 2 ⊢ 𝐹 = (𝑅 MndRing 𝑀)
2		mnringvald.8	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑈)
3	2	elexd 3450	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
4		mnringvald.9	. . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑊)
5	4	elexd 3450	. . 3 ⊢ (𝜑 → 𝑀 ∈ V)
6		nfv 1920	. . . . 5 ⊢ Ⅎ𝑣(𝑟 = 𝑅 ∧ 𝑚 = 𝑀)
7		nfcvd 2909	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → Ⅎ𝑣(𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
8		ovexd 7303	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑟 freeLMod (Base‘𝑚)) ∈ V)
9		simpr 484	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑟 freeLMod (Base‘𝑚)))
10		simpll 763	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑟 = 𝑅)
11		fveq2 6768	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
12		mnringvald.4	. . . . . . . . . . 11 ⊢ 𝐴 = (Base‘𝑀)
13	11, 12	eqtr4di 2797	. . . . . . . . . 10 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = 𝐴)
14	13	ad2antlr 723	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑚) = 𝐴)
15	10, 14	oveq12d 7286	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑟 freeLMod (Base‘𝑚)) = (𝑅 freeLMod 𝐴))
16	9, 15	eqtrd 2779	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑅 freeLMod 𝐴))
17		mnringvald.6	. . . . . . 7 ⊢ 𝑉 = (𝑅 freeLMod 𝐴)
18	16, 17	eqtr4di 2797	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = 𝑉)
19	18	fveq2d 6772	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = (Base‘𝑉))
20		mnringvald.7	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑉)
21	19, 20	eqtr4di 2797	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = 𝐵)
22		fveq2 6768	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀))
23		mnringvald.5	. . . . . . . . . . . . . . . 16 ⊢ + = (+g‘𝑀)
24	22, 23	eqtr4di 2797	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = + )
25	24	oveqd 7285	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑀 → (𝑎(+g‘𝑚)𝑏) = (𝑎 + 𝑏))
26	25	ad2antlr 723	. . . . . . . . . . . . 13 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎(+g‘𝑚)𝑏) = (𝑎 + 𝑏))
27	26	eqeq2d 2750	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 = (𝑎(+g‘𝑚)𝑏) ↔ 𝑖 = (𝑎 + 𝑏)))
28		fveq2 6768	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
29		mnringvald.2	. . . . . . . . . . . . . . 15 ⊢ · = (.r‘𝑅)
30	28, 29	eqtr4di 2797	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
31	30	oveqd 7285	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)) = ((𝑥‘𝑎) · (𝑦‘𝑏)))
32	31	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)) = ((𝑥‘𝑎) · (𝑦‘𝑏)))
33		fveq2 6768	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
34		mnringvald.3	. . . . . . . . . . . . . 14 ⊢ 0 = (0g‘𝑅)
35	33, 34	eqtr4di 2797	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
36	35	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (0g‘𝑟) = 0 )
37	27, 32, 36	ifbieq12d 4492	. . . . . . . . . . 11 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)) = if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))
38	14, 37	mpteq12dv 5169	. . . . . . . . . 10 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))) = (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))
39	14, 14, 38	mpoeq123dv 7341	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)))) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))))
40	18, 39	oveq12d 7286	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))) = (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))
41	21, 21, 40	mpoeq123dv 7341	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)))))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))))))
42	41	opeq2d 4816	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))))⟩ = ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩)
43	18, 42	oveq12d 7286	. . . . 5 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))))⟩) = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
44	6, 7, 8, 43	csbiedf 3867	. . . 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 41778	. . . 4 ⊢ MndRing = (𝑟 ∈ V, 𝑚 ∈ V ↦ ⦋(𝑟 freeLMod (Base‘𝑚)) / 𝑣⦌(𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))))⟩))
46		ovex 7301	. . . 4 ⊢ (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩) ∈ V
47	44, 45, 46	ovmpoa 7419	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝑀 ∈ V) → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
48	3, 5, 47	syl2anc 583	. 2 ⊢ (𝜑 → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
49	1, 48	eqtrid 2791	1 ⊢ (𝜑 → 𝐹 = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2109  Vcvv 3430  ⦋csb 3836  ifcif 4464  ⟨cop 4572   ↦ cmpt 5161  ‘cfv 6430  (class class class)co 7268   ∈ cmpo 7270   sSet csts 16845  ndxcnx 16875  Basecbs 16893  +_gcplusg 16943  ._rcmulr 16944  0_gc0g 17131   Σ_g cgsu 17132   freeLMod cfrlm 20934   MndRing cmnring 41777

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-iota 6388  df-fun 6432  df-fv 6438  df-ov 7271  df-oprab 7272  df-mpo 7273  df-mnring 41778

This theorem is referenced by:  mnringnmulrd  41780  mnringnmulrdOLD  41781  mnringmulrd  41792