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 21484 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ✚ 𝑌) = (𝑋 ∘f + 𝑌)) |
6 | 5 | oveqd 7272 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐼(𝑋 ✚ 𝑌)𝐽) = (𝐼(𝑋 ∘f + 𝑌)𝐽)) |
7 | 6 | adantr 480 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ✚ 𝑌)𝐽) = (𝐼(𝑋 ∘f + 𝑌)𝐽)) |
8 | df-ov 7258 | . . 3 ⊢ (𝐼(𝑋 ∘f + 𝑌)𝐽) = ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) | |
9 | 8 | a1i 11 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ∘f + 𝑌)𝐽) = ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉)) |
10 | opelxp 5616 | . . 3 ⊢ (〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁) ↔ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) | |
11 | eqid 2738 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
12 | 1, 11, 2 | matbas2i 21479 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁))) |
13 | elmapfn 8611 | . . . . . 6 ⊢ (𝑋 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁)) → 𝑋 Fn (𝑁 × 𝑁)) | |
14 | 12, 13 | syl 17 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑋 Fn (𝑁 × 𝑁)) |
15 | 14 | adantr 480 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 Fn (𝑁 × 𝑁)) |
16 | 1, 11, 2 | matbas2i 21479 | . . . . . 6 ⊢ (𝑌 ∈ 𝐵 → 𝑌 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁))) |
17 | elmapfn 8611 | . . . . . 6 ⊢ (𝑌 ∈ ((Base‘𝑅) ↑m (𝑁 × 𝑁)) → 𝑌 Fn (𝑁 × 𝑁)) | |
18 | 16, 17 | syl 17 | . . . . 5 ⊢ (𝑌 ∈ 𝐵 → 𝑌 Fn (𝑁 × 𝑁)) |
19 | 18 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 Fn (𝑁 × 𝑁)) |
20 | 1, 2 | matrcl 21469 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
21 | xpfi 9015 | . . . . . . . 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 4149 | . . . 4 ⊢ ((𝑁 × 𝑁) ∩ (𝑁 × 𝑁)) = (𝑁 × 𝑁) | |
27 | df-ov 7258 | . . . . . 6 ⊢ (𝐼𝑋𝐽) = (𝑋‘〈𝐼, 𝐽〉) | |
28 | 27 | eqcomi 2747 | . . . . 5 ⊢ (𝑋‘〈𝐼, 𝐽〉) = (𝐼𝑋𝐽) |
29 | 28 | a1i 11 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → (𝑋‘〈𝐼, 𝐽〉) = (𝐼𝑋𝐽)) |
30 | df-ov 7258 | . . . . . 6 ⊢ (𝐼𝑌𝐽) = (𝑌‘〈𝐼, 𝐽〉) | |
31 | 30 | eqcomi 2747 | . . . . 5 ⊢ (𝑌‘〈𝐼, 𝐽〉) = (𝐼𝑌𝐽) |
32 | 31 | a1i 11 | . . . 4 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → (𝑌‘〈𝐼, 𝐽〉) = (𝐼𝑌𝐽)) |
33 | 15, 19, 25, 25, 26, 29, 32 | ofval 7522 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 〈𝐼, 𝐽〉 ∈ (𝑁 × 𝑁)) → ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
34 | 10, 33 | sylan2br 594 | . 2 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → ((𝑋 ∘f + 𝑌)‘〈𝐼, 𝐽〉) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
35 | 7, 9, 34 | 3eqtrd 2782 | 1 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝐼 ∈ 𝑁 ∧ 𝐽 ∈ 𝑁)) → (𝐼(𝑋 ✚ 𝑌)𝐽) = ((𝐼𝑋𝐽) + (𝐼𝑌𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 〈cop 4564 × cxp 5578 Fn wfn 6413 ‘cfv 6418 (class class class)co 7255 ∘f cof 7509 ↑m cmap 8573 Fincfn 8691 Basecbs 16840 +gcplusg 16888 Mat cmat 21464 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-ot 4567 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-sca 16904 df-vsca 16905 df-ip 16906 df-tset 16907 df-ple 16908 df-ds 16910 df-hom 16912 df-cco 16913 df-0g 17069 df-prds 17075 df-pws 17077 df-sra 20349 df-rgmod 20350 df-dsmm 20849 df-frlm 20864 df-mat 21465 |
This theorem is referenced by: mat1ghm 21540 cpmatacl 21773 mat2pmatghm 21787 pm2mpghm 21873 |
Copyright terms: Public domain | W3C validator |