Theorem decpmatval0 22973

Description: The matrix consisting of the coefficients in the polynomial entries of a polynomial matrix for the same power, most general version. (Contributed by AV, 2-Dec-2019.)

Assertion

Ref	Expression
decpmatval0	⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (𝑀 decompPMat 𝐾) = (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)))

Distinct variable groups:   𝑖,𝐾,𝑗   𝑖,𝑀,𝑗

Allowed substitution hints:   𝑉(𝑖, 𝑗)

Proof of Theorem decpmatval0

Dummy variables 𝑘 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-decpmat 22972	. . 3 ⊢ decompPMat = (𝑚 ∈ V, 𝑘 ∈ ℕ0 ↦ (𝑖 ∈ dom dom 𝑚, 𝑗 ∈ dom dom 𝑚 ↦ ((coe1‘(𝑖𝑚𝑗))‘𝑘)))
2	1	a1i 11	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → decompPMat = (𝑚 ∈ V, 𝑘 ∈ ℕ0 ↦ (𝑖 ∈ dom dom 𝑚, 𝑗 ∈ dom dom 𝑚 ↦ ((coe1‘(𝑖𝑚𝑗))‘𝑘))))
3		dmeq 5895	. . . . . 6 ⊢ (𝑚 = 𝑀 → dom 𝑚 = dom 𝑀)
4	3	adantr 486	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → dom 𝑚 = dom 𝑀)
5	4	dmeqd 5897	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → dom dom 𝑚 = dom dom 𝑀)
6		oveq 7425	. . . . . . 7 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗))
7	6	fveq2d 6889	. . . . . 6 ⊢ (𝑚 = 𝑀 → (coe1‘(𝑖𝑚𝑗)) = (coe1‘(𝑖𝑀𝑗)))
8	7	adantr 486	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → (coe1‘(𝑖𝑚𝑗)) = (coe1‘(𝑖𝑀𝑗)))
9		simpr 490	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → 𝑘 = 𝐾)
10	8, 9	fveq12d 6892	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → ((coe1‘(𝑖𝑚𝑗))‘𝑘) = ((coe1‘(𝑖𝑀𝑗))‘𝐾))
11	5, 5, 10	mpoeq123dv 7494	. . 3 ⊢ ((𝑚 = 𝑀 ∧ 𝑘 = 𝐾) → (𝑖 ∈ dom dom 𝑚, 𝑗 ∈ dom dom 𝑚 ↦ ((coe1‘(𝑖𝑚𝑗))‘𝑘)) = (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)))
12	11	adantl 487	. 2 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) ∧ (𝑚 = 𝑀 ∧ 𝑘 = 𝐾)) → (𝑖 ∈ dom dom 𝑚, 𝑗 ∈ dom dom 𝑚 ↦ ((coe1‘(𝑖𝑚𝑗))‘𝑘)) = (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)))
13		elex 3478	. . 3 ⊢ (𝑀 ∈ 𝑉 → 𝑀 ∈ V)
14	13	adantr 486	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → 𝑀 ∈ V)
15		simpr 490	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → 𝐾 ∈ ℕ0)
16		dmexg 7904	. . . . . 6 ⊢ (𝑀 ∈ 𝑉 → dom 𝑀 ∈ V)
17	16	dmexd 7906	. . . . 5 ⊢ (𝑀 ∈ 𝑉 → dom dom 𝑀 ∈ V)
18	17, 17	jca 521	. . . 4 ⊢ (𝑀 ∈ 𝑉 → (dom dom 𝑀 ∈ V ∧ dom dom 𝑀 ∈ V))
19	18	adantr 486	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (dom dom 𝑀 ∈ V ∧ dom dom 𝑀 ∈ V))
20		mpoexga 8080	. . 3 ⊢ ((dom dom 𝑀 ∈ V ∧ dom dom 𝑀 ∈ V) → (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)) ∈ V)
21	19, 20	syl 18	. 2 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)) ∈ V)
22	2, 12, 14, 15, 21	ovmpod 7571	1 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (𝑀 decompPMat 𝐾) = (𝑖 ∈ dom dom 𝑀, 𝑗 ∈ dom dom 𝑀 ↦ ((coe1‘(𝑖𝑀𝑗))‘𝐾)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457  dom cdm 5663  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421  ℕ₀cn0 12521  coe₁cco1 22390   decompPMat cdecpmat 22971

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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-decpmat 22972

This theorem is used by:  decpmatval  22974