Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > matrcl | Structured version Visualization version GIF version |
Description: Reverse closure for the matrix algebra. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
Ref | Expression |
---|---|
matrcl.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
matrcl.b | ⊢ 𝐵 = (Base‘𝐴) |
Ref | Expression |
---|---|
matrcl | ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0i 3879 | . 2 ⊢ (𝑋 ∈ 𝐵 → ¬ 𝐵 = ∅) | |
2 | matrcl.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
3 | df-mat 20033 | . . . . . 6 ⊢ Mat = (𝑎 ∈ Fin, 𝑏 ∈ V ↦ ((𝑏 freeLMod (𝑎 × 𝑎)) sSet 〈(.r‘ndx), (𝑏 maMul 〈𝑎, 𝑎, 𝑎〉)〉)) | |
4 | 3 | mpt2ndm0 6773 | . . . . 5 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (𝑁 Mat 𝑅) = ∅) |
5 | 2, 4 | syl5eq 2656 | . . . 4 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → 𝐴 = ∅) |
6 | 5 | fveq2d 6107 | . . 3 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (Base‘𝐴) = (Base‘∅)) |
7 | matrcl.b | . . 3 ⊢ 𝐵 = (Base‘𝐴) | |
8 | base0 15740 | . . 3 ⊢ ∅ = (Base‘∅) | |
9 | 6, 7, 8 | 3eqtr4g 2669 | . 2 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → 𝐵 = ∅) |
10 | 1, 9 | nsyl2 141 | 1 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∅c0 3874 〈cop 4131 〈cotp 4133 × cxp 5036 ‘cfv 5804 (class class class)co 6549 Fincfn 7841 ndxcnx 15692 sSet csts 15693 Basecbs 15695 .rcmulr 15769 freeLMod cfrlm 19909 maMul cmmul 20008 Mat cmat 20032 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-iota 5768 df-fun 5806 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-slot 15699 df-base 15700 df-mat 20033 |
This theorem is referenced by: matbas2i 20047 matecl 20050 matplusg2 20052 matvsca2 20053 matplusgcell 20058 matsubgcell 20059 matinvgcell 20060 matvscacell 20061 matmulcell 20070 mattposcl 20078 mattposvs 20080 mattposm 20084 matgsumcl 20085 madetsumid 20086 madetsmelbas 20089 madetsmelbas2 20090 marrepval0 20186 marrepval 20187 marrepcl 20189 marepvval0 20191 marepvval 20192 marepvcl 20194 ma1repveval 20196 mulmarep1gsum1 20198 mulmarep1gsum2 20199 submabas 20203 submaval0 20205 submaval 20206 mdetleib2 20213 mdetf 20220 mdetrlin 20227 mdetrsca 20228 mdetralt 20233 mdetmul 20248 maduval 20263 maducoeval2 20265 maduf 20266 madutpos 20267 madugsum 20268 madurid 20269 madulid 20270 minmar1val0 20272 minmar1val 20273 marep01ma 20285 smadiadetlem0 20286 smadiadetlem1a 20288 smadiadetlem3 20293 smadiadetlem4 20294 smadiadet 20295 smadiadetglem2 20297 matinv 20302 matunit 20303 slesolvec 20304 slesolinv 20305 slesolinvbi 20306 slesolex 20307 cramerimplem2 20309 cramerimplem3 20310 cramerimp 20311 decpmatcl 20391 decpmataa0 20392 decpmatmul 20396 smatcl 29196 matunitlindflem2 32576 matunitlindf 32577 |
Copyright terms: Public domain | W3C validator |