Theorem 1marepvmarrepid 21186

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.

Step	Hyp	Ref	Expression
1		marepvmarrep1.x	. . . 4 ⊢ 𝑋 = (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼)
2		eqid 2823	. . . . . 6 ⊢ (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅)
3		eqid 2823	. . . . . 6 ⊢ (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅))
4		marepvmarrep1.v	. . . . . 6 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁)
5		marepvmarrep1.o	. . . . . 6 ⊢ 1 = (1r‘(𝑁 Mat 𝑅))
6	2, 3, 4, 5	ma1repvcl 21181	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
7	6	ancom2s 648	. . . 4 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) ∈ (Base‘(𝑁 Mat 𝑅)))
8	1, 7	eqeltrid 2919	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑋 ∈ (Base‘(𝑁 Mat 𝑅)))
9		elmapi 8430	. . . . . . 7 ⊢ (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → 𝑍:𝑁⟶(Base‘𝑅))
10		ffvelrn 6851	. . . . . . . 8 ⊢ ((𝑍:𝑁⟶(Base‘𝑅) ∧ 𝐼 ∈ 𝑁) → (𝑍‘𝐼) ∈ (Base‘𝑅))
11	10	ex 415	. . . . . . 7 ⊢ (𝑍:𝑁⟶(Base‘𝑅) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
12	9, 11	syl 17	. . . . . 6 ⊢ (𝑍 ∈ ((Base‘𝑅) ↑m 𝑁) → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
13	12, 4	eleq2s 2933	. . . . 5 ⊢ (𝑍 ∈ 𝑉 → (𝐼 ∈ 𝑁 → (𝑍‘𝐼) ∈ (Base‘𝑅)))
14	13	impcom 410	. . . 4 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → (𝑍‘𝐼) ∈ (Base‘𝑅))
15	14	adantl 484	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑍‘𝐼) ∈ (Base‘𝑅))
16		simpl 485	. . . 4 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → 𝐼 ∈ 𝑁)
17	16	adantl 484	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝐼 ∈ 𝑁)
18		eqid 2823	. . . 4 ⊢ (𝑁 matRRep 𝑅) = (𝑁 matRRep 𝑅)
19		eqid 2823	. . . 4 ⊢ (0g‘𝑅) = (0g‘𝑅)
20	2, 3, 18, 19	marrepval 21173	. . 3 ⊢ (((𝑋 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ (𝑍‘𝐼) ∈ (Base‘𝑅)) ∧ (𝐼 ∈ 𝑁 ∧ 𝐼 ∈ 𝑁)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
21	8, 15, 17, 17, 20	syl22anc 836	. 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))))
22		iftrue 4475	. . . . . 6 ⊢ (𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
23	22	adantr 483	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)))
24		iftrue 4475	. . . . . . . 8 ⊢ (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
25	24	adantr 483	. . . . . . 7 ⊢ ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (𝑍‘𝐼))
26		iftrue 4475	. . . . . . . 8 ⊢ (𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝑖))
27		fveq2 6672	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → (𝑍‘𝑖) = (𝑍‘𝐼))
28	27	adantr 483	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑍‘𝑖) = (𝑍‘𝐼))
29	26, 28	sylan9eq 2878	. . . . . . 7 ⊢ ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑍‘𝐼))
30	25, 29	eqtr4d 2861	. . . . . 6 ⊢ ((𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
31		eqid 2823	. . . . . . . . . . 11 ⊢ (1r‘𝑅) = (1r‘𝑅)
32		simpr 487	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin)
33	32	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑁 ∈ Fin)
34	33	3ad2ant1 1129	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑁 ∈ Fin)
35		simpl 485	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 𝑅 ∈ Ring)
36	35	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑅 ∈ Ring)
37	36	3ad2ant1 1129	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑅 ∈ Ring)
38		simp2 1133	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑖 ∈ 𝑁)
39		simp3 1134	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → 𝑗 ∈ 𝑁)
40	2, 31, 19, 34, 37, 38, 39, 5	mat1ov 21059	. . . . . . . . . 10 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
41	40	adantl 484	. . . . . . . . 9 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
42	41	adantl 484	. . . . . . . 8 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
43		eqtr2 2844	. . . . . . . . . . . . . 14 ⊢ ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝐼 = 𝑗)
44	43	eqcomd 2829	. . . . . . . . . . . . 13 ⊢ ((𝑖 = 𝐼 ∧ 𝑖 = 𝑗) → 𝑗 = 𝐼)
45	44	ex 415	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝐼 → (𝑖 = 𝑗 → 𝑗 = 𝐼))
46	45	con3d 155	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
47	46	adantr 483	. . . . . . . . . 10 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (¬ 𝑗 = 𝐼 → ¬ 𝑖 = 𝑗))
48	47	impcom 410	. . . . . . . . 9 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → ¬ 𝑖 = 𝑗)
49		iffalse 4478	. . . . . . . . 9 ⊢ (¬ 𝑖 = 𝑗 → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
50	48, 49	syl 17	. . . . . . . 8 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = (0g‘𝑅))
51	42, 50	eqtrd 2858	. . . . . . 7 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → (𝑖 1 𝑗) = (0g‘𝑅))
52		iffalse 4478	. . . . . . . 8 ⊢ (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
53	52	adantr 483	. . . . . . 7 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)) = (𝑖 1 𝑗))
54		iffalse 4478	. . . . . . . 8 ⊢ (¬ 𝑗 = 𝐼 → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
55	54	adantr 483	. . . . . . 7 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = (0g‘𝑅))
56	51, 53, 55	3eqtr4rd 2869	. . . . . 6 ⊢ ((¬ 𝑗 = 𝐼 ∧ (𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
57	30, 56	pm2.61ian 810	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
58	23, 57	eqtrd 2858	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
59		iffalse 4478	. . . . . 6 ⊢ (¬ 𝑖 = 𝐼 → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
60	59	adantr 483	. . . . 5 ⊢ ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = (𝑖𝑋𝑗))
61	2, 3, 5	mat1bas 21060	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
62	61	adantr 483	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 1 ∈ (Base‘(𝑁 Mat 𝑅)))
63		simpr 487	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉) → 𝑍 ∈ 𝑉)
64	63	adantl 484	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → 𝑍 ∈ 𝑉)
65	62, 64, 17	3jca 1124	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁))
66	65	3ad2ant1 1129	. . . . . . . 8 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁))
67		3simpc 1146	. . . . . . . 8 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁))
68	37, 66, 67	3jca 1124	. . . . . . 7 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
69	68	adantl 484	. . . . . 6 ⊢ ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)))
70	2, 3, 4, 5, 19, 1	ma1repveval 21182	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ ( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))))
71	69, 70	syl 17	. . . . 5 ⊢ ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑋𝑗) = if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))))
72	34	ad2antlr 725	. . . . . . . 8 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑁 ∈ Fin)
73	37	ad2antlr 725	. . . . . . . 8 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑅 ∈ Ring)
74	38	ad2antlr 725	. . . . . . . 8 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑖 ∈ 𝑁)
75	39	ad2antlr 725	. . . . . . . 8 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → 𝑗 ∈ 𝑁)
76	2, 31, 19, 72, 73, 74, 75, 5	mat1ov 21059	. . . . . . 7 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 1 𝑗) = if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)))
77		equcom 2025	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 ↔ 𝑗 = 𝑖)
78	77	a1i 11	. . . . . . . 8 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → (𝑖 = 𝑗 ↔ 𝑗 = 𝑖))
79	78	ifbid 4491	. . . . . . 7 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑖 = 𝑗, (1r‘𝑅), (0g‘𝑅)) = if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)))
80	76, 79	eqtr2d 2859	. . . . . 6 ⊢ (((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) ∧ ¬ 𝑗 = 𝐼) → if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅)) = (𝑖 1 𝑗))
81	80	ifeq2da 4500	. . . . 5 ⊢ ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑗 = 𝐼, (𝑍‘𝑖), if(𝑗 = 𝑖, (1r‘𝑅), (0g‘𝑅))) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
82	60, 71, 81	3eqtrd 2862	. . . 4 ⊢ ((¬ 𝑖 = 𝐼 ∧ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
83	58, 82	pm2.61ian 810	. . 3 ⊢ ((((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) ∧ 𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁) → if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗)) = if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗)))
84	83	mpoeq3dva 7233	. 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐼, if(𝑗 = 𝐼, (𝑍‘𝐼), (0g‘𝑅)), (𝑖𝑋𝑗))) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
85		eqid 2823	. . . . 5 ⊢ (𝑁 matRepV 𝑅) = (𝑁 matRepV 𝑅)
86	2, 3, 85, 4	marepvval 21178	. . . 4 ⊢ (( 1 ∈ (Base‘(𝑁 Mat 𝑅)) ∧ 𝑍 ∈ 𝑉 ∧ 𝐼 ∈ 𝑁) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
87	65, 86	syl 17	. . 3 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (( 1 (𝑁 matRepV 𝑅)𝑍)‘𝐼) = (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))))
88	1, 87	syl5req 2871	. 2 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑗 = 𝐼, (𝑍‘𝑖), (𝑖 1 𝑗))) = 𝑋)
89	21, 84, 88	3eqtrd 2862	1 ⊢ (((𝑅 ∈ Ring ∧ 𝑁 ∈ Fin) ∧ (𝐼 ∈ 𝑁 ∧ 𝑍 ∈ 𝑉)) → (𝐼(𝑋(𝑁 matRRep 𝑅)(𝑍‘𝐼))𝐼) = 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ifcif 4469  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158   ∈ cmpo 7160   ↑_m cmap 8408  Fincfn 8511  Basecbs 16485  0_gc0g 16715  1_rcur 19253  Ringcrg 19299   Mat cmat 21018   matRRep cmarrep 21167   matRepV cmatrepV 21168

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-ot 4578  df-uni 4841  df-int 4879  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-om 7583  df-1st 7691  df-2nd 7692  df-supp 7833  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-ixp 8464  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-fsupp 8836  df-sup 8908  df-oi 8976  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-9 11710  df-n0 11901  df-z 11985  df-dec 12102  df-uz 12247  df-fz 12896  df-fzo 13037  df-seq 13373  df-hash 13694  df-struct 16487  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-mulr 16581  df-sca 16583  df-vsca 16584  df-ip 16585  df-tset 16586  df-ple 16587  df-ds 16589  df-hom 16591  df-cco 16592  df-0g 16717  df-gsum 16718  df-prds 16723  df-pws 16725  df-mre 16859  df-mrc 16860  df-acs 16862  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-submnd 17959  df-grp 18108  df-minusg 18109  df-sbg 18110  df-mulg 18227  df-subg 18278  df-ghm 18358  df-cntz 18449  df-cmn 18910  df-abl 18911  df-mgp 19242  df-ur 19254  df-ring 19301  df-subrg 19535  df-lmod 19638  df-lss 19706  df-sra 19946  df-rgmod 19947  df-dsmm 20878  df-frlm 20893  df-mamu 20997  df-mat 21019  df-marrep 21169  df-marepv 21170

This theorem is referenced by:  cramerimplem1  21294