Theorem cpmat 23020

Description: Value of the constructor of the set of all constant polynomial matrices, i.e. the set of all 𝑁 x 𝑁 matrices of polynomials over a ring 𝑅. (Contributed by AV, 15-Nov-2019.)

Hypotheses

Ref	Expression
cpmat.s	⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
cpmat.p	⊢ 𝑃 = (Poly1‘𝑅)
cpmat.c	⊢ 𝐶 = (𝑁 Mat 𝑃)
cpmat.b	⊢ 𝐵 = (Base‘𝐶)

Assertion

Ref	Expression
cpmat	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})

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

Allowed substitution hints:   𝐵(𝑖, 𝑗, 𝑘)   𝐶(𝑖, 𝑗, 𝑘, 𝑚)   𝑃(𝑖, 𝑗, 𝑘, 𝑚)   𝑆(𝑖, 𝑗, 𝑘, 𝑚)   𝑉(𝑖, 𝑗, 𝑘, 𝑚)

Proof of Theorem cpmat

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

Step	Hyp	Ref	Expression
1		cpmat.s	. 2 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
2		df-cpmat 23017	. . . 4 ⊢ ConstPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat (Poly1‘𝑟))) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟)})
3	2	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → ConstPolyMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ {𝑚 ∈ (Base‘(𝑛 Mat (Poly1‘𝑟))) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟)}))
4		simpl 488	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
5		fveq2 6883	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
6	5	adantl 487	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Poly1‘𝑟) = (Poly1‘𝑅))
7	4, 6	oveq12d 7436	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat (Poly1‘𝑟)) = (𝑁 Mat (Poly1‘𝑅)))
8	7	fveq2d 6887	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat (Poly1‘𝑟))) = (Base‘(𝑁 Mat (Poly1‘𝑅))))
9		cpmat.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐶)
10		cpmat.c	. . . . . . . . 9 ⊢ 𝐶 = (𝑁 Mat 𝑃)
11		cpmat.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
12	11	oveq2i 7429	. . . . . . . . 9 ⊢ (𝑁 Mat 𝑃) = (𝑁 Mat (Poly1‘𝑅))
13	10, 12	eqtri 2784	. . . . . . . 8 ⊢ 𝐶 = (𝑁 Mat (Poly1‘𝑅))
14	13	fveq2i 6886	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘(𝑁 Mat (Poly1‘𝑅)))
15	9, 14	eqtri 2784	. . . . . 6 ⊢ 𝐵 = (Base‘(𝑁 Mat (Poly1‘𝑅)))
16	8, 15	eqtr4di 2814	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat (Poly1‘𝑟))) = 𝐵)
17		fveq2 6883	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
18	17	adantl 487	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = (0g‘𝑅))
19	18	eqeq2d 2772	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟) ↔ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)))
20	19	ralbidv 3186	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟) ↔ ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)))
21	4, 20	raleqbidv 3335	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟) ↔ ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)))
22	4, 21	raleqbidv 3335	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)))
23	16, 22	rabeqbidv 3430	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → {𝑚 ∈ (Base‘(𝑛 Mat (Poly1‘𝑟))) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟)} = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})
24	23	adantl 487	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → {𝑚 ∈ (Base‘(𝑛 Mat (Poly1‘𝑟))) ∣ ∀𝑖 ∈ 𝑛 ∀𝑗 ∈ 𝑛 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑟)} = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})
25		simpl 488	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ Fin)
26		elex 3472	. . . 4 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
27	26	adantl 487	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ V)
28	9	fvexi 6897	. . . 4 ⊢ 𝐵 ∈ V
29		rabexg 5299	. . . 4 ⊢ (𝐵 ∈ V → {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)} ∈ V)
30	28, 29	mp1i 14	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)} ∈ V)
31	3, 24, 25, 27, 30	ovmpod 7570	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑁 ConstPolyMat 𝑅) = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})
32	1, 31	eqtrid 2808	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Fincfn 8966  ℕcn 12328  Basecbs 17380  0_gc0g 17603  Poly₁cpl1 22488  coe₁cco1 22489   Mat cmat 22715   ConstPolyMat ccpmat 23014

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-cpmat 23017

This theorem is used by:  cpmatpmat  23021  cpmatel  23022  cpmatsubgpmat  23031