| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > matplusgcell | Structured version Visualization version GIF version | ||
| Description: Addition in the matrix ring is cell-wise. (Contributed by AV, 2-Aug-2019.) |
| Ref | Expression |
|---|---|
| matplusgcell.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| matplusgcell.b | ⊢ 𝐵 = (Base‘𝐴) |
| matplusgcell.p | ⊢ ✚ = (+g‘𝐴) |
| matplusgcell.q | ⊢ + = (+g‘𝑅) |
| Ref | Expression |
|---|---|
| matplusgcell | ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ✚ 𝑌)𝐽) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | matplusgcell.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 2 | matplusgcell.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐴) | |
| 3 | matplusgcell.p | . . . . 5 ⊢ ✚ = (+g‘𝐴) | |
| 4 | matplusgcell.q | . . . . 5 ⊢ + = (+g‘𝑅) | |
| 5 | 1, 2, 3, 4 | matplusg2 22392 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ✚ 𝑌) = (𝑋 ∘f + 𝑌)) |
| 6 | 5 | oveqd 7384 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐼(𝑋 ✚ 𝑌)𝐽) = (𝐼(𝑋 ∘f + 𝑌)𝐽)) |
| 7 | 6 | adantr 480 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ✚ 𝑌)𝐽) = (𝐼(𝑋 ∘f + 𝑌)𝐽)) |
| 8 | df-ov 7370 | . . 3 ⊢ (𝐼(𝑋 ∘f + 𝑌)𝐽) = ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) | |
| 9 | 8 | a1i 11 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ∘f + 𝑌)𝐽) = ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉)) |
| 10 | opelxp 5667 | . . 3 ⊢ (〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁) ↔ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) | |
| 11 | eqid 2736 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 12 | 1, 11, 2 | matbas2i 22387 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁))) |
| 13 | elmapfn 8812 | . . . . . 6 ⊢ (𝑋 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁)) → 𝑋 Fn (𝑁 × 𝑁)) | |
| 14 | 12, 13 | syl 17 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑋 Fn (𝑁 × 𝑁)) |
| 15 | 14 | adantr 480 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 Fn (𝑁 × 𝑁)) |
| 16 | 1, 11, 2 | matbas2i 22387 | . . . . . 6 ⊢ (𝑌 ∈ 𝐵 → 𝑌 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁))) |
| 17 | elmapfn 8812 | . . . . . 6 ⊢ (𝑌 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁)) → 𝑌 Fn (𝑁 × 𝑁)) | |
| 18 | 16, 17 | syl 17 | . . . . 5 ⊢ (𝑌 ∈ 𝐵 → 𝑌 Fn (𝑁 × 𝑁)) |
| 19 | 18 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 Fn (𝑁 × 𝑁)) |
| 20 | 1, 2 | matrcl 22377 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 21 | xpfi 9230 | . . . . . . . 8 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin) | |
| 22 | 21 | anidms 566 | . . . . . . 7 ⊢ (𝑁 ∈ Fin → (𝑁 × 𝑁) ∈ Fin) |
| 23 | 22 | adantr 480 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (𝑁 × 𝑁) ∈ Fin) |
| 24 | 20, 23 | syl 17 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → (𝑁 × 𝑁) ∈ Fin) |
| 25 | 24 | adantr 480 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁 × 𝑁) ∈ Fin) |
| 26 | inidm 4167 | . . . 4 ⊢ ((𝑁 × 𝑁) ∩ (𝑁 × 𝑁)) = (𝑁 × 𝑁) | |
| 27 | df-ov 7370 | . . . . . 6 ⊢ (𝐼𝑋𝐽) = (𝑋‘〈𝐼, 𝐽〉) | |
| 28 | 27 | eqcomi 2745 | . . . . 5 ⊢ (𝑋‘〈𝐼, 𝐽〉) = (𝐼𝑋𝐽) |
| 29 | 28 | a1i 11 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → (𝑋‘〈𝐼, 𝐽〉) = (𝐼𝑋𝐽)) |
| 30 | df-ov 7370 | . . . . . 6 ⊢ (𝐼𝑌𝐽) = (𝑌‘〈𝐼, 𝐽〉) | |
| 31 | 30 | eqcomi 2745 | . . . . 5 ⊢ (𝑌‘〈𝐼, 𝐽〉) = (𝐼𝑌𝐽) |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → (𝑌‘〈𝐼, 𝐽〉) = (𝐼𝑌𝐽)) |
| 33 | 15, 19, 25, 25, 26, 29, 32 | ofval 7642 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
| 34 | 10, 33 | sylan2br 596 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
| 35 | 7, 9, 34 | 3eqtrd 2775 | 1 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ✚ 𝑌)𝐽) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3429 〈cop 4573 × cxp 5629 Fn wfn 6493 ‘cfv 6498 (class class class)co 7367 ∘f cof 7629 ↑m cmap 8773 Fincfn 8893 Basecbs 17179 +gcplusg 17220 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-rep 5212 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-tp 4572 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-of 7631 df-om 7818 df-1st 7942 df-2nd 7943 df-supp 8111 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fsupp 9275 df-sup 9355 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-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-0g 17404 df-prds 17410 df-pws 17412 df-sra 21168 df-rgmod 21169 df-dsmm 21712 df-frlm 21727 df-mat 22373 |
| This theorem is referenced by: mat1ghm 22448 cpmatacl 22681 mat2pmatghm 22695 pm2mpghm 22781 |
| Copyright terms: Public domain | W3C validator |