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

Theorem 1marepvmarrepid 22870
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 2761 . . . . . 6 (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3 eqid 2761 . . . . . 6 (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4 marepvmarrep1.v . . . . . 6 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5 marepvmarrep1.o . . . . . 6 1 = (1r‘(𝑁 Mat 𝑅))
62, 3, 4, 5ma1repvcl 22865 . . . . 5 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
76ancom2s 663 . . . 4 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
81, 7eqeltrid 2865 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9 elmapi 8853 . . . . . . 7 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10 ffvelcdm 7073 . . . . . . . 8 ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼 ∈ 𝑁) → (𝑍‘𝐼) ∈ (Base‘𝑅))
1110ex 418 . . . . . . 7 (𝑍:𝑁⟶(Base‘𝑅) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
129, 11syl 18 . . . . . 6 (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
1312, 4eleq2s 2879 . . . . 5 (𝑍 ∈ 𝑉 → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
1413impcom 413 . . . 4 ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → (𝑍‘𝐼) ∈ (Base‘𝑅))
1514adantl 487 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑍‘𝐼) ∈ (Base‘𝑅))
16 simpl 488 . . . 4 ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → 𝐼 ∈ 𝑁)
1716adantl 487 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝐼 ∈ 𝑁)
18 eqid 2761 . . . 4 (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19 eqid 2761 . . . 4 (0g‘𝑅) = (0g‘𝑅)
202, 3, 18, 19marrepval 22857 . . 3 (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍‘𝐼) ∈ (Base‘𝑅)) ∧ (𝐼 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
218, 15, 17, 17, 20syl22anc 852 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
22 iftrue 4488 . . . . . 6 (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
2322adantr 486 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
24 iftrue 4488 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
2524adantr 486 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
26 iftrue 4488 . . . . . . . 8 (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝑖))
27 fveq2 6877 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑍‘𝑖) = (𝑍‘𝐼))
2827adantr 486 . . . . . . . 8 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑍‘𝑖) = (𝑍‘𝐼))
2926, 28sylan9eq 2816 . . . . . . 7 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝐼))
3025, 29eqtr4d 2799 . . . . . 6 ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
31 eqid 2761 . . . . . . . . . . 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 22743 . . . . . . . . . 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 2782 . . . . . . . . . . . . . 14 ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝐼 = 𝑗)
4443eqcomd 2767 . . . . . . . . . . . . 13 ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝑗 = 𝐼)
4544ex 418 . . . . . . . . . . . 12 (𝑖 = 𝐼 → (𝑖 = 𝑗 → 𝑗 = 𝐼))
4645con3d 153 . . . . . . . . . . 11 (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4746adantr 486 . . . . . . . . . 10 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
4847impcom 413 . . . . . . . . 9 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → ¬ 𝑖 = 𝑗)
49 iffalse 4491 . . . . . . . . 9 (¬ 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
5048, 49syl 18 . . . . . . . 8 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
5142, 50eqtrd 2796 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → (𝑖 1 𝑗) = (0g‘𝑅))
52 iffalse 4491 . . . . . . . 8 (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
5352adantr 486 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54 iffalse 4491 . . . . . . . 8 (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
5554adantr 486 . . . . . . 7 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
5651, 53, 553eqtr4rd 2807 . . . . . 6 ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
5730, 56pm2.61ian 824 . . . . 5 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
5823, 57eqtrd 2796 . . . 4 ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
59 iffalse 4491 . . . . . 6 (¬ 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
6059adantr 486 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
612, 3, 5mat1bas 22744 . . . . . . . . . . 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 22866 . . . . . 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 22743 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
77 equcom 2051 . . . . . . . . 9 (𝑖 = 𝑗 ↔ 𝑗 = 𝑖)
7877a1i 11 . . . . . . . 8 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗 ↔ 𝑗 = 𝑖))
7978ifbid 4506 . . . . . . 7 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)))
8076, 79eqtr2d 2797 . . . . . 6 (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)) = (𝑖 1 𝑗))
8180ifeq2da 4515 . . . . 5 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8260, 71, 813eqtrd 2800 . . . 4 ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8358, 82pm2.61ian 824 . . 3 ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
8483mpoeq3dva 7489 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
85 eqid 2761 . . . . 5 (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
862, 3, 85, 4marepvval 22862 . . . 4 (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
8765, 86syl 18 . . 3 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
881, 87eqtr2id 2809 . 2 (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))) = 𝑋)
8921, 84, 883eqtrd 2800 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 1570   ∈ wcel 2145  ifcif 4482  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414   ↑m cmap 8831  Fincfn 8957  Basecbs 17367  0gc0g 17590  1rcur 20387  Ringcrg 20439   Mat cmat 22702   matRRep cmarrep 22851   matRepV cmatrepV 22852
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  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 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682  df-om 7867  df-1st 7990  df-2nd 7991  df-supp 8162  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-er 8701  df-map 8833  df-ixp 8910  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-fsupp 9338  df-sup 9418  df-oi 9488  df-card 10001  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-2 12386  df-3 12387  df-4 12388  df-5 12389  df-6 12390  df-7 12391  df-8 12392  df-9 12393  df-n0 12588  df-z 12675  df-dec 12796  df-uz 12947  df-fz 13621  df-fzo 13769  df-seq 14125  df-hash 14455  df-struct 17305  df-sets 17322  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-plusg 17421  df-mulr 17422  df-sca 17424  df-vsca 17425  df-ip 17426  df-tset 17427  df-ple 17428  df-ds 17430  df-hom 17432  df-cco 17433  df-0g 17592  df-gsum 17593  df-prds 17598  df-pws 17600  df-mre 17736  df-mrc 17737  df-acs 17739  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-mhm 18958  df-submnd 18959  df-grp 19127  df-minusg 19128  df-sbg 19129  df-mulg 19258  df-subg 19313  df-ghm 19408  df-cntz 19511  df-cmn 19976  df-abl 19977  df-mgp 20341  df-rng 20355  df-ur 20388  df-ring 20441  df-subrg 20802  df-lmod 21117  df-lss 21187  df-sra 21428  df-rgmod 21429  df-dsmm 22018  df-frlm 22033  df-mamu 22686  df-mat 22703  df-marrep 22853  df-marepv 22854
This theorem is used by:  cramerimplem1  22981
  Copyright terms: Public domain W3C validator