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

Theorem scmatel 22392
Description: An 𝑁 x 𝑁 scalar matrix 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
scmatel ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑀𝑆 ↔ (𝑀𝐵 ∧ ∃𝑐𝐾 𝑀 = (𝑐 · 1 ))))
Distinct variable groups:   𝐾,𝑐   𝑁,𝑐   𝑅,𝑐   𝑀,𝑐
Allowed substitution hints:   𝐴(𝑐)   𝐵(𝑐)   𝑆(𝑐)   · (𝑐)   1 (𝑐)   𝑉(𝑐)

Proof of Theorem scmatel
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 scmatval.k . . . 4 𝐾 = (Base‘𝑅)
2 scmatval.a . . . 4 𝐴 = (𝑁 Mat 𝑅)
3 scmatval.b . . . 4 𝐵 = (Base‘𝐴)
4 scmatval.1 . . . 4 1 = (1r𝐴)
5 scmatval.t . . . 4 · = ( ·𝑠𝐴)
6 scmatval.s . . . 4 𝑆 = (𝑁 ScMat 𝑅)
71, 2, 3, 4, 5, 6scmatval 22391 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑆 = {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )})
87eleq2d 2814 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑀𝑆𝑀 ∈ {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )}))
9 eqeq1 2733 . . . 4 (𝑚 = 𝑀 → (𝑚 = (𝑐 · 1 ) ↔ 𝑀 = (𝑐 · 1 )))
109rexbidv 3157 . . 3 (𝑚 = 𝑀 → (∃𝑐𝐾 𝑚 = (𝑐 · 1 ) ↔ ∃𝑐𝐾 𝑀 = (𝑐 · 1 )))
1110elrab 3659 . 2 (𝑀 ∈ {𝑚𝐵 ∣ ∃𝑐𝐾 𝑚 = (𝑐 · 1 )} ↔ (𝑀𝐵 ∧ ∃𝑐𝐾 𝑀 = (𝑐 · 1 )))
128, 11bitrdi 287 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑀𝑆 ↔ (𝑀𝐵 ∧ ∃𝑐𝐾 𝑀 = (𝑐 · 1 ))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wrex 3053  {crab 3405  cfv 6511  (class class class)co 7387  Fincfn 8918  Basecbs 17179   ·𝑠 cvsca 17224  1rcur 20090   Mat cmat 22294   ScMat cscmat 22376
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-scmat 22378
This theorem is referenced by:  scmatscmid  22393  scmatmat  22396  scmatid  22401  scmataddcl  22403  scmatsubcl  22404  scmatmulcl  22405  smatvscl  22411  scmatrhmcl  22415  mat0scmat  22425  mat1scmat  22426  chmaidscmat  22735
  Copyright terms: Public domain W3C validator