Theorem cpm2mfval 21356

Description: Value of the inverse matrix transformation. (Contributed by AV, 14-Dec-2019.)

Hypotheses

Ref	Expression
cpm2mfval.i	⊢ 𝐼 = (𝑁 cPolyMatToMat 𝑅)
cpm2mfval.s	⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)

Assertion

Ref	Expression
cpm2mfval	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐼 = (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))

Distinct variable groups:   𝑚,𝑁,𝑥,𝑦   𝑅,𝑚,𝑥,𝑦   𝑆,𝑚

Allowed substitution hints:   𝑆(𝑥,𝑦)   𝐼(𝑥,𝑦,𝑚)   𝑉(𝑥,𝑦,𝑚)

Proof of Theorem cpm2mfval

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

Step	Hyp	Ref	Expression
1		cpm2mfval.i	. 2 ⊢ 𝐼 = (𝑁 cPolyMatToMat 𝑅)
2		df-cpmat2mat 21315	. . . 4 ⊢ cPolyMatToMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥 ∈ 𝑛, 𝑦 ∈ 𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
3	2	a1i 11	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → cPolyMatToMat = (𝑛 ∈ Fin, 𝑟 ∈ V ↦ (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥 ∈ 𝑛, 𝑦 ∈ 𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)))))
4		oveq12 7164	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ConstPolyMat 𝑟) = (𝑁 ConstPolyMat 𝑅))
5		cpm2mfval.s	. . . . . 6 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
6	4, 5	syl6eqr 2874	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ConstPolyMat 𝑟) = 𝑆)
7		simpl 485	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
8		eqidd 2822	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → ((coe1‘(𝑥𝑚𝑦))‘0) = ((coe1‘(𝑥𝑚𝑦))‘0))
9	7, 7, 8	mpoeq123dv 7228	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑥 ∈ 𝑛, 𝑦 ∈ 𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)) = (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0)))
10	6, 9	mpteq12dv 5150	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥 ∈ 𝑛, 𝑦 ∈ 𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) = (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
11	10	adantl 484	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) ∧ (𝑛 = 𝑁 ∧ 𝑟 = 𝑅)) → (𝑚 ∈ (𝑛 ConstPolyMat 𝑟) ↦ (𝑥 ∈ 𝑛, 𝑦 ∈ 𝑛 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) = (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
12		simpl 485	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑁 ∈ Fin)
13		elex 3512	. . . 4 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
14	13	adantl 484	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ V)
15	5	ovexi 7189	. . . 4 ⊢ 𝑆 ∈ V
16		mptexg 6983	. . . 4 ⊢ (𝑆 ∈ V → (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) ∈ V)
17	15, 16	mp1i 13	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))) ∈ V)
18	3, 11, 12, 14, 17	ovmpod 7301	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑁 cPolyMatToMat 𝑅) = (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))
19	1, 18	syl5eq 2868	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝐼 = (𝑚 ∈ 𝑆 ↦ (𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁 ↦ ((coe1‘(𝑥𝑚𝑦))‘0))))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1533   ∈ wcel 2110  Vcvv 3494   ↦ cmpt 5145  ‘cfv 6354  (class class class)co 7155   ∈ cmpo 7157  Fincfn 8508  0cc0 10536  coe₁cco1 20345   ConstPolyMat ccpmat 21310   cPolyMatToMat ccpmat2mat 21312

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pr 5329

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-oprab 7159  df-mpo 7160  df-cpmat2mat 21315

This theorem is referenced by:  cpm2mval  21357  cpm2mf  21359  m2cpmfo  21363  cayleyhamiltonALT  21498