| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > matplusg | Structured version Visualization version GIF version | ||
| Description: The matrix ring has the same addition as its underlying group. (Contributed by Stefan O'Rear, 4-Sep-2015.) |
| Ref | Expression |
|---|---|
| matbas.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| matbas.g | ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁)) |
| Ref | Expression |
|---|---|
| matplusg | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (+g‘𝐺) = (+g‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | plusgid 17247 | . . 3 ⊢ +g = Slot (+g‘ndx) | |
| 2 | plusgndxnmulrndx 17260 | . . 3 ⊢ (+g‘ndx) ≠ (.r‘ndx) | |
| 3 | 1, 2 | setsnid 17178 | . 2 ⊢ (+g‘𝐺) = (+g‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
| 4 | matbas.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 5 | matbas.g | . . . 4 ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁)) | |
| 6 | eqid 2736 | . . . 4 ⊢ (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) = (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) | |
| 7 | 4, 5, 6 | matval 22376 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐴 = (𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
| 8 | 7 | fveq2d 6844 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (+g‘𝐴) = (+g‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉))) |
| 9 | 3, 8 | eqtr4id 2790 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (+g‘𝐺) = (+g‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4573 〈cotp 4575 × cxp 5629 ‘cfv 6498 (class class class)co 7367 Fincfn 8893 sSet csts 17133 ndxcnx 17163 +gcplusg 17220 .rcmulr 17221 freeLMod cfrlm 21726 maMul cmmul 22355 Mat cmat 22372 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-ot 4576 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-sets 17134 df-slot 17152 df-ndx 17164 df-plusg 17233 df-mulr 17234 df-mat 22373 |
| This theorem is referenced by: mat0 22382 matinvg 22383 matplusg2 22392 matlmod 22394 matsubg 22397 matgsum 22402 matdim 33759 |
| Copyright terms: Public domain | W3C validator |