Theorem mnringvald 44970

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 3480	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
4		mnringvald.9	. . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑊)
5	4	elexd 3480	. . 3 ⊢ (𝜑 → 𝑀 ∈ V)
6		nfv 1947	. . . . 5 ⊢ Ⅎ𝑣(𝑟 = 𝑅 ∧ 𝑚 = 𝑀)
7		nfcvd 2928	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → Ⅎ𝑣(𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
8		ovexd 7451	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) → (𝑟 freeLMod (Base‘𝑚)) ∈ V)
9		simpr 490	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑟 freeLMod (Base‘𝑚)))
10		simpll 779	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑟 = 𝑅)
11		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
12		mnringvald.4	. . . . . . . . . . 11 ⊢ 𝐴 = (Base‘𝑀)
13	11, 12	eqtr4di 2818	. . . . . . . . . 10 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = 𝐴)
14	13	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑚) = 𝐴)
15	10, 14	oveq12d 7434	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑟 freeLMod (Base‘𝑚)) = (𝑅 freeLMod 𝐴))
16	9, 15	eqtrd 2800	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = (𝑅 freeLMod 𝐴))
17		mnringvald.6	. . . . . . 7 ⊢ 𝑉 = (𝑅 freeLMod 𝐴)
18	16, 17	eqtr4di 2818	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → 𝑣 = 𝑉)
19	18	fveq2d 6889	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = (Base‘𝑉))
20		mnringvald.7	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑉)
21	19, 20	eqtr4di 2818	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (Base‘𝑣) = 𝐵)
22		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀))
23		mnringvald.5	. . . . . . . . . . . . . . . 16 ⊢ + = (+g‘𝑀)
24	22, 23	eqtr4di 2818	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = + )
25	24	oveqd 7433	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑀 → (𝑎(+g‘𝑚)𝑏) = (𝑎 + 𝑏))
26	25	ad2antlr 740	. . . . . . . . . . . . 13 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎(+g‘𝑚)𝑏) = (𝑎 + 𝑏))
27	26	eqeq2d 2776	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 = (𝑎(+g‘𝑚)𝑏) ↔ 𝑖 = (𝑎 + 𝑏)))
28		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
29		mnringvald.2	. . . . . . . . . . . . . . 15 ⊢ · = (.r‘𝑅)
30	28, 29	eqtr4di 2818	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
31	30	oveqd 7433	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)) = ((𝑥‘𝑎) · (𝑦‘𝑏)))
32	31	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)) = ((𝑥‘𝑎) · (𝑦‘𝑏)))
33		fveq2 6885	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
34		mnringvald.3	. . . . . . . . . . . . . 14 ⊢ 0 = (0g‘𝑅)
35	33, 34	eqtr4di 2818	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
36	35	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (0g‘𝑟) = 0 )
37	27, 32, 36	ifbieq12d 4518	. . . . . . . . . . 11 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)) = if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))
38	14, 37	mpteq12dv 5200	. . . . . . . . . 10 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))) = (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))
39	14, 14, 38	mpoeq123dv 7491	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)))) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))))
40	18, 39	oveq12d 7434	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))) = (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))
41	21, 21, 40	mpoeq123dv 7491	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟)))))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 ))))))
42	41	opeq2d 4847	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑚 = 𝑀) ∧ 𝑣 = (𝑟 freeLMod (Base‘𝑚))) → ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))))⟩ = ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩)
43	18, 42	oveq12d 7434	. . . . 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 3884	. . . 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 44969	. . . 4 ⊢ MndRing = (𝑟 ∈ V, 𝑚 ∈ V ↦ ⦋(𝑟 freeLMod (Base‘𝑚)) / 𝑣⦌(𝑣 sSet ⟨(.r‘ndx), (𝑥 ∈ (Base‘𝑣), 𝑦 ∈ (Base‘𝑣) ↦ (𝑣 Σg (𝑎 ∈ (Base‘𝑚), 𝑏 ∈ (Base‘𝑚) ↦ (𝑖 ∈ (Base‘𝑚) ↦ if(𝑖 = (𝑎(+g‘𝑚)𝑏), ((𝑥‘𝑎)(.r‘𝑟)(𝑦‘𝑏)), (0g‘𝑟))))))⟩))
46		ovex 7449	. . . 4 ⊢ (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩) ∈ V
47	44, 45, 46	ovmpoa 7571	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝑀 ∈ V) → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
48	3, 5, 47	syl2anc 596	. 2 ⊢ (𝜑 → (𝑅 MndRing 𝑀) = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))
49	1, 48	eqtrid 2812	1 ⊢ (𝜑 → 𝐹 = (𝑉 sSet ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎 + 𝑏), ((𝑥‘𝑎) · (𝑦‘𝑏)), 0 )))))⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ⦋csb 3854  ifcif 4489  ⟨cop 4597   ↦ cmpt 5194  ‘cfv 6540  (class class class)co 7416   ∈ cmpo 7418   sSet csts 17240  ndxcnx 17270  Basecbs 17286  +_gcplusg 17327  ._rcmulr 17328  0_gc0g 17509   Σ_g cgsu 17510   freeLMod cfrlm 21925   MndRing cmnring 44968

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-mnring 44969

This theorem is used by:  mnringnmulrd  44971  mnringmulrd  44980