1smat1 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > 1smat1		Structured version Visualization version GIF version

Theorem 1smat1 33750

Description: The submatrix of the identity matrix obtained by removing the ith row and the ith column is an identity matrix. Cf. 1marepvsma1 22610. (Contributed by Thierry Arnoux, 19-Aug-2020.)

**Hypotheses**
Ref	Expression
1smat1.1	⊢ 1 = (1_r‘((1...𝑁) Mat 𝑅))
1smat1.r	⊢ (𝜑 → 𝑅 ∈ Ring)
1smat1.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
1smat1.i	⊢ (𝜑 → 𝐼 ∈ (1...𝑁))

**Assertion**
Ref	Expression
1smat1	⊢ (𝜑 → (𝐼(subMat1‘ 1 )𝐼) = (1_r‘((1...(𝑁 − 1)) Mat 𝑅)))

Proof of Theorem 1smat1 Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2740	. . . . 5 ⊢ (𝐼(subMat1‘ 1 )𝐼) = (𝐼(subMat1‘ 1 )𝐼)
2		1smat1.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ)
3	2	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑁 ∈ ℕ)
4		1smat1.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
5	4	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝐼 ∈ (1...𝑁))
6		1smat1.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ Ring)
7		fzfi 14023	. . . . . . . 8 ⊢ (1...𝑁) ∈ Fin
8		eqid 2740	. . . . . . . . 9 ⊢ ((1...𝑁) Mat 𝑅) = ((1...𝑁) Mat 𝑅)
9		eqid 2740	. . . . . . . . 9 ⊢ (Base‘((1...𝑁) Mat 𝑅)) = (Base‘((1...𝑁) Mat 𝑅))
10		1smat1.1	. . . . . . . . 9 ⊢ 1 = (1_r‘((1...𝑁) Mat 𝑅))
11	8, 9, 10	mat1bas 22476	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ (1...𝑁) ∈ Fin) → 1 ∈ (Base‘((1...𝑁) Mat 𝑅)))
12	6, 7, 11	sylancl 585	. . . . . . 7 ⊢ (𝜑 → 1 ∈ (Base‘((1...𝑁) Mat 𝑅)))
13		eqid 2740	. . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅)
14	8, 13	matbas2 22448	. . . . . . . 8 ⊢ (((1...𝑁) ∈ Fin ∧ 𝑅 ∈ Ring) → ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))) = (Base‘((1...𝑁) Mat 𝑅)))
15	7, 6, 14	sylancr 586	. . . . . . 7 ⊢ (𝜑 → ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))) = (Base‘((1...𝑁) Mat 𝑅)))
16	12, 15	eleqtrrd 2847	. . . . . 6 ⊢ (𝜑 → 1 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
17	16	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 1 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
18		fz1ssnn 13615	. . . . . 6 ⊢ (1...(𝑁 − 1)) ⊆ ℕ
19		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...(𝑁 − 1)))
20	18, 19	sselid 4006	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℕ)
21		simprr 772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...(𝑁 − 1)))
22	18, 21	sselid 4006	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℕ)
23		eqidd 2741	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)))
24		eqidd 2741	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)))
25	1, 3, 3, 5, 5, 17, 20, 22, 23, 24	smatlem 33743	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘ 1 )𝐼)𝑗) = (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) 1 if(𝑗 < 𝐼, 𝑗, (𝑗 + 1))))
26		eqid 2740	. . . . 5 ⊢ (1_r‘𝑅) = (1_r‘𝑅)
27		eqid 2740	. . . . 5 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
28	7	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (1...𝑁) ∈ Fin)
29	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑅 ∈ Ring)
30		nnuz 12946	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
31	20, 30	eleqtrdi 2854	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (ℤ_≥‘1))
32		fznatpl1 13638	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝑖 ∈ (1...(𝑁 − 1))) → (𝑖 + 1) ∈ (1...𝑁))
33	3, 19, 32	syl2anc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖 + 1) ∈ (1...𝑁))
34		peano2fzr 13597	. . . . . . . 8 ⊢ ((𝑖 ∈ (ℤ_≥‘1) ∧ (𝑖 + 1) ∈ (1...𝑁)) → 𝑖 ∈ (1...𝑁))
35	31, 33, 34	syl2anc 583	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...𝑁))
36	35, 33	jca 511	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖 ∈ (1...𝑁) ∧ (𝑖 + 1) ∈ (1...𝑁)))
37		eleq1 2832	. . . . . . 7 ⊢ (𝑖 = if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) → (𝑖 ∈ (1...𝑁) ↔ if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) ∈ (1...𝑁)))
38		eleq1 2832	. . . . . . 7 ⊢ ((𝑖 + 1) = if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) → ((𝑖 + 1) ∈ (1...𝑁) ↔ if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) ∈ (1...𝑁)))
39	37, 38	ifboth 4587	. . . . . 6 ⊢ ((𝑖 ∈ (1...𝑁) ∧ (𝑖 + 1) ∈ (1...𝑁)) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) ∈ (1...𝑁))
40	36, 39	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) ∈ (1...𝑁))
41	22, 30	eleqtrdi 2854	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (ℤ_≥‘1))
42		fznatpl1 13638	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝑗 ∈ (1...(𝑁 − 1))) → (𝑗 + 1) ∈ (1...𝑁))
43	3, 21, 42	syl2anc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑗 + 1) ∈ (1...𝑁))
44		peano2fzr 13597	. . . . . . . 8 ⊢ ((𝑗 ∈ (ℤ_≥‘1) ∧ (𝑗 + 1) ∈ (1...𝑁)) → 𝑗 ∈ (1...𝑁))
45	41, 43, 44	syl2anc 583	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...𝑁))
46	45, 43	jca 511	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑗 ∈ (1...𝑁) ∧ (𝑗 + 1) ∈ (1...𝑁)))
47		eleq1 2832	. . . . . . 7 ⊢ (𝑗 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) → (𝑗 ∈ (1...𝑁) ↔ if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ∈ (1...𝑁)))
48		eleq1 2832	. . . . . . 7 ⊢ ((𝑗 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) → ((𝑗 + 1) ∈ (1...𝑁) ↔ if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ∈ (1...𝑁)))
49	47, 48	ifboth 4587	. . . . . 6 ⊢ ((𝑗 ∈ (1...𝑁) ∧ (𝑗 + 1) ∈ (1...𝑁)) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ∈ (1...𝑁))
50	46, 49	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ∈ (1...𝑁))
51	8, 26, 27, 28, 29, 40, 50, 10	mat1ov 22475	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) 1 if(𝑗 < 𝐼, 𝑗, (𝑗 + 1))) = if(if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)), (1_r‘𝑅), (0_g‘𝑅)))
52		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) → 𝑖 < 𝐼)
53	52	iftrued 4556	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = 𝑖)
54	53	eqeq1d 2742	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1))))
55		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 < 𝐼)
56	55	iftrued 4556	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) = 𝑗)
57	56	eqeq2d 2751	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → (𝑖 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
58		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ¬ 𝑗 < 𝐼)
59	58	iffalsed 4559	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) = (𝑗 + 1))
60	59	eqeq2d 2751	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → (𝑖 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = (𝑗 + 1)))
61	20	nnred 12308	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℝ)
62	61	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 ∈ ℝ)
63		fz1ssnn 13615	. . . . . . . . . . . . . . . . 17 ⊢ (1...𝑁) ⊆ ℕ
64	63, 4	sselid 4006	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐼 ∈ ℕ)
65	64	nnred 12308	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐼 ∈ ℝ)
66	65	ad3antrrr 729	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝐼 ∈ ℝ)
67	22	nnred 12308	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℝ)
68	67	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑗 ∈ ℝ)
69		1red 11291	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 1 ∈ ℝ)
70	68, 69	readdcld 11319	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → (𝑗 + 1) ∈ ℝ)
71	52	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 < 𝐼)
72	64	nnzd 12666	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐼 ∈ ℤ)
73	72	ad3antrrr 729	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝐼 ∈ ℤ)
74	22	nnzd 12666	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℤ)
75	74	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑗 ∈ ℤ)
76	66, 68, 58	nltled 11440	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝐼 ≤ 𝑗)
77		zleltp1 12694	. . . . . . . . . . . . . . . 16 ⊢ ((𝐼 ∈ ℤ ∧ 𝑗 ∈ ℤ) → (𝐼 ≤ 𝑗 ↔ 𝐼 < (𝑗 + 1)))
78	77	biimpa 476	. . . . . . . . . . . . . . 15 ⊢ (((𝐼 ∈ ℤ ∧ 𝑗 ∈ ℤ) ∧ 𝐼 ≤ 𝑗) → 𝐼 < (𝑗 + 1))
79	73, 75, 76, 78	syl21anc 837	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝐼 < (𝑗 + 1))
80	62, 66, 70, 71, 79	lttrd 11451	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 < (𝑗 + 1))
81	62, 80	ltned 11426	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 ≠ (𝑗 + 1))
82	81	neneqd 2951	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ¬ 𝑖 = (𝑗 + 1))
83	62, 66, 68, 71, 76	ltletrd 11450	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 < 𝑗)
84	62, 83	ltned 11426	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → 𝑖 ≠ 𝑗)
85	84	neneqd 2951	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ¬ 𝑖 = 𝑗)
86	82, 85	2falsed 376	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → (𝑖 = (𝑗 + 1) ↔ 𝑖 = 𝑗))
87	60, 86	bitrd 279	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → (𝑖 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
88	57, 87	pm2.61dan 812	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) → (𝑖 = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
89	54, 88	bitrd 279	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ 𝑖 < 𝐼) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
90		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) → ¬ 𝑖 < 𝐼)
91	90	iffalsed 4559	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = (𝑖 + 1))
92	91	eqeq1d 2742	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ (𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1))))
93		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 < 𝐼)
94	93	iftrued 4556	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) = 𝑗)
95	94	eqeq2d 2751	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ((𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ (𝑖 + 1) = 𝑗))
96	67	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 ∈ ℝ)
97	65	ad3antrrr 729	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝐼 ∈ ℝ)
98	61	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑖 ∈ ℝ)
99		1red 11291	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 1 ∈ ℝ)
100	98, 99	readdcld 11319	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → (𝑖 + 1) ∈ ℝ)
101	72	ad3antrrr 729	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝐼 ∈ ℤ)
102	20	nnzd 12666	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℤ)
103	102	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑖 ∈ ℤ)
104	90	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ¬ 𝑖 < 𝐼)
105	97, 98, 104	nltled 11440	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝐼 ≤ 𝑖)
106		zleltp1 12694	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐼 ∈ ℤ ∧ 𝑖 ∈ ℤ) → (𝐼 ≤ 𝑖 ↔ 𝐼 < (𝑖 + 1)))
107	106	biimpa 476	. . . . . . . . . . . . . . . 16 ⊢ (((𝐼 ∈ ℤ ∧ 𝑖 ∈ ℤ) ∧ 𝐼 ≤ 𝑖) → 𝐼 < (𝑖 + 1))
108	101, 103, 105, 107	syl21anc 837	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝐼 < (𝑖 + 1))
109	96, 97, 100, 93, 108	lttrd 11451	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 < (𝑖 + 1))
110	96, 109	ltned 11426	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 ≠ (𝑖 + 1))
111	110	necomd 3002	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → (𝑖 + 1) ≠ 𝑗)
112	111	neneqd 2951	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ¬ (𝑖 + 1) = 𝑗)
113	96, 97, 98, 93, 105	ltletrd 11450	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 < 𝑖)
114	96, 113	ltned 11426	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑗 ≠ 𝑖)
115	114	necomd 3002	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → 𝑖 ≠ 𝑗)
116	115	neneqd 2951	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ¬ 𝑖 = 𝑗)
117	112, 116	2falsed 376	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ((𝑖 + 1) = 𝑗 ↔ 𝑖 = 𝑗))
118	95, 117	bitrd 279	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ 𝑗 < 𝐼) → ((𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
119		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ¬ 𝑗 < 𝐼)
120	119	iffalsed 4559	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) = (𝑗 + 1))
121	120	eqeq2d 2751	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ((𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ (𝑖 + 1) = (𝑗 + 1)))
122	20	nncnd 12309	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℂ)
123	122	ad3antrrr 729	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ (𝑖 + 1) = (𝑗 + 1)) → 𝑖 ∈ ℂ)
124	22	nncnd 12309	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℂ)
125	124	ad3antrrr 729	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ (𝑖 + 1) = (𝑗 + 1)) → 𝑗 ∈ ℂ)
126		1cnd 11285	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ (𝑖 + 1) = (𝑗 + 1)) → 1 ∈ ℂ)
127		simpr 484	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ (𝑖 + 1) = (𝑗 + 1)) → (𝑖 + 1) = (𝑗 + 1))
128	123, 125, 126, 127	addcan2ad 11496	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ (𝑖 + 1) = (𝑗 + 1)) → 𝑖 = 𝑗)
129		simpr 484	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ 𝑖 = 𝑗) → 𝑖 = 𝑗)
130	129	oveq1d 7463	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) ∧ 𝑖 = 𝑗) → (𝑖 + 1) = (𝑗 + 1))
131	128, 130	impbida 800	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ((𝑖 + 1) = (𝑗 + 1) ↔ 𝑖 = 𝑗))
132	121, 131	bitrd 279	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) ∧ ¬ 𝑗 < 𝐼) → ((𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
133	118, 132	pm2.61dan 812	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) → ((𝑖 + 1) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
134	92, 133	bitrd 279	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) ∧ ¬ 𝑖 < 𝐼) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
135	89, 134	pm2.61dan 812	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)) ↔ 𝑖 = 𝑗))
136	135	ifbid 4571	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)), (1_r‘𝑅), (0_g‘𝑅)) = if(𝑖 = 𝑗, (1_r‘𝑅), (0_g‘𝑅)))
137		eqid 2740	. . . . . 6 ⊢ ((1...(𝑁 − 1)) Mat 𝑅) = ((1...(𝑁 − 1)) Mat 𝑅)
138		fzfid 14024	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (1...(𝑁 − 1)) ∈ Fin)
139		eqid 2740	. . . . . 6 ⊢ (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) = (1_r‘((1...(𝑁 − 1)) Mat 𝑅))
140	137, 26, 27, 138, 29, 19, 21, 139	mat1ov 22475	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗) = if(𝑖 = 𝑗, (1_r‘𝑅), (0_g‘𝑅)))
141	136, 140	eqtr4d 2783	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑗 < 𝐼, 𝑗, (𝑗 + 1)), (1_r‘𝑅), (0_g‘𝑅)) = (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗))
142	25, 51, 141	3eqtrd 2784	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘ 1 )𝐼)𝑗) = (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗))
143	142	ralrimivva 3208	. 2 ⊢ (𝜑 → ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘ 1 )𝐼)𝑗) = (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗))
144	1, 2, 2, 4, 4, 16	smatrcl 33742	. . . 4 ⊢ (𝜑 → (𝐼(subMat1‘ 1 )𝐼) ∈ ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
145		elmapfn 8923	. . . 4 ⊢ ((𝐼(subMat1‘ 1 )𝐼) ∈ ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) → (𝐼(subMat1‘ 1 )𝐼) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))
146	144, 145	syl 17	. . 3 ⊢ (𝜑 → (𝐼(subMat1‘ 1 )𝐼) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))
147		fzfi 14023	. . . . . 6 ⊢ (1...(𝑁 − 1)) ∈ Fin
148		eqid 2740	. . . . . . 7 ⊢ (Base‘((1...(𝑁 − 1)) Mat 𝑅)) = (Base‘((1...(𝑁 − 1)) Mat 𝑅))
149	137, 148, 139	mat1bas 22476	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ (1...(𝑁 − 1)) ∈ Fin) → (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
150	6, 147, 149	sylancl 585	. . . . 5 ⊢ (𝜑 → (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
151	137, 13	matbas2 22448	. . . . . 6 ⊢ (((1...(𝑁 − 1)) ∈ Fin ∧ 𝑅 ∈ Ring) → ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) = (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
152	147, 6, 151	sylancr 586	. . . . 5 ⊢ (𝜑 → ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) = (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
153	150, 152	eleqtrrd 2847	. . . 4 ⊢ (𝜑 → (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ∈ ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
154		elmapfn 8923	. . . 4 ⊢ ((1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ∈ ((Base‘𝑅) ↑_m ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) → (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))
155	153, 154	syl 17	. . 3 ⊢ (𝜑 → (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))
156		eqfnov2 7580	. . 3 ⊢ (((𝐼(subMat1‘ 1 )𝐼) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1))) ∧ (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) Fn ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) → ((𝐼(subMat1‘ 1 )𝐼) = (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ↔ ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘ 1 )𝐼)𝑗) = (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗)))
157	146, 155, 156	syl2anc 583	. 2 ⊢ (𝜑 → ((𝐼(subMat1‘ 1 )𝐼) = (1_r‘((1...(𝑁 − 1)) Mat 𝑅)) ↔ ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘ 1 )𝐼)𝑗) = (𝑖(1_r‘((1...(𝑁 − 1)) Mat 𝑅))𝑗)))
158	143, 157	mpbird 257	1 ⊢ (𝜑 → (𝐼(subMat1‘ 1 )𝐼) = (1_r‘((1...(𝑁 − 1)) Mat 𝑅)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ifcif 4548 class class class wbr 5166 × cxp 5698 Fn wfn 6568 ‘cfv 6573 (class class class)co 7448 ↑_m cmap 8884 Fincfn 9003 ℂcc 11182 ℝcr 11183 1c1 11185 + caddc 11187 < clt 11324 ≤ cle 11325 − cmin 11520 ℕcn 12293 ℤcz 12639 ℤ_≥cuz 12903 ...cfz 13567 Basecbs 17258 0_gc0g 17499 1_rcur 20208 Ringcrg 20260 Mat cmat 22432 subMat1csmat 33739

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-sup 9511 df-oi 9579 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-fzo 13712 df-seq 14053 df-hash 14380 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-hom 17335 df-cco 17336 df-0g 17501 df-gsum 17502 df-prds 17507 df-pws 17509 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-mhm 18818 df-submnd 18819 df-grp 18976 df-minusg 18977 df-sbg 18978 df-mulg 19108 df-subg 19163 df-ghm 19253 df-cntz 19357 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-subrg 20597 df-lmod 20882 df-lss 20953 df-sra 21195 df-rgmod 21196 df-dsmm 21775 df-frlm 21790 df-mamu 22416 df-mat 22433 df-smat 33740

This theorem is referenced by: (None)

W3C validator