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

Theorem 1marepvmarrepid 22513
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 2735 . . . . . 6 (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3 eqid 2735 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4 marepvmarrep1.v . . . . . 6 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5 marepvmarrep1.o . . . . . 6 1 = (1r‘(𝑁 Mat 𝑅))
62, 3, 4, 5ma1repvcl 22508 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍𝑉𝐼𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
76ancom2s 650 . . . 4 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
81, 7eqeltrid 2838 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9 elmapi 8863 . . . . . . 7 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10 ffvelcdm 7071 . . . . . . . 8 ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼𝑁) → (𝑍𝐼) ∈ (Base‘𝑅))
1110ex 412 . . . . . . 7 (𝑍:𝑁⟶(Base‘𝑅) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
129, 11syl 17 . . . . . 6 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1312, 4eleq2s 2852 . . . . 5 (𝑍𝑉 → (𝐼𝑁 → (𝑍𝐼) ∈ (Base‘𝑅)))
1413impcom 407 . . . 4 ((𝐼𝑁𝑍𝑉) → (𝑍𝐼) ∈ (Base‘𝑅))
1514adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑍𝐼) ∈ (Base‘𝑅))
16 simpl 482 . . . 4 ((𝐼𝑁𝑍𝑉) → 𝐼𝑁)
1716adantl 481 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → 𝐼𝑁)
18 eqid 2735 . . . 4 (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19 eqid 2735 . . . 4 (0g𝑅) = (0g𝑅)
202, 3, 18, 19marrepval 22500 . . 3 (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍𝐼) ∈ (Base‘𝑅)) ∧ (𝐼𝑁𝐼𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
218, 15, 17, 17, 20syl22anc 838 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍𝐼))𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))))
22 iftrue 4506 . . . . . 6 (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
2322adantr 480 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)))
24 iftrue 4506 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
2524adantr 480 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (𝑍𝐼))
26 iftrue 4506 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝑖))
27 fveq2 6876 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑍𝑖) = (𝑍𝐼))
2827adantr 480 . . . . . . . 8 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (𝑍𝑖) = (𝑍𝐼))
2926, 28sylan9eq 2790 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑍𝐼))
3025, 29eqtr4d 2773 . . . . . 6 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
31 eqid 2735 . . . . . . . . . . 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 22386 . . . . . . . . . 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 2756 . . . . . . . . . . . . . 14 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝐼 = 𝑗)
4443eqcomd 2741 . . . . . . . . . . . . 13 ((𝑖 = 𝐼𝑖 = 𝑗) → 𝑗 = 𝐼)
4544ex 412 . . . . . . . . . . . 12 (𝑖 = 𝐼 → (𝑖 = 𝑗𝑗 = 𝐼))
4645con3d 152 . . . . . . . . . . 11 (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4746adantr 480 . . . . . . . . . 10 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4847impcom 407 . . . . . . . . 9 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → ¬ 𝑖 = 𝑗)
49 iffalse 4509 . . . . . . . . 9 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5048, 49syl 17 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = (0g𝑅))
5142, 50eqtrd 2770 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → (𝑖 1 𝑗) = (0g𝑅))
52 iffalse 4509 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
5352adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54 iffalse 4509 . . . . . . . 8 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5554adantr 480 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = (0g𝑅))
5651, 53, 553eqtr4rd 2781 . . . . . 6 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁))) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5730, 56pm2.61ian 811 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
5823, 57eqtrd 2770 . . . 4 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
59 iffalse 4509 . . . . . 6 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
6059adantr 480 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
612, 3, 5mat1bas 22387 . . . . . . . . . . 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 22509 . . . . . 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 22386 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)))
77 equcom 2017 . . . . . . . . 9 (𝑖 = 𝑗𝑗 = 𝑖)
7877a1i 11 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗𝑗 = 𝑖))
7978ifbid 4524 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r𝑅), (0g𝑅)) = if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)))
8076, 79eqtr2d 2771 . . . . . 6 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r𝑅), (0g𝑅)) = (𝑖 1 𝑗))
8180ifeq2da 4533 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑗 = 𝐼, (𝑍𝑖), if(𝑗 = 𝑖, (1r𝑅), (0g𝑅))) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8260, 71, 813eqtrd 2774 . . . 4 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8358, 82pm2.61ian 811 . . 3 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) ∧ 𝑖𝑁𝑗𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗)))
8483mpoeq3dva 7484 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍𝐼), (0g𝑅)), (𝑖𝑋𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
85 eqid 2735 . . . . 5 (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
862, 3, 85, 4marepvval 22505 . . . 4 (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍𝑉𝐼𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
8765, 86syl 17 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))))
881, 87eqtr2id 2783 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼𝑁𝑍𝑉)) → (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝐼, (𝑍𝑖), (𝑖 1 𝑗))) = 𝑋)
8921, 84, 883eqtrd 2774 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 2108  ifcif 4500  wf 6527  cfv 6531  (class class class)co 7405  cmpo 7407  m cmap 8840  Fincfn 8959  Basecbs 17228  0gc0g 17453  1rcur 20141  Ringcrg 20193   Mat cmat 22345   matRRep cmarrep 22494   matRepV cmatrepV 22495
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-tp 4606  df-op 4608  df-ot 4610  df-uni 4884  df-int 4923  df-iun 4969  df-iin 4970  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-of 7671  df-om 7862  df-1st 7988  df-2nd 7989  df-supp 8160  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-2o 8481  df-er 8719  df-map 8842  df-ixp 8912  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-fsupp 9374  df-sup 9454  df-oi 9524  df-card 9953  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12502  df-z 12589  df-dec 12709  df-uz 12853  df-fz 13525  df-fzo 13672  df-seq 14020  df-hash 14349  df-struct 17166  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17252  df-plusg 17284  df-mulr 17285  df-sca 17287  df-vsca 17288  df-ip 17289  df-tset 17290  df-ple 17291  df-ds 17293  df-hom 17295  df-cco 17296  df-0g 17455  df-gsum 17456  df-prds 17461  df-pws 17463  df-mre 17598  df-mrc 17599  df-acs 17601  df-mgm 18618  df-sgrp 18697  df-mnd 18713  df-mhm 18761  df-submnd 18762  df-grp 18919  df-minusg 18920  df-sbg 18921  df-mulg 19051  df-subg 19106  df-ghm 19196  df-cntz 19300  df-cmn 19763  df-abl 19764  df-mgp 20101  df-rng 20113  df-ur 20142  df-ring 20195  df-subrg 20530  df-lmod 20819  df-lss 20889  df-sra 21131  df-rgmod 21132  df-dsmm 21692  df-frlm 21707  df-mamu 22329  df-mat 22346  df-marrep 22496  df-marepv 22497
This theorem is referenced by:  cramerimplem1  22621
  Copyright terms: Public domain W3C validator