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

Theorem dmatval 22610
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 22608 . . . 4 DMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))})
32a1i 11 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → DMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))}))
4 oveq12 7409 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
54fveq2d 6875 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
6 dmatval.b . . . . . . 7 𝐵 = (Base‘𝐴)
7 dmatval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
87fveq2i 6874 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
96, 8eqtri 2788 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
105, 9eqtr4di 2818 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
11 simpl 487 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
12 fveq2 6871 . . . . . . . . . . 11 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
13 dmatval.0 . . . . . . . . . . 11 0 = (0g𝑅)
1412, 13eqtr4di 2818 . . . . . . . . . 10 (𝑟 = 𝑅 → (0g𝑟) = 0 )
1514adantl 486 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → (0g𝑟) = 0 )
1615eqeq2d 2776 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → ((𝑖𝑚𝑗) = (0g𝑟) ↔ (𝑖𝑚𝑗) = 0 ))
1716imbi2d 343 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → ((𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
1811, 17raleqbidv 3339 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ ∀𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
1911, 18raleqbidv 3339 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟)) ↔ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )))
2010, 19rabeqbidv 3435 . . . 4 ((𝑛 = 𝑁𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
2120adantl 486 . . 3 (((𝑁 ∈ Fin ∧ 𝑅𝑉) ∧ (𝑛 = 𝑁𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖𝑛𝑗𝑛 (𝑖𝑗 → (𝑖𝑚𝑗) = (0g𝑟))} = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
22 simpl 487 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑁 ∈ Fin)
23 elex 3478 . . . 4 (𝑅𝑉𝑅 ∈ V)
2423adantl 486 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝑅 ∈ V)
256fvexi 6885 . . . 4 𝐵 ∈ V
26 rabexg 5298 . . . 4 (𝐵 ∈ V → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )} ∈ V)
2725, 26mp1i 14 . . 3 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )} ∈ V)
283, 21, 22, 24, 27ovmpod 7552 . 2 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → (𝑁 DMat 𝑅) = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
291, 28eqtrid 2812 1 ((𝑁 ∈ Fin ∧ 𝑅𝑉) → 𝐷 = {𝑚𝐵 ∣ ∀𝑖𝑁𝑗𝑁 (𝑖𝑗 → (𝑖𝑚𝑗) = 0 )})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wne 2960  wral 3079  {crab 3417  Vcvv 3457  cfv 6525  (class class class)co 7400  cmpo 7402  Fincfn 8931  Basecbs 17259  0gc0g 17482   Mat cmat 22525   DMat cdmat 22606
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-dmat 22608
This theorem is referenced by:  dmatel  22611  dmatmulcl  22618  scmatdmat  22633  dmatbas  49034
  Copyright terms: Public domain W3C validator