| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > matsca | Structured version Visualization version GIF version | ||
| Description: The matrix ring has the same scalars as its underlying linear structure. (Contributed by Stefan O'Rear, 4-Sep-2015.) (Proof shortened by AV, 12-Nov-2024.) |
| Ref | Expression |
|---|---|
| matbas.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| matbas.g | ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁)) |
| Ref | Expression |
|---|---|
| matsca | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (Scalar‘𝐺) = (Scalar‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scaid 17392 | . . 3 ⊢ Scalar = Slot (Scalar‘ndx) | |
| 2 | scandxnmulrndx 17395 | . . 3 ⊢ (Scalar‘ndx) ≠ (.r‘ndx) | |
| 3 | 1, 2 | setsnid 17292 | . 2 ⊢ (Scalar‘𝐺) = (Scalar‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
| 4 | matbas.a | . . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 5 | matbas.g | . . . 4 ⊢ 𝐺 = (𝑅 freeLMod (𝑁 × 𝑁)) | |
| 6 | eqid 2765 | . . . 4 ⊢ (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) = (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉) | |
| 7 | 4, 5, 6 | matval 22620 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐴 = (𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉)) |
| 8 | 7 | fveq2d 6889 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (Scalar‘𝐴) = (Scalar‘(𝐺 sSet 〈(.r‘ndx), (𝑅 maMul 〈𝑁, 𝑁, 𝑁〉)〉))) |
| 9 | 3, 8 | eqtr4id 2819 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (Scalar‘𝐺) = (Scalar‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 〈cop 4597 〈cotp 4599 × cxp 5661 ‘cfv 6540 (class class class)co 7419 Fincfn 8949 sSet csts 17247 ndxcnx 17277 .rcmulr 17335 Scalarcsca 17337 freeLMod cfrlm 21948 maMul cmmul 22599 Mat cmat 22616 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-ot 4600 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-sets 17248 df-slot 17266 df-ndx 17278 df-mulr 17348 df-sca 17350 df-mat 22617 |
| This theorem is used by: matsca2 22629 matlmod 22638 matdim 34071 |
| Copyright terms: Public domain | W3C validator |