Theorem mamuval 22741

Description: Multiplication of two matrices. (Contributed by Stefan O'Rear, 2-Sep-2015.)

Hypotheses

Ref	Expression
mamufval.f	⊢ 𝐹 = (𝑅 maMul ⟨𝑀, 𝑁, 𝑃⟩)
mamufval.b	⊢ 𝐵 = (Base‘𝑅)
mamufval.t	⊢ · = (.r‘𝑅)
mamufval.r	⊢ (𝜑 → 𝑅 ∈ 𝑉)
mamufval.m	⊢ (𝜑 → 𝑀 ∈ Fin)
mamufval.n	⊢ (𝜑 → 𝑁 ∈ Fin)
mamufval.p	⊢ (𝜑 → 𝑃 ∈ Fin)
mamuval.x	⊢ (𝜑 → 𝑋 ∈ (𝐵 ↑m (𝑀 × 𝑁)))
mamuval.y	⊢ (𝜑 → 𝑌 ∈ (𝐵 ↑m (𝑁 × 𝑃)))

Assertion

Ref	Expression
mamuval	⊢ (𝜑 → (𝑋𝐹𝑌) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))

Distinct variable groups:   𝑖,𝑗,𝑘,𝑀   𝑖,𝑁,𝑗,𝑘   𝑃,𝑖,𝑗,𝑘   𝑅,𝑖,𝑗,𝑘   𝑖,𝑋,𝑗,𝑘   𝑖,𝑌,𝑗,𝑘   𝜑,𝑖,𝑗,𝑘   · ,𝑖,𝑘

Allowed substitution hints:   𝐵(𝑖, 𝑗, 𝑘)   · (𝑗)   𝐹(𝑖, 𝑗, 𝑘)   𝑉(𝑖, 𝑗, 𝑘)

Proof of Theorem mamuval

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mamufval.f	. . 3 ⊢ 𝐹 = (𝑅 maMul ⟨𝑀, 𝑁, 𝑃⟩)
2		mamufval.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
3		mamufval.t	. . 3 ⊢ · = (.r‘𝑅)
4		mamufval.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑉)
5		mamufval.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ Fin)
6		mamufval.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ Fin)
7		mamufval.p	. . 3 ⊢ (𝜑 → 𝑃 ∈ Fin)
8	1, 2, 3, 4, 5, 6, 7	mamufval 22740	. 2 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐵 ↑m (𝑀 × 𝑁)), 𝑦 ∈ (𝐵 ↑m (𝑁 × 𝑃)) ↦ (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))))))
9		oveq 7452	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑖𝑥𝑗) = (𝑖𝑋𝑗))
10		oveq 7452	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑗𝑦𝑘) = (𝑗𝑌𝑘))
11	9, 10	oveqan12d 7465	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
12	11	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)) = ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))
13	12	mpteq2dv 5203	. . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))) = (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))
14	13	oveq2d 7462	. . 3 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘)))) = (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))))
15	14	mpoeq3dv 7525	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑥𝑗) · (𝑗𝑦𝑘))))) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
16		mamuval.x	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝐵 ↑m (𝑀 × 𝑁)))
17		mamuval.y	. 2 ⊢ (𝜑 → 𝑌 ∈ (𝐵 ↑m (𝑁 × 𝑃)))
18		mpoexga 8118	. . 3 ⊢ ((𝑀 ∈ Fin ∧ 𝑃 ∈ Fin) → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
19	5, 7, 18	syl2anc 596	. 2 ⊢ (𝜑 → (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))) ∈ V)
20	8, 15, 16, 17, 19	ovmpod 7599	1 ⊢ (𝜑 → (𝑋𝐹𝑌) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cotp 4861   ↦ cmpt 5190   × cxp 5654  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448   ↑_m cmap 8878  Fincfn 9004  Basecbs 17419  ._rcmulr 17461   Σ_g cgsu 17643   maMul cmmul 22738

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-ot 4862  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-mamu 22739

This theorem is used by:  mamufv  22742  mamures  22745  mamucl  22749  mpomatmul  22794  mamutpos  22806  mat1dimmul  22824  dmatmul  22845  madurid  22992  cramerimplem2  23035  mat2pmatmul  23082  decpmatmul  23123