| Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mnringnmulrd | Structured version Visualization version GIF version | ||
| Description: Components of a monoid ring other than its ring product match its underlying free module. (Contributed by Rohan Ridenour, 14-May-2024.) (Revised by AV, 1-Nov-2024.) |
| Ref | Expression |
|---|---|
| mnringnmulrd.1 | ⊢ 𝐹 = (𝑅 MndRing 𝑀) |
| mnringnmulrd.2 | ⊢ 𝐸 = Slot (𝐸‘ndx) |
| mnringnmulrd.4 | ⊢ (𝐸‘ndx) ≠ (.r‘ndx) |
| mnringnmulrd.5 | ⊢ 𝐴 = (Base‘𝑀) |
| mnringnmulrd.6 | ⊢ 𝑉 = (𝑅 freeLMod 𝐴) |
| mnringnmulrd.7 | ⊢ (𝜑 → 𝑅 ∈ 𝑈) |
| mnringnmulrd.8 | ⊢ (𝜑 → 𝑀 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| mnringnmulrd | ⊢ (𝜑 → (𝐸‘𝑉) = (𝐸‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mnringnmulrd.2 | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
| 2 | mnringnmulrd.4 | . . 3 ⊢ (𝐸‘ndx) ≠ (.r‘ndx) | |
| 3 | 1, 2 | setsnid 17412 | . 2 ⊢ (𝐸‘𝑉) = (𝐸‘(𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉)) |
| 4 | mnringnmulrd.1 | . . . 4 ⊢ 𝐹 = (𝑅 MndRing 𝑀) | |
| 5 | eqid 2763 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2763 | . . . 4 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | mnringnmulrd.5 | . . . 4 ⊢ 𝐴 = (Base‘𝑀) | |
| 8 | eqid 2763 | . . . 4 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 9 | mnringnmulrd.6 | . . . 4 ⊢ 𝑉 = (𝑅 freeLMod 𝐴) | |
| 10 | eqid 2763 | . . . 4 ⊢ (Base‘𝑉) = (Base‘𝑉) | |
| 11 | mnringnmulrd.7 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑈) | |
| 12 | mnringnmulrd.8 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑊) | |
| 13 | 4, 5, 6, 7, 8, 9, 10, 11, 12 | mnringvald 45401 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉)) |
| 14 | 13 | fveq2d 6909 | . 2 ⊢ (𝜑 → (𝐸‘𝐹) = (𝐸‘(𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉))) |
| 15 | 3, 14 | eqtr4id 2817 | 1 ⊢ (𝜑 → (𝐸‘𝑉) = (𝐸‘𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ifcif 4485 〈cop 4838 ↦ cmpt 5189 ‘cfv 6555 (class class class)co 7440 ∈ cmpo 7442 sSet csts 17367 Slot cslot 17385 ndxcnx 17397 Basecbs 17413 +gcplusg 17454 .rcmulr 17455 0gc0g 17636 Σg cgsu 17637 freeLMod cfrlm 22079 MndRing cmnring 45399 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-res 5667 df-iota 6509 df-fun 6557 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-sets 17368 df-slot 17386 df-mnring 45400 |
| This theorem is used by: mnringbased 45403 mnringaddgd 45408 mnringscad 45412 mnringvscad 45413 |
| Copyright terms: Public domain | W3C validator |