| 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 17274 | . 2 ⊢ (𝐸‘𝑉) = (𝐸‘(𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉)) |
| 4 | mnringnmulrd.1 | . . . 4 ⊢ 𝐹 = (𝑅 MndRing 𝑀) | |
| 5 | eqid 2762 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2762 | . . . 4 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 7 | mnringnmulrd.5 | . . . 4 ⊢ 𝐴 = (Base‘𝑀) | |
| 8 | eqid 2762 | . . . 4 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 9 | mnringnmulrd.6 | . . . 4 ⊢ 𝑉 = (𝑅 freeLMod 𝐴) | |
| 10 | eqid 2762 | . . . 4 ⊢ (Base‘𝑉) = (Base‘𝑉) | |
| 11 | mnringnmulrd.7 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑈) | |
| 12 | mnringnmulrd.8 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑊) | |
| 13 | 4, 5, 6, 7, 8, 9, 10, 11, 12 | mnringvald 44965 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉)) |
| 14 | 13 | fveq2d 6885 | . 2 ⊢ (𝜑 → (𝐸‘𝐹) = (𝐸‘(𝑉 sSet 〈(.r‘ndx), (𝑥 ∈ (Base‘𝑉), 𝑦 ∈ (Base‘𝑉) ↦ (𝑉 Σg (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 ↦ (𝑖 ∈ 𝐴 ↦ if(𝑖 = (𝑎(+g‘𝑀)𝑏), ((𝑥‘𝑎)(.r‘𝑅)(𝑦‘𝑏)), (0g‘𝑅))))))〉))) |
| 15 | 3, 14 | eqtr4id 2816 | 1 ⊢ (𝜑 → (𝐸‘𝑉) = (𝐸‘𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ifcif 4486 〈cop 4594 ↦ cmpt 5191 ‘cfv 6536 (class class class)co 7412 ∈ cmpo 7414 sSet csts 17229 Slot cslot 17247 ndxcnx 17259 Basecbs 17275 +gcplusg 17316 .rcmulr 17317 0gc0g 17498 Σg cgsu 17499 freeLMod cfrlm 21907 MndRing cmnring 44963 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-res 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-sets 17230 df-slot 17248 df-mnring 44964 |
| This theorem is used by: mnringbased 44967 mnringaddgd 44972 mnringscad 44976 mnringvscad 44977 |
| Copyright terms: Public domain | W3C validator |