MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  1marepvmarrepid Structured version   Visualization version   GIF version

Theorem 1marepvmarrepid 22469
Description: Replacing the ith row by 0's and the ith component of a (column) vector at the diagonal position for the identity matrix with the ith column replaced by the vector results in the matrix itself. (Contributed by AV, 14-Feb-2019.) (Revised by AV, 27-Feb-2019.)
Hypotheses
Ref Expression
marepvmarrep1.v 𝑉 = ((Base‘𝑅) ↑m 𝑁)
marepvmarrep1.o 1 = (1r‘(𝑁 Mat 𝑅))
marepvmarrep1.x 𝑋 = (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼)
Assertion
Ref Expression
1marepvmarrepid (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = 𝑋)

Proof of Theorem 1marepvmarrepid
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 marepvmarrep1.x . . . 4 𝑋 = (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼)
2 eqid 2730 . . . . . 6 (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3 eqid 2730 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4 marepvmarrep1.v . . . . . 6 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5 marepvmarrep1.o . . . . . 6 1 = (1r‘(𝑁 Mat 𝑅))
62, 3, 4, 5ma1repvcl 22464 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍𝑉𝐼𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
76ancom2s 650 . . . 4 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
81, 7eqeltrid 2833 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9 elmapi 8825 . . . . . . 7 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10 ffvelcdm 7056 . . . . . . . 8 ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼𝑁) → (𝑍𝐼) ∈ (Base‘𝑅))
1110ex 412 . . . . . . 7 (𝑍:𝑁⟶(Base‘𝑅) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
129, 11syl 17 . . . . . 6 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1312, 4eleq2s 2847 . . . . 5 (𝑍𝑉 → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1413impcom 407 . . . 4 ((𝐼𝑁𝑍𝑉) → (𝑍𝐼) ∈ (Base‘𝑅))
1514adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑍𝐼) ∈ (Base‘𝑅))
16 simpl 482 . . . 4 ((𝐼𝑁𝑍𝑉) → 𝐼𝑁)
1716adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝐼𝑁)
18 eqid 2730 . . . 4 (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19 eqid 2730 . . . 4 (0g𝑅) = (0g𝑅)
202, 3, 18, 19marrepval 22456 . . 3 (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍𝐼) ∈ (Base‘𝑅)) ∧ (𝐼𝑁𝐼𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
218, 15, 17, 17, 20syl22anc 838 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
22 iftrue 4497 . . . . . 6 (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
2322adantr 480 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
24 iftrue 4497 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
2524adantr 480 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
26 iftrue 4497 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝑖))
27 fveq2 6861 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑍𝑖) = (𝑍𝐼))
2827adantr 480 . . . . . . . 8 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑍𝑖) = (𝑍𝐼))
2926, 28sylan9eq 2785 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝐼))
3025, 29eqtr4d 2768 . . . . . 6 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
31 eqid 2730 . . . . . . . . . . 11 (1r𝑅) = (1r𝑅)
32 simpr 484 . . . . . . . . . . . . 13 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin)
3332adantr 480 . . . . . . . . . . . 12 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑁 ∈ Fin)
34333ad2ant1 1133 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → 𝑁 ∈ Fin)
35 simpl 482 . . . . . . . . . . . . 13 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑅 ∈ Ring)
3635adantr 480 . . . . . . . . . . . 12 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑅 ∈ Ring)
37363ad2ant1 1133 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → 𝑅 ∈ Ring)
38 simp2 1137 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → 𝑖𝑁)
39 simp3 1138 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → 𝑗𝑁)
402, 31, 19, 34, 37, 38, 39, 5mat1ov 22342 . . . . . . . . . 10 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
4140adantl 481 . . . . . . . . 9 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
4241adantl 481 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
43 eqtr2 2751 . . . . . . . . . . . . . 14 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝐼 = 𝑗)
4443eqcomd 2736 . . . . . . . . . . . . 13 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝑗 = 𝐼)
4544ex 412 . . . . . . . . . . . 12 (𝑖 = 𝐼 → (𝑖 = 𝑗𝑗 = 𝐼))
4645con3d 152 . . . . . . . . . . 11 (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4746adantr 480 . . . . . . . . . 10 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4847impcom 407 . . . . . . . . 9 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → ¬ 𝑖 = 𝑗)
49 iffalse 4500 . . . . . . . . 9 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5048, 49syl 17 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5142, 50eqtrd 2765 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → (𝑖 1 𝑗) = (0g𝑅))
52 iffalse 4500 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
5352adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54 iffalse 4500 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5554adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5651, 53, 553eqtr4rd 2776 . . . . . 6 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5730, 56pm2.61ian 811 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5823, 57eqtrd 2765 . . . 4 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
59 iffalse 4500 . . . . . 6 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
6059adantr 480 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
612, 3, 5mat1bas 22343 . . . . . . . . . . 11 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
6261adantr 480 . . . . . . . . . 10 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
63 simpr 484 . . . . . . . . . . 11 ((𝐼𝑁𝑍𝑉) → 𝑍𝑉)
6463adantl 481 . . . . . . . . . 10 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑍𝑉)
6562, 64, 173jca 1128 . . . . . . . . 9 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁))
66653ad2ant1 1133 . . . . . . . 8 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁))
67 3simpc 1150 . . . . . . . 8 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → (𝑖𝑁𝑗𝑁))
6837, 66, 673jca 1128 . . . . . . 7 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) ∧ (𝑖𝑁𝑗𝑁)))
6968adantl 481 . . . . . 6 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) ∧ (𝑖𝑁𝑗𝑁)))
702, 3, 4, 5, 19, 1ma1repveval 22465 . . . . . 6 ((𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) ∧ (𝑖𝑁𝑗𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍𝑖), if(𝑗 = 𝑖, (1r𝑅), (0g𝑅))))
7169, 70syl 17 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍𝑖), if(𝑗 = 𝑖, (1r𝑅), (0g𝑅))))
7234ad2antlr 727 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑁 ∈ Fin)
7337ad2antlr 727 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑅 ∈ Ring)
7438ad2antlr 727 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑖𝑁)
7539ad2antlr 727 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑗𝑁)
762, 31, 19, 72, 73, 74, 75, 5mat1ov 22342 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
77 equcom 2018 . . . . . . . . 9 (𝑖 = 𝑗𝑗 = 𝑖)
7877a1i 11 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗𝑗 = 𝑖))
7978ifbid 4515 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)))
8076, 79eqtr2d 2766 . . . . . 6 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)) = (𝑖 1 𝑗))
8180ifeq2da 4524 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝑖), if(𝑗 = 𝑖, (1r𝑅), (0g𝑅))) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8260, 71, 813eqtrd 2769 . . . 4 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8358, 82pm2.61ian 811 . . 3 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8483mpoeq3dva 7469 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
85 eqid 2730 . . . . 5 (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
862, 3, 85, 4marepvval 22461 . . . 4 (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
8765, 86syl 17 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
881, 87eqtr2id 2778 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))) = 𝑋)
8921, 84, 883eqtrd 2769 1 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  ifcif 4491  wf 6510  cfv 6514  (class class class)co 7390  cmpo 7392  m cmap 8802  Fincfn 8921  Basecbs 17186  0gc0g 17409  1rcur 20097  Ringcrg 20149   Mat cmat 22301   matRRep cmarrep 22450   matRepV cmatrepV 22451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-tp 4597  df-op 4599  df-ot 4601  df-uni 4875  df-int 4914  df-iun 4960  df-iin 4961  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-se 5595  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-isom 6523  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-of 7656  df-om 7846  df-1st 7971  df-2nd 7972  df-supp 8143  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-1o 8437  df-2o 8438  df-er 8674  df-map 8804  df-ixp 8874  df-en 8922  df-dom 8923  df-sdom 8924  df-fin 8925  df-fsupp 9320  df-sup 9400  df-oi 9470  df-card 9899  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-nn 12194  df-2 12256  df-3 12257  df-4 12258  df-5 12259  df-6 12260  df-7 12261  df-8 12262  df-9 12263  df-n0 12450  df-z 12537  df-dec 12657  df-uz 12801  df-fz 13476  df-fzo 13623  df-seq 13974  df-hash 14303  df-struct 17124  df-sets 17141  df-slot 17159  df-ndx 17171  df-base 17187  df-ress 17208  df-plusg 17240  df-mulr 17241  df-sca 17243  df-vsca 17244  df-ip 17245  df-tset 17246  df-ple 17247  df-ds 17249  df-hom 17251  df-cco 17252  df-0g 17411  df-gsum 17412  df-prds 17417  df-pws 17419  df-mre 17554  df-mrc 17555  df-acs 17557  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-mhm 18717  df-submnd 18718  df-grp 18875  df-minusg 18876  df-sbg 18877  df-mulg 19007  df-subg 19062  df-ghm 19152  df-cntz 19256  df-cmn 19719  df-abl 19720  df-mgp 20057  df-rng 20069  df-ur 20098  df-ring 20151  df-subrg 20486  df-lmod 20775  df-lss 20845  df-sra 21087  df-rgmod 21088  df-dsmm 21648  df-frlm 21663  df-mamu 22285  df-mat 22302  df-marrep 22452  df-marepv 22453
This theorem is referenced by:  cramerimplem1  22577
  Copyright terms: Public domain W3C validator