Theorem mamufv 22709

Description: A cell in the 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 (𝑁 × 𝑃)))
mamufv.i	⊢ (𝜑 → 𝐼 ∈ 𝑀)
mamufv.k	⊢ (𝜑 → 𝐾 ∈ 𝑃)

Assertion

Ref	Expression
mamufv	⊢ (𝜑 → (𝐼(𝑋𝐹𝑌)𝐾) = (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))))

Distinct variable groups:   𝑗,𝑀   𝑗,𝑁   𝑃,𝑗   𝑅,𝑗   𝑗,𝑋   𝑗,𝑌   𝜑,𝑗   𝑗,𝐼   𝑗,𝐾

Allowed substitution hints:   𝐵(𝑗)   · (𝑗)   𝐹(𝑗)   𝑉(𝑗)

Proof of Theorem mamufv

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		mamuval.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝐵 ↑m (𝑀 × 𝑁)))
9		mamuval.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ (𝐵 ↑m (𝑁 × 𝑃)))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	mamuval 22708	. 2 ⊢ (𝜑 → (𝑋𝐹𝑌) = (𝑖 ∈ 𝑀, 𝑘 ∈ 𝑃 ↦ (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))))))
11		oveq1 7427	. . . . . 6 ⊢ (𝑖 = 𝐼 → (𝑖𝑋𝑗) = (𝐼𝑋𝑗))
12		oveq2 7428	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑗𝑌𝑘) = (𝑗𝑌𝐾))
13	11, 12	oveqan12d 7439	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑘 = 𝐾) → ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)) = ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))
14	13	adantl 487	. . . 4 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑘 = 𝐾)) → ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)) = ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))
15	14	mpteq2dv 5198	. . 3 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑘 = 𝐾)) → (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘))) = (𝑗 ∈ 𝑁 ↦ ((𝐼𝑋𝑗) · (𝑗𝑌𝐾))))
16	15	oveq2d 7436	. 2 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑘 = 𝐾)) → (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝑖𝑋𝑗) · (𝑗𝑌𝑘)))) = (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))))
17		mamufv.i	. 2 ⊢ (𝜑 → 𝐼 ∈ 𝑀)
18		mamufv.k	. 2 ⊢ (𝜑 → 𝐾 ∈ 𝑃)
19		ovexd 7455	. 2 ⊢ (𝜑 → (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))) ∈ V)
20	10, 16, 17, 18, 19	ovmpod 7572	1 ⊢ (𝜑 → (𝐼(𝑋𝐹𝑌)𝐾) = (𝑅 Σg (𝑗 ∈ 𝑁 ↦ ((𝐼𝑋𝑗) · (𝑗𝑌𝐾)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⟨cotp 4591   ↦ cmpt 5185   × cxp 5648  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8847  Fincfn 8973  Basecbs 17387  ._rcmulr 17429   Σ_g cgsu 17611   maMul cmmul 22705

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-ot 4592  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-mamu 22706

This theorem is used by:  mamuass  22717  mamudi  22718  mamudir  22719  mamuvs1  22720  mamuvs2  22721  mamulid  22756  mamurid  22757  matmulcell  22760  mavmulass  22864  mvmumamul1  22869  mdetmul  22938  matunitlindflem2  22995  decpmatmullem  23089