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

Theorem dmatval 22379
Description: The set of 𝑁 x 𝑁 diagonal matrices over (a ring) 𝑅. (Contributed by AV, 8-Dec-2019.)
Hypotheses
Ref Expression
dmatval.a 𝐴 = (𝑁 Mat 𝑅)
dmatval.b 𝐵 = (Base‘𝐴)
dmatval.0 0 = (0g𝑅)
dmatval.d 𝐷 = (𝑁 DMat 𝑅)
Assertion
Ref Expression
dmatval ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐷 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑚   𝑅,𝑖,𝑗,𝑚
Allowed substitution hints:   𝐴(𝑖,𝑗,𝑚)   𝐵(𝑖,𝑗)   𝐷(𝑖,𝑗,𝑚)   𝑉(𝑖,𝑗,𝑚)   0 (𝑖,𝑗,𝑚)

Proof of Theorem dmatval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmatval.d . 2 𝐷 = (𝑁 DMat 𝑅)
2 df-dmat 22377 . . . 4 DMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))})
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → DMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))}))
4 oveq12 7396 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
54fveq2d 6862 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
6 dmatval.b . . . . . . 7 𝐵 = (Base‘𝐴)
7 dmatval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
87fveq2i 6861 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
96, 8eqtri 2752 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
105, 9eqtr4di 2782 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
11 simpl 482 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
12 fveq2 6858 . . . . . . . . . . 11 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
13 dmatval.0 . . . . . . . . . . 11 0 = (0g𝑅)
1412, 13eqtr4di 2782 . . . . . . . . . 10 (𝑟 = 𝑅 → (0g𝑟) = 0 )
1514adantl 481 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → (0g𝑟) = 0 )
1615eqeq2d 2740 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → ((𝑖𝑚𝑗) = (0g𝑟) ↔ (𝑖𝑚𝑗) = 0 ))
1716imbi2d 340 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → ((𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
1811, 17raleqbidv 3319 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ ∀𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
1911, 18raleqbidv 3319 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
2010, 19rabeqbidv 3424 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
2120adantl 481 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
22 simpl 482 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
23 elex 3468 . . . 4 (𝑅𝑉𝑅 ∈ V)
2423adantl 481 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
256fvexi 6872 . . . 4 𝐵 ∈ V
26 rabexg 5292 . . . 4 (𝐵 ∈ V → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )} ∈ V)
2725, 26mp1i 13 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )} ∈ V)
283, 21, 22, 24, 27ovmpod 7541 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 DMat 𝑅) = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
291, 28eqtrid 2776 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐷 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wne 2925  wral 3044  {crab 3405  Vcvv 3447  cfv 6511  (class class class)co 7387  cmpo 7389  Fincfn 8918  Basecbs 17179  0gc0g 17402   Mat cmat 22294   DMat cdmat 22375
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-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-dmat 22377
This theorem is referenced by:  dmatel  22380  dmatmulcl  22387  scmatdmat  22402  dmatbas  48392
  Copyright terms: Public domain W3C validator