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 | matbas.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | matbas.g | . . . 4 ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁)) | |
3 | eqid 2824 | . . . 4 ⊢ (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) = (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) | |
4 | 1, 2, 3 | matval 21023 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐴 = (𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
5 | 4 | fveq2d 6677 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (+g‘𝐴) = (+g‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉))) |
6 | plusgid 16599 | . . 3 ⊢ +g = Slot (+g‘ndx) | |
7 | plusgndxnmulrndx 16620 | . . 3 ⊢ (+g‘ndx) ≠ (.r‘ndx) | |
8 | 6, 7 | setsnid 16542 | . 2 ⊢ (+g‘𝐺) = (+g‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
9 | 5, 8 | syl6reqr 2878 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (+g‘𝐺) = (+g‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 〈cop 4576 〈cotp 4578 × cxp 5556 ‘cfv 6358 (class class class)co 7159 Fincfn 8512 ndxcnx 16483 sSet csts 16484 +gcplusg 16568 .rcmulr 16569 freeLMod cfrlm 20893 maMul cmmul 20997 Mat cmat 21019 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-ot 4579 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-3 11704 df-ndx 16489 df-slot 16490 df-sets 16493 df-plusg 16581 df-mulr 16582 df-mat 21020 |
This theorem is referenced by: mat0 21029 matinvg 21030 matplusg2 21039 matlmod 21041 matsubg 21044 matgsum 21049 matdim 31017 |
Copyright terms: Public domain | W3C validator |