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

Theorem 1marepvmarrepid 22491
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 2733 . . . . . 6 (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3 eqid 2733 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4 marepvmarrep1.v . . . . . 6 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5 marepvmarrep1.o . . . . . 6 1 = (1r‘(𝑁 Mat 𝑅))
62, 3, 4, 5ma1repvcl 22486 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍𝑉𝐼𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
76ancom2s 650 . . . 4 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
81, 7eqeltrid 2837 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9 elmapi 8779 . . . . . . 7 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10 ffvelcdm 7020 . . . . . . . 8 ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼𝑁) → (𝑍𝐼) ∈ (Base‘𝑅))
1110ex 412 . . . . . . 7 (𝑍:𝑁⟶(Base‘𝑅) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
129, 11syl 17 . . . . . 6 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1312, 4eleq2s 2851 . . . . 5 (𝑍𝑉 → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1413impcom 407 . . . 4 ((𝐼𝑁𝑍𝑉) → (𝑍𝐼) ∈ (Base‘𝑅))
1514adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑍𝐼) ∈ (Base‘𝑅))
16 simpl 482 . . . 4 ((𝐼𝑁𝑍𝑉) → 𝐼𝑁)
1716adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝐼𝑁)
18 eqid 2733 . . . 4 (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19 eqid 2733 . . . 4 (0g𝑅) = (0g𝑅)
202, 3, 18, 19marrepval 22478 . . 3 (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍𝐼) ∈ (Base‘𝑅)) ∧ (𝐼𝑁𝐼𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
218, 15, 17, 17, 20syl22anc 838 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
22 iftrue 4480 . . . . . 6 (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
2322adantr 480 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
24 iftrue 4480 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
2524adantr 480 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
26 iftrue 4480 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝑖))
27 fveq2 6828 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑍𝑖) = (𝑍𝐼))
2827adantr 480 . . . . . . . 8 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑍𝑖) = (𝑍𝐼))
2926, 28sylan9eq 2788 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝐼))
3025, 29eqtr4d 2771 . . . . . 6 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
31 eqid 2733 . . . . . . . . . . 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 22364 . . . . . . . . . 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 2754 . . . . . . . . . . . . . 14 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝐼 = 𝑗)
4443eqcomd 2739 . . . . . . . . . . . . 13 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝑗 = 𝐼)
4544ex 412 . . . . . . . . . . . 12 (𝑖 = 𝐼 → (𝑖 = 𝑗𝑗 = 𝐼))
4645con3d 152 . . . . . . . . . . 11 (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4746adantr 480 . . . . . . . . . 10 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4847impcom 407 . . . . . . . . 9 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → ¬ 𝑖 = 𝑗)
49 iffalse 4483 . . . . . . . . 9 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5048, 49syl 17 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5142, 50eqtrd 2768 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → (𝑖 1 𝑗) = (0g𝑅))
52 iffalse 4483 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
5352adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54 iffalse 4483 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5554adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5651, 53, 553eqtr4rd 2779 . . . . . 6 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5730, 56pm2.61ian 811 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5823, 57eqtrd 2768 . . . 4 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
59 iffalse 4483 . . . . . 6 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
6059adantr 480 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
612, 3, 5mat1bas 22365 . . . . . . . . . . 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 22487 . . . . . 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 22364 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
77 equcom 2019 . . . . . . . . 9 (𝑖 = 𝑗𝑗 = 𝑖)
7877a1i 11 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗𝑗 = 𝑖))
7978ifbid 4498 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)))
8076, 79eqtr2d 2769 . . . . . 6 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)) = (𝑖 1 𝑗))
8180ifeq2da 4507 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝑖), if(𝑗 = 𝑖, (1r𝑅), (0g𝑅))) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8260, 71, 813eqtrd 2772 . . . 4 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8358, 82pm2.61ian 811 . . 3 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8483mpoeq3dva 7429 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
85 eqid 2733 . . . . 5 (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
862, 3, 85, 4marepvval 22483 . . . 4 (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
8765, 86syl 17 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
881, 87eqtr2id 2781 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))) = 𝑋)
8921, 84, 883eqtrd 2772 1 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  ifcif 4474  wf 6482  cfv 6486  (class class class)co 7352  cmpo 7354  m cmap 8756  Fincfn 8875  Basecbs 17122  0gc0g 17345  1rcur 20101  Ringcrg 20153   Mat cmat 22323   matRRep cmarrep 22472   matRepV cmatrepV 22473
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-ot 4584  df-uni 4859  df-int 4898  df-iun 4943  df-iin 4944  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-isom 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-of 7616  df-om 7803  df-1st 7927  df-2nd 7928  df-supp 8097  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-2o 8392  df-er 8628  df-map 8758  df-ixp 8828  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-fsupp 9253  df-sup 9333  df-oi 9403  df-card 9839  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-3 12196  df-4 12197  df-5 12198  df-6 12199  df-7 12200  df-8 12201  df-9 12202  df-n0 12389  df-z 12476  df-dec 12595  df-uz 12739  df-fz 13410  df-fzo 13557  df-seq 13911  df-hash 14240  df-struct 17060  df-sets 17077  df-slot 17095  df-ndx 17107  df-base 17123  df-ress 17144  df-plusg 17176  df-mulr 17177  df-sca 17179  df-vsca 17180  df-ip 17181  df-tset 17182  df-ple 17183  df-ds 17185  df-hom 17187  df-cco 17188  df-0g 17347  df-gsum 17348  df-prds 17353  df-pws 17355  df-mre 17490  df-mrc 17491  df-acs 17493  df-mgm 18550  df-sgrp 18629  df-mnd 18645  df-mhm 18693  df-submnd 18694  df-grp 18851  df-minusg 18852  df-sbg 18853  df-mulg 18983  df-subg 19038  df-ghm 19127  df-cntz 19231  df-cmn 19696  df-abl 19697  df-mgp 20061  df-rng 20073  df-ur 20102  df-ring 20155  df-subrg 20487  df-lmod 20797  df-lss 20867  df-sra 21109  df-rgmod 21110  df-dsmm 21671  df-frlm 21686  df-mamu 22307  df-mat 22324  df-marrep 22474  df-marepv 22475
This theorem is referenced by:  cramerimplem1  22599
  Copyright terms: Public domain W3C validator