Theorem dmatALTval 49605

Description: The algebra of 𝑁 x 𝑁 diagonal matrices over a ring 𝑅. (Contributed by AV, 8-Dec-2019.)

Hypotheses

Ref	Expression
dmatALTval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
dmatALTval.b	⊢ 𝐵 = (Base‘𝐴)
dmatALTval.0	⊢ 0 = (0g‘𝑅)
dmatALTval.d	⊢ 𝐷 = (𝑁 DMatALT 𝑅)

Assertion

Ref	Expression
dmatALTval	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → 𝐷 = (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}))

Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑚   𝑅,𝑖,𝑗,𝑚

Allowed substitution hints:   𝐴(𝑖, 𝑗, 𝑚)   𝐵(𝑖, 𝑗)   𝐷(𝑖, 𝑗, 𝑚)   0 (𝑖, 𝑗, 𝑚)

Proof of Theorem dmatALTval

Dummy variables 𝑛 𝑟 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmatALTval.d	. 2 ⊢ 𝐷 = (𝑁 DMatALT 𝑅)
2		ovexd 7455	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) ∈ V)
3		id 23	. . . . . . 7 ⊢ (𝑎 = (𝑛 Mat 𝑟) → 𝑎 = (𝑛 Mat 𝑟))
4		fveq2 6885	. . . . . . . 8 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (Base‘𝑎) = (Base‘(𝑛 Mat 𝑟)))
5	4	rabeqdv 3427	. . . . . . 7 ⊢ (𝑎 = (𝑛 Mat 𝑟) → {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))})
6	3, 5	oveq12d 7438	. . . . . 6 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (𝑎 ↾s {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}) = ((𝑛 Mat 𝑟) ↾s {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}))
7	6	adantl 487	. . . . 5 ⊢ (((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) ∧ 𝑎 = (𝑛 Mat 𝑟)) → (𝑎 ↾s {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}) = ((𝑛 Mat 𝑟) ↾s {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}))
8	2, 7	csbied 3882	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ⦋(𝑛 Mat 𝑟) / 𝑎⦌(𝑎 ↾s {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}) = ((𝑛 Mat 𝑟) ↾s {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}))
9		oveq12 7429	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
10		dmatALTval.a	. . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅)
11	9, 10	eqtr4di 2813	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
12	11	fveq2d 6889	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
13		dmatALTval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐴)
14	12, 13	eqtr4di 2813	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
15		simpl 488	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
16		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
17		dmatALTval.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝑅)
18	16, 17	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
19	18	adantl 487	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = 0 )
20	19	eqeq2d 2771	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((𝑖𝑚𝑗) = (0g‘𝑟) ↔ (𝑖𝑚𝑗) = 0 ))
21	20	imbi2d 343	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟)) ↔ (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )))
22	15, 21	raleqbidv 3334	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟)) ↔ ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )))
23	15, 22	raleqbidv 3334	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟)) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )))
24	14, 23	rabeqbidv 3429	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))} = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )})
25	11, 24	oveq12d 7438	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((𝑛 Mat 𝑟) ↾s {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}) = (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}))
26	8, 25	eqtrd 2795	. . 3 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ⦋(𝑛 Mat 𝑟) / 𝑎⦌(𝑎 ↾s {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}) = (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}))
27		df-dmatalt 49603	. . 3 ⊢ DMatALT = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ ⦋(𝑛 Mat 𝑟) / 𝑎⦌(𝑎 ↾s {𝑚 ∈ (Base‘𝑎) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = (0g‘𝑟))}))
28		ovex 7453	. . 3 ⊢ (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}) ∈ V
29	26, 27, 28	ovmpoa 7575	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (𝑁 DMatALT 𝑅) = (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}))
30	1, 29	eqtrid 2807	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → 𝐷 = (𝐴 ↾s {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖 ≠ 𝑗 → (𝑖𝑚𝑗) = 0 )}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  {crab 3412  Vcvv 3450  ⦋csb 3846  ‘cfv 6538  (class class class)co 7420  Fincfn 8976  Basecbs 17392   ↾_s cress 17413  0_gc0g 17615   Mat cmat 22727   DMatALT cdmatalt 49601

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-dmatalt 49603

This theorem is used by:  dmatALTbas  49606