Theorem scmatval 22698

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.

Step	Hyp	Ref	Expression
1		scmatval.s	. 2 ⊢ 𝑆 = (𝑁 ScMat 𝑅)
2		df-scmat 22685	. . . 4 ⊢ ScMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ ⦋(𝑛 Mat 𝑟) / 𝑎⦌{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))})
3	2	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → ScMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ ⦋(𝑛 Mat 𝑟) / 𝑎⦌{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))}))
4		ovexd 7458	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → (𝑛 Mat 𝑟) ∈ V)
5		fveq2 6888	. . . . . . 7 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (Base‘𝑎) = (Base‘(𝑛 Mat 𝑟)))
6		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑎 = (𝑛 Mat 𝑟) → ( ·𝑠 ‘𝑎) = ( ·𝑠 ‘(𝑛 Mat 𝑟)))
7		eqidd 2767	. . . . . . . . . 10 ⊢ (𝑎 = (𝑛 Mat 𝑟) → 𝑐 = 𝑐)
8		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (1r‘𝑎) = (1r‘(𝑛 Mat 𝑟)))
9	6, 7, 8	oveq123d 7444	. . . . . . . . 9 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎)) = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))))
10	9	eqeq2d 2777	. . . . . . . 8 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎)) ↔ 𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))))
11	10	rexbidv 3192	. . . . . . 7 ⊢ (𝑎 = (𝑛 Mat 𝑟) → (∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎)) ↔ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))))
12	5, 11	rabeqbidv 3437	. . . . . 6 ⊢ (𝑎 = (𝑛 Mat 𝑟) → {𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
13	12	adantl 487	. . . . 5 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) ∧ 𝑎 = (𝑛 Mat 𝑟)) → {𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
14	4, 13	csbied 3892	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → ⦋(𝑛 Mat 𝑟) / 𝑎⦌{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))} = {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))})
15		oveq12 7432	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
16	15	fveq2d 6892	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘(𝑁 Mat 𝑅)))
17		scmatval.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐴)
18		scmatval.a	. . . . . . . . 9 ⊢ 𝐴 = (𝑁 Mat 𝑅)
19	18	fveq2i 6891	. . . . . . . 8 ⊢ (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
20	17, 19	eqtri 2789	. . . . . . 7 ⊢ 𝐵 = (Base‘(𝑁 Mat 𝑅))
21	16, 20	eqtr4di 2819	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
22		fveq2 6888	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
23		scmatval.k	. . . . . . . . 9 ⊢ 𝐾 = (Base‘𝑅)
24	22, 23	eqtr4di 2819	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐾)
25	24	adantl 487	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘𝑟) = 𝐾)
26	15	fveq2d 6892	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ( ·𝑠 ‘(𝑛 Mat 𝑟)) = ( ·𝑠 ‘(𝑁 Mat 𝑅)))
27		scmatval.t	. . . . . . . . . . 11 ⊢ · = ( ·𝑠 ‘𝐴)
28	18	fveq2i 6891	. . . . . . . . . . 11 ⊢ ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘(𝑁 Mat 𝑅))
29	27, 28	eqtri 2789	. . . . . . . . . 10 ⊢ · = ( ·𝑠 ‘(𝑁 Mat 𝑅))
30	26, 29	eqtr4di 2819	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ( ·𝑠 ‘(𝑛 Mat 𝑟)) = · )
31		eqidd 2767	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑐 = 𝑐)
32	15	fveq2d 6892	. . . . . . . . . 10 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (1r‘(𝑛 Mat 𝑟)) = (1r‘(𝑁 Mat 𝑅)))
33		scmatval.1	. . . . . . . . . . 11 ⊢ 1 = (1r‘𝐴)
34	18	fveq2i 6891	. . . . . . . . . . 11 ⊢ (1r‘𝐴) = (1r‘(𝑁 Mat 𝑅))
35	33, 34	eqtri 2789	. . . . . . . . . 10 ⊢ 1 = (1r‘(𝑁 Mat 𝑅))
36	32, 35	eqtr4di 2819	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (1r‘(𝑛 Mat 𝑟)) = 1 )
37	30, 31, 36	oveq123d 7444	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) = (𝑐 · 1 ))
38	37	eqeq2d 2777	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) ↔ 𝑚 = (𝑐 · 1 )))
39	25, 38	rexeqbidv 3342	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟))) ↔ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )))
40	21, 39	rabeqbidv 3437	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))} = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )})
41	40	adantl 487	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘(𝑛 Mat 𝑟))(1r‘(𝑛 Mat 𝑟)))} = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )})
42	14, 41	eqtrd 2801	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → ⦋(𝑛 Mat 𝑟) / 𝑎⦌{𝑚 ∈ (Base‘𝑎) ∣ ∃𝑐 ∈ (Base‘𝑟)𝑚 = (𝑐( ·𝑠 ‘𝑎)(1r‘𝑎))} = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )})
43		simpl 488	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ Fin)
44		elex 3479	. . . 4 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
45	44	adantl 487	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ V)
46	17	fvexi 6902	. . . . 5 ⊢ 𝐵 ∈ V
47	46	rabex 5314	. . . 4 ⊢ {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )} ∈ V
48	47	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )} ∈ V)
49	3, 42, 43, 45, 48	ovmpod 7575	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑁 ScMat 𝑅) = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )})
50	1, 49	eqtrid 2813	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∃𝑐 ∈ 𝐾 𝑚 = (𝑐 · 1 )})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  {crab 3419  Vcvv 3458  ⦋csb 3856  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425  Fincfn 8952  Basecbs 17294   ·_𝑠 cvsca 17339  1_rcur 20294   Mat cmat 22601   ScMat cscmat 22683

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-scmat 22685

This theorem is used by:  scmatel  22699  scmatmats  22705  scmatlss  22719