MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  scmatval Structured version   Visualization version   GIF version

Theorem scmatval 21099
Description: The set of 𝑁 x 𝑁 scalar matrices over (a ring) 𝑅. (Contributed by AV, 18-Dec-2019.)
Hypotheses
Ref Expression
scmatval.k 𝐾 = (Base‘𝑅)
scmatval.a 𝐴 = (𝑁 Mat 𝑅)
scmatval.b 𝐵 = (Base‘𝐴)
scmatval.1 1 = (1r𝐴)
scmatval.t · = ( ·𝑠𝐴)
scmatval.s 𝑆 = (𝑁 ScMat 𝑅)
Assertion
Ref Expression
scmatval ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
Distinct variable groups:   𝐵,𝑚   𝐾,𝑐   𝑁,𝑐,𝑚   𝑅,𝑐,𝑚
Allowed substitution hints:   𝐴(𝑚,𝑐)   𝐵(𝑐)   𝑆(𝑚,𝑐)   · (𝑚,𝑐)   1 (𝑚,𝑐)   𝐾(𝑚)   𝑉(𝑚,𝑐)

Proof of Theorem scmatval
Dummy variables 𝑛 𝑟 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 scmatval.s . 2 𝑆 = (𝑁 ScMat 𝑅)
2 df-scmat 21086 . . . 4 ScMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑛 Mat 𝑟) / 𝑎{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))})
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → ScMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑛 Mat 𝑟) / 𝑎{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))}))
4 ovexd 7173 . . . . 5 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑛 Mat 𝑟) ∈ V)
5 fveq2 6651 . . . . . . 7 (𝑎 = (𝑛 Mat 𝑟) → (Base‘𝑎) = (Base‘(𝑛 Mat 𝑟)))
6 fveq2 6651 . . . . . . . . . 10 (𝑎 = (𝑛 Mat 𝑟) → ( ·𝑠𝑎) = ( ·𝑠 ‘(𝑛 Mat 𝑟)))
7 eqidd 2825 . . . . . . . . . 10 (𝑎 = (𝑛 Mat 𝑟) → 𝑐 = 𝑐)
8 fveq2 6651 . . . . . . . . . 10 (𝑎 = (𝑛 Mat 𝑟) → (1r𝑎) = (1r‘(𝑛 Mat 𝑟)))
96, 7, 8oveq123d 7159 . . . . . . . . 9 (𝑎 = (𝑛 Mat 𝑟) → (𝑐( ·𝑠𝑎)(1r𝑎)) = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))))
109eqeq2d 2835 . . . . . . . 8 (𝑎 = (𝑛 Mat 𝑟) → (𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎)) ↔ 𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))))
1110rexbidv 3289 . . . . . . 7 (𝑎 = (𝑛 Mat 𝑟) → (∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎)) ↔ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))))
125, 11rabeqbidv 3470 . . . . . 6 (𝑎 = (𝑛 Mat 𝑟) → {𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
1312adantl 485 . . . . 5 ((((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) ∧ 𝑎 = (𝑛 Mat 𝑟)) → {𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
144, 13csbied 3901 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑛 Mat 𝑟) / 𝑎{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
15 oveq12 7147 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
1615fveq2d 6655 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
17 scmatval.b . . . . . . . 8 𝐵 = (Base‘𝐴)
18 scmatval.a . . . . . . . . 9 𝐴 = (𝑁 Mat 𝑅)
1918fveq2i 6654 . . . . . . . 8 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
2017, 19eqtri 2847 . . . . . . 7 𝐵 = (Base‘(𝑁 Mat 𝑅))
2116, 20syl6eqr 2877 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
22 fveq2 6651 . . . . . . . . 9 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
23 scmatval.k . . . . . . . . 9 𝐾 = (Base‘𝑅)
2422, 23syl6eqr 2877 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐾)
2524adantl 485 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘𝑟) = 𝐾)
2615fveq2d 6655 . . . . . . . . . 10 ((𝑛 = 𝑁𝑟 = 𝑅) → ( ·𝑠 ‘(𝑛 Mat 𝑟)) = ( ·𝑠 ‘(𝑁 Mat 𝑅)))
27 scmatval.t . . . . . . . . . . 11 · = ( ·𝑠𝐴)
2818fveq2i 6654 . . . . . . . . . . 11 ( ·𝑠𝐴) = ( ·𝑠 ‘(𝑁 Mat 𝑅))
2927, 28eqtri 2847 . . . . . . . . . 10 · = ( ·𝑠 ‘(𝑁 Mat 𝑅))
3026, 29syl6eqr 2877 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → ( ·𝑠 ‘(𝑛 Mat 𝑟)) = · )
31 eqidd 2825 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑐 = 𝑐)
3215fveq2d 6655 . . . . . . . . . 10 ((𝑛 = 𝑁𝑟 = 𝑅) → (1r‘(𝑛 Mat 𝑟)) = (1r‘(𝑁 Mat 𝑅)))
33 scmatval.1 . . . . . . . . . . 11 1 = (1r𝐴)
3418fveq2i 6654 . . . . . . . . . . 11 (1r𝐴) = (1r‘(𝑁 Mat 𝑅))
3533, 34eqtri 2847 . . . . . . . . . 10 1 = (1r‘(𝑁 Mat 𝑅))
3632, 35syl6eqr 2877 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → (1r‘(𝑛 Mat 𝑟)) = 1 )
3730, 31, 36oveq123d 7159 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) = (𝑐 · 1 ))
3837eqeq2d 2835 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) ↔ 𝑚 = (𝑐 · 1 )))
3925, 38rexeqbidv 3393 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) ↔ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )))
4021, 39rabeqbidv 3470 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))} = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
4140adantl 485 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))} = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
4214, 41eqtrd 2859 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → (𝑛 Mat 𝑟) / 𝑎{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠𝑎)(1r𝑎))} = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
43 simpl 486 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
44 elex 3497 . . . 4 (𝑅𝑉𝑅 ∈ V)
4544adantl 485 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
4617fvexi 6665 . . . . 5 𝐵 ∈ V
4746rabex 5216 . . . 4 {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )} ∈ V
4847a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )} ∈ V)
493, 42, 43, 45, 48ovmpod 7284 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 ScMat 𝑅) = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
501, 49syl5eq 2871 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2115  wrex 3133  {crab 3136  Vcvv 3479  csb 3865  cfv 6336  (class class class)co 7138  cmpo 7140  Fincfn 8492  Basecbs 16472   ·𝑠 cvsca 16558  1rcur 19240   Mat cmat 21002   ScMat cscmat 21084
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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5184  ax-nul 5191  ax-pr 5311
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3137  df-rex 3138  df-rab 3141  df-v 3481  df-sbc 3758  df-csb 3866  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-br 5048  df-opab 5110  df-id 5441  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-iota 6295  df-fun 6338  df-fv 6344  df-ov 7141  df-oprab 7142  df-mpo 7143  df-scmat 21086
This theorem is referenced by:  scmatel  21100  scmatmats  21106  scmatlss  21120
  Copyright terms: Public domain W3C validator