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

Theorem 1marepvmarrepid 22895
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 2760 . . . . . 6 (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3 eqid 2760 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4 marepvmarrep1.v . . . . . 6 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5 marepvmarrep1.o . . . . . 6 1 = (1r‘(𝑁 Mat 𝑅))
62, 3, 4, 5ma1repvcl 22890 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
76ancom2s 663 . . . 4 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
81, 7eqeltrid 2864 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9 elmapi 8872 . . . . . . 7 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10 ffvelcdm 7081 . . . . . . . 8 ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼 ∈ 𝑁) → (𝑍‘𝐼) ∈ (Base‘𝑅))
1110ex 418 . . . . . . 7 (𝑍:𝑁⟶(Base‘𝑅) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
129, 11syl 18 . . . . . 6 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
1312, 4eleq2s 2878 . . . . 5 (𝑍 ∈ 𝑉 → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
1413impcom 413 . . . 4 ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → (𝑍‘𝐼) ∈ (Base‘𝑅))
1514adantl 487 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑍‘𝐼) ∈ (Base‘𝑅))
16 simpl 488 . . . 4 ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → 𝐼 ∈ 𝑁)
1716adantl 487 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝐼 ∈ 𝑁)
18 eqid 2760 . . . 4 (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19 eqid 2760 . . . 4 (0g‘𝑅) = (0g‘𝑅)
202, 3, 18, 19marrepval 22882 . . 3 (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍‘𝐼) ∈ (Base‘𝑅)) ∧ (𝐼 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
218, 15, 17, 17, 20syl22anc 852 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
22 iftrue 4487 . . . . . 6 (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
2322adantr 486 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
24 iftrue 4487 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
2524adantr 486 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
26 iftrue 4487 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝑖))
27 fveq2 6885 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑍‘𝑖) = (𝑍‘𝐼))
2827adantr 486 . . . . . . . 8 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑍‘𝑖) = (𝑍‘𝐼))
2926, 28sylan9eq 2815 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝐼))
3025, 29eqtr4d 2798 . . . . . 6 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
31 eqid 2760 . . . . . . . . . . 11 (1r‘𝑅) = (1r‘𝑅)
32 simpr 490 . . . . . . . . . . . . 13 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin)
3332adantr 486 . . . . . . . . . . . 12 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑁 ∈ Fin)
34333ad2ant1 1151 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑁 ∈ Fin)
35 simpl 488 . . . . . . . . . . . . 13 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑅 ∈ Ring)
3635adantr 486 . . . . . . . . . . . 12 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑅 ∈ Ring)
37363ad2ant1 1151 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑅 ∈ Ring)
38 simp2 1155 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑖 ∈ 𝑁)
39 simp3 1156 . . . . . . . . . . 11 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑗 ∈ 𝑁)
402, 31, 19, 34, 37, 38, 39, 5mat1ov 22768 . . . . . . . . . 10 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
4140adantl 487 . . . . . . . . 9 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
4241adantl 487 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
43 eqtr2 2781 . . . . . . . . . . . . . 14 ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝐼 = 𝑗)
4443eqcomd 2766 . . . . . . . . . . . . 13 ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝑗 = 𝐼)
4544ex 418 . . . . . . . . . . . 12 (𝑖 = 𝐼 → (𝑖 = 𝑗 → 𝑗 = 𝐼))
4645con3d 153 . . . . . . . . . . 11 (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4746adantr 486 . . . . . . . . . 10 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4847impcom 413 . . . . . . . . 9 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → ¬ 𝑖 = 𝑗)
49 iffalse 4490 . . . . . . . . 9 (¬ 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
5048, 49syl 18 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
5142, 50eqtrd 2795 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → (𝑖 1 𝑗) = (0g‘𝑅))
52 iffalse 4490 . . . . . . . 8 (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
5352adantr 486 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54 iffalse 4490 . . . . . . . 8 (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
5554adantr 486 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
5651, 53, 553eqtr4rd 2806 . . . . . 6 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
5730, 56pm2.61ian 824 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
5823, 57eqtrd 2795 . . . 4 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
59 iffalse 4490 . . . . . 6 (¬ 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
6059adantr 486 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
612, 3, 5mat1bas 22769 . . . . . . . . . . 11 ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
6261adantr 486 . . . . . . . . . 10 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
63 simpr 490 . . . . . . . . . . 11 ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → 𝑍 ∈ 𝑉)
6463adantl 487 . . . . . . . . . 10 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑍 ∈ 𝑉)
6562, 64, 173jca 1146 . . . . . . . . 9 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁))
66653ad2ant1 1151 . . . . . . . 8 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁))
67 3simpc 1168 . . . . . . . 8 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))
6837, 66, 673jca 1146 . . . . . . 7 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
6968adantl 487 . . . . . 6 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
702, 3, 4, 5, 19, 1ma1repveval 22891 . . . . . 6 ((𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))))
7169, 70syl 18 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))))
7234ad2antlr 740 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑁 ∈ Fin)
7337ad2antlr 740 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑅 ∈ Ring)
7438ad2antlr 740 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑖 ∈ 𝑁)
7539ad2antlr 740 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑗 ∈ 𝑁)
762, 31, 19, 72, 73, 74, 75, 5mat1ov 22768 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
77 equcom 2050 . . . . . . . . 9 (𝑖 = 𝑗 ↔ 𝑗 = 𝑖)
7877a1i 11 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗 ↔ 𝑗 = 𝑖))
7978ifbid 4505 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)))
8076, 79eqtr2d 2796 . . . . . 6 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)) = (𝑖 1 𝑗))
8180ifeq2da 4514 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8260, 71, 813eqtrd 2799 . . . 4 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8358, 82pm2.61ian 824 . . 3 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8483mpoeq3dva 7497 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
85 eqid 2760 . . . . 5 (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
862, 3, 85, 4marepvval 22887 . . . 4 (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
8765, 86syl 18 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
881, 87eqtr2id 2808 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))) = 𝑋)
8921, 84, 883eqtrd 2799 1 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ifcif 4481  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ↑m cmap 8850  Fincfn 8976  Basecbs 17392  0gc0g 17615  1rcur 20412  Ringcrg 20464   Mat cmat 22727   matRRep cmarrep 22876   matRepV cmatrepV 22877
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  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  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-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-supp 8180  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-2o 8480  df-er 8720  df-map 8852  df-ixp 8929  df-en 8977  df-dom 8978  df-sdom 8979  df-fin 8980  df-fsupp 9357  df-sup 9437  df-oi 9507  df-card 10023  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-nn 12339  df-2 12408  df-3 12409  df-4 12410  df-5 12411  df-6 12412  df-7 12413  df-8 12414  df-9 12415  df-n0 12610  df-z 12697  df-dec 12818  df-uz 12969  df-fz 13643  df-fzo 13792  df-seq 14148  df-hash 14478  df-struct 17330  df-sets 17347  df-slot 17365  df-ndx 17377  df-base 17393  df-ress 17414  df-plusg 17446  df-mulr 17447  df-sca 17449  df-vsca 17450  df-ip 17451  df-tset 17452  df-ple 17453  df-ds 17455  df-hom 17457  df-cco 17458  df-0g 17617  df-gsum 17618  df-prds 17623  df-pws 17625  df-mre 17761  df-mrc 17762  df-acs 17764  df-mgm 18821  df-sgrp 18913  df-mnd 18929  df-mhm 18983  df-submnd 18984  df-grp 19152  df-minusg 19153  df-sbg 19154  df-mulg 19283  df-subg 19338  df-ghm 19433  df-cntz 19536  df-cmn 20001  df-abl 20002  df-mgp 20366  df-rng 20380  df-ur 20413  df-ring 20466  df-subrg 20827  df-lmod 21142  df-lss 21212  df-sra 21453  df-rgmod 21454  df-dsmm 22043  df-frlm 22058  df-mamu 22711  df-mat 22728  df-marrep 22878  df-marepv 22879
This theorem is used by:  cramerimplem1  23006
  Copyright terms: Public domain W3C validator