madjusmdetlem3 - Mathbox for Thierry Arnoux

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

Theorem madjusmdetlem3 34228

Description: Lemma for madjusmdet 34230. (Contributed by Thierry Arnoux, 27-Aug-2020.)

**Hypotheses**
Ref	Expression
madjusmdet.b	⊢ 𝐵 = (Base‘𝐴)
madjusmdet.a	⊢ 𝐴 = ((1...𝑁) Mat 𝑅)
madjusmdet.d	⊢ 𝐷 = ((1...𝑁) maDet 𝑅)
madjusmdet.k	⊢ 𝐾 = ((1...𝑁) maAdju 𝑅)
madjusmdet.t	⊢ · = (._r‘𝑅)
madjusmdet.z	⊢ 𝑍 = (ℤRHom‘𝑅)
madjusmdet.e	⊢ 𝐸 = ((1...(𝑁 − 1)) maDet 𝑅)
madjusmdet.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
madjusmdet.r	⊢ (𝜑 → 𝑅 ∈ CRing)
madjusmdet.i	⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
madjusmdet.j	⊢ (𝜑 → 𝐽 ∈ (1...𝑁))
madjusmdet.m	⊢ (𝜑 → 𝑀 ∈ 𝐵)
madjusmdetlem2.p	⊢ 𝑃 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
madjusmdetlem2.s	⊢ 𝑆 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖)))
madjusmdetlem4.q	⊢ 𝑄 = (𝑗 ∈ (1...𝑁) ↦ if(𝑗 = 1, 𝐽, if(𝑗 ≤ 𝐽, (𝑗 − 1), 𝑗)))
madjusmdetlem4.t	⊢ 𝑇 = (𝑗 ∈ (1...𝑁) ↦ if(𝑗 = 1, 𝑁, if(𝑗 ≤ 𝑁, (𝑗 − 1), 𝑗)))
madjusmdetlem3.w	⊢ 𝑊 = (𝑖 ∈ (1...𝑁), 𝑗 ∈ (1...𝑁) ↦ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
madjusmdetlem3.u	⊢ (𝜑 → 𝑈 ∈ 𝐵)

**Assertion**
Ref	Expression
madjusmdetlem3	⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) = (𝑁(subMat1‘𝑊)𝑁))

Distinct variable groups: 𝐵,𝑖,𝑗 𝑖,𝐼,𝑗 𝑖,𝐽,𝑗 𝑖,𝑀,𝑗 𝑖,𝑁,𝑗 𝑃,𝑖,𝑗 𝑄,𝑖,𝑗 𝑅,𝑖,𝑗 𝜑,𝑖,𝑗 𝑆,𝑖,𝑗 𝑇,𝑖,𝑗 𝑈,𝑖,𝑗 𝑖,𝑊,𝑗 Allowed substitution hints: 𝐴(𝑖, 𝑗) 𝐷(𝑖, 𝑗) · (𝑖, 𝑗) 𝐸(𝑖, 𝑗) 𝐾(𝑖, 𝑗) 𝑍(𝑖, 𝑗)

**Proof of Theorem madjusmdetlem3**
Step	Hyp	Ref	Expression
1		madjusmdet.n	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ)
2		nnuz 12907	. . . . . . . . . . 11 ⊢ ℕ = (ℤ_≥‘1)
3	1, 2	eleqtrdi 2872	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
4		fzdif2 33146	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘1) → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
5	3, 4	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
6		difss 4089	. . . . . . . . 9 ⊢ ((1...𝑁) ∖ {𝑁}) ⊆ (1...𝑁)
7	5, 6	eqsstrrdi 3981	. . . . . . . 8 ⊢ (𝜑 → (1...(𝑁 − 1)) ⊆ (1...𝑁))
8	7	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (1...(𝑁 − 1)) ⊆ (1...𝑁))
9		simprl 782	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...(𝑁 − 1)))
10	8, 9	sseldd 3937	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...𝑁))
11		simprr 784	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...(𝑁 − 1)))
12	8, 11	sseldd 3937	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...𝑁))
13		ovexd 7447	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ V)
14		madjusmdetlem3.w	. . . . . . 7 ⊢ 𝑊 = (𝑖 ∈ (1...𝑁), 𝑗 ∈ (1...𝑁) ↦ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
15	14	ovmpt4g 7559	. . . . . 6 ⊢ ((𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁) ∧ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ V) → (𝑖𝑊𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
16	10, 12, 13, 15	syl3anc 1397	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖𝑊𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
17	9, 11	ovresd 7579	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗) = (𝑖𝑊𝑗))
18		eqid 2762	. . . . . . 7 ⊢ (𝐼(subMat1‘𝑈)𝐽) = (𝐼(subMat1‘𝑈)𝐽)
19	1	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑁 ∈ ℕ)
20		madjusmdet.i	. . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
21	20	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝐼 ∈ (1...𝑁))
22		madjusmdet.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (1...𝑁))
23	22	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝐽 ∈ (1...𝑁))
24		madjusmdetlem3.u	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝐵)
25		madjusmdet.a	. . . . . . . . . 10 ⊢ 𝐴 = ((1...𝑁) Mat 𝑅)
26		eqid 2762	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
27		madjusmdet.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐴)
28	25, 26, 27	matbas2i 22590	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐵 → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
29	24, 28	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
30	29	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
31		fz1ssnn 13590	. . . . . . . 8 ⊢ (1...𝑁) ⊆ ℕ
32	31, 10	sselid 3934	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℕ)
33	31, 12	sselid 3934	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℕ)
34		eqidd 2763	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)))
35		eqidd 2763	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)))
36	18, 19, 19, 21, 23, 30, 32, 33, 34, 35	smatlem 34196	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1))𝑈if(𝑗 < 𝐽, 𝑗, (𝑗 + 1))))
37		madjusmdet.d	. . . . . . . . 9 ⊢ 𝐷 = ((1...𝑁) maDet 𝑅)
38		madjusmdet.k	. . . . . . . . 9 ⊢ 𝐾 = ((1...𝑁) maAdju 𝑅)
39		madjusmdet.t	. . . . . . . . 9 ⊢ · = (._r‘𝑅)
40		madjusmdet.z	. . . . . . . . 9 ⊢ 𝑍 = (ℤRHom‘𝑅)
41		madjusmdet.e	. . . . . . . . 9 ⊢ 𝐸 = ((1...(𝑁 − 1)) maDet 𝑅)
42		madjusmdet.r	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ CRing)
43		madjusmdet.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ 𝐵)
44		madjusmdetlem2.p	. . . . . . . . 9 ⊢ 𝑃 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
45		madjusmdetlem2.s	. . . . . . . . 9 ⊢ 𝑆 = (𝑖 ∈ (1...𝑁) ↦ if(𝑖 = 1, 𝑁, if(𝑖 ≤ 𝑁, (𝑖 − 1), 𝑖)))
46	27, 25, 37, 38, 39, 40, 41, 1, 42, 20, 20, 43, 44, 45	madjusmdetlem2 34227	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...(𝑁 − 1))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = ((𝑃 ∘ ^◡𝑆)‘𝑖))
47	9, 46	syldan 602	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = ((𝑃 ∘ ^◡𝑆)‘𝑖))
48		madjusmdetlem4.q	. . . . . . . . 9 ⊢ 𝑄 = (𝑗 ∈ (1...𝑁) ↦ if(𝑗 = 1, 𝐽, if(𝑗 ≤ 𝐽, (𝑗 − 1), 𝑗)))
49		madjusmdetlem4.t	. . . . . . . . 9 ⊢ 𝑇 = (𝑗 ∈ (1...𝑁) ↦ if(𝑗 = 1, 𝑁, if(𝑗 ≤ 𝑁, (𝑗 − 1), 𝑗)))
50	27, 25, 37, 38, 39, 40, 41, 1, 42, 22, 22, 43, 48, 49	madjusmdetlem2 34227	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...(𝑁 − 1))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = ((𝑄 ∘ ^◡𝑇)‘𝑗))
51	11, 50	syldan 602	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = ((𝑄 ∘ ^◡𝑇)‘𝑗))
52	47, 51	oveq12d 7430	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1))𝑈if(𝑗 < 𝐽, 𝑗, (𝑗 + 1))) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
53	36, 52	eqtrd 2797	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
54	16, 17, 53	3eqtr4rd 2808	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗))
55	54	ralrimivva 3207	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗))
56		eqid 2762	. . . . 5 ⊢ (Base‘((1...(𝑁 − 1)) Mat 𝑅)) = (Base‘((1...(𝑁 − 1)) Mat 𝑅))
57	25, 27, 56, 18, 1, 20, 22, 24	smatcl 34201	. . . 4 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
58		fzfid 14016	. . . . . . . 8 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
59		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (1...𝑁) = (1...𝑁)
60		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (SymGrp‘(1...𝑁)) = (SymGrp‘(1...𝑁))
61		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (Base‘(SymGrp‘(1...𝑁))) = (Base‘(SymGrp‘(1...𝑁)))
62	59, 44, 60, 61	fzto1st 33432	. . . . . . . . . . . . 13 ⊢ (𝐼 ∈ (1...𝑁) → 𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))))
63	20, 62	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))))
64		eluzfz2 13566	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 𝑁 ∈ (1...𝑁))
65	3, 64	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ (1...𝑁))
66	59, 45, 60, 61	fzto1st 33432	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (1...𝑁) → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
67	65, 66	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
68		eqid 2762	. . . . . . . . . . . . . . 15 ⊢ (inv_g‘(SymGrp‘(1...𝑁))) = (inv_g‘(SymGrp‘(1...𝑁)))
69	60, 61, 68	symginv 19478	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) = ^◡𝑆)
70	67, 69	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) = ^◡𝑆)
71	60	symggrp 19476	. . . . . . . . . . . . . . 15 ⊢ ((1...𝑁) ∈ Fin → (SymGrp‘(1...𝑁)) ∈ Grp)
72	58, 71	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (SymGrp‘(1...𝑁)) ∈ Grp)
73	61, 68	grpinvcl 19060	. . . . . . . . . . . . . 14 ⊢ (((SymGrp‘(1...𝑁)) ∈ Grp ∧ 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
74	72, 67, 73	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
75	70, 74	eqeltrrd 2863	. . . . . . . . . . . 12 ⊢ (𝜑 → ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
76		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (+_g‘(SymGrp‘(1...𝑁))) = (+_g‘(SymGrp‘(1...𝑁)))
77	60, 61, 76	symgov 19460	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃(+_g‘(SymGrp‘(1...𝑁)))^◡𝑆) = (𝑃 ∘ ^◡𝑆))
78	60, 61, 76	symgcl 19461	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃(+_g‘(SymGrp‘(1...𝑁)))^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
79	77, 78	eqeltrrd 2863	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
80	63, 75, 79	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
81	80	3ad2ant1 1150	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
82		simp2 1154	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑖 ∈ (1...𝑁))
83	60, 61	symgfv 19456	. . . . . . . . . 10 ⊢ (((𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ 𝑖 ∈ (1...𝑁)) → ((𝑃 ∘ ^◡𝑆)‘𝑖) ∈ (1...𝑁))
84	81, 82, 83	syl2anc 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑃 ∘ ^◡𝑆)‘𝑖) ∈ (1...𝑁))
85	59, 48, 60, 61	fzto1st 33432	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (1...𝑁) → 𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))))
86	22, 85	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))))
87	59, 49, 60, 61	fzto1st 33432	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (1...𝑁) → 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
88	65, 87	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
89	60, 61, 68	symginv 19478	. . . . . . . . . . . . . 14 ⊢ (𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) = ^◡𝑇)
90	88, 89	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) = ^◡𝑇)
91	61, 68	grpinvcl 19060	. . . . . . . . . . . . . 14 ⊢ (((SymGrp‘(1...𝑁)) ∈ Grp ∧ 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
92	72, 88, 91	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
93	90, 92	eqeltrrd 2863	. . . . . . . . . . . 12 ⊢ (𝜑 → ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
94	60, 61, 76	symgov 19460	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄(+_g‘(SymGrp‘(1...𝑁)))^◡𝑇) = (𝑄 ∘ ^◡𝑇))
95	60, 61, 76	symgcl 19461	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄(+_g‘(SymGrp‘(1...𝑁)))^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
96	94, 95	eqeltrrd 2863	. . . . . . . . . . . 12 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
97	86, 93, 96	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
98	97	3ad2ant1 1150	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
99		simp3 1155	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑗 ∈ (1...𝑁))
100	60, 61	symgfv 19456	. . . . . . . . . 10 ⊢ (((𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑄 ∘ ^◡𝑇)‘𝑗) ∈ (1...𝑁))
101	98, 99, 100	syl2anc 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑄 ∘ ^◡𝑇)‘𝑗) ∈ (1...𝑁))
102	24	3ad2ant1 1150	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑈 ∈ 𝐵)
103	25, 26, 27, 84, 101, 102	matecld 22594	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ (Base‘𝑅))
104	25, 26, 27, 58, 42, 103	matbas2d 22591	. . . . . . 7 ⊢ (𝜑 → (𝑖 ∈ (1...𝑁), 𝑗 ∈ (1...𝑁) ↦ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗))) ∈ 𝐵)
105	14, 104	eqeltrid 2866	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ 𝐵)
106	25, 27	submatres 34205	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝑊 ∈ 𝐵) → (𝑁(subMat1‘𝑊)𝑁) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
107	1, 105, 106	syl2anc 595	. . . . 5 ⊢ (𝜑 → (𝑁(subMat1‘𝑊)𝑁) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
108		eqid 2762	. . . . . 6 ⊢ (𝑁(subMat1‘𝑊)𝑁) = (𝑁(subMat1‘𝑊)𝑁)
109	25, 27, 56, 108, 1, 65, 65, 105	smatcl 34201	. . . . 5 ⊢ (𝜑 → (𝑁(subMat1‘𝑊)𝑁) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
110	107, 109	eqeltrrd 2863	. . . 4 ⊢ (𝜑 → (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
111		eqid 2762	. . . . 5 ⊢ ((1...(𝑁 − 1)) Mat 𝑅) = ((1...(𝑁 − 1)) Mat 𝑅)
112	111, 56	eqmat 22592	. . . 4 ⊢ (((𝐼(subMat1‘𝑈)𝐽) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)) ∧ (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅))) → ((𝐼(subMat1‘𝑈)𝐽) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ↔ ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗)))
113	57, 110, 112	syl2anc 595	. . 3 ⊢ (𝜑 → ((𝐼(subMat1‘𝑈)𝐽) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ↔ ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗)))
114	55, 113	mpbird 260	. 2 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
115	114, 107	eqtr4d 2800	1 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) = (𝑁(subMat1‘𝑊)𝑁))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ∀wral 3078 Vcvv 3454 ∖ cdif 3901 ⊆ wss 3904 ifcif 4486 {csn 4588 class class class wbr 5108 ↦ cmpt 5191 × cxp 5658 ^◡ccnv 5659 ↾ cres 5662 ∘ ccom 5664 ‘cfv 6536 (class class class)co 7412 ∈ cmpo 7414 ↑_m cmap 8822 Fincfn 8941 1c1 11107 + caddc 11109 < clt 11249 ≤ cle 11250 − cmin 11447 ℕcn 12239 ℤ_≥cuz 12868 ...cfz 13541 Basecbs 17275 +_gcplusg 17316 ._rcmulr 17317 Grpcgrp 19006 inv_gcminusg 19007 SymGrpcsymg 19445 CRingccrg 20322 ℤRHomczrh 21660 Mat cmat 22575 maDet cmdat 22752 maAdju cmadu 22800 subMat1csmat 34192

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-ot 4597 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-supp 8155 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-er 8692 df-map 8824 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9320 df-sup 9400 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-z 12598 df-dec 12718 df-uz 12869 df-rp 13023 df-fz 13542 df-fzo 13690 df-struct 17213 df-sets 17230 df-slot 17248 df-ndx 17260 df-base 17276 df-ress 17297 df-plusg 17329 df-mulr 17330 df-sca 17332 df-vsca 17333 df-ip 17334 df-tset 17335 df-ple 17336 df-ds 17338 df-hom 17340 df-cco 17341 df-0g 17500 df-prds 17506 df-pws 17508 df-mgm 18704 df-sgrp 18783 df-mnd 18799 df-submnd 18848 df-efmnd 18934 df-grp 19009 df-minusg 19010 df-symg 19446 df-pmtr 19518 df-sra 21305 df-rgmod 21306 df-dsmm 21893 df-frlm 21908 df-mat 22576 df-subma 22745 df-smat 34193

This theorem is used by: madjusmdetlem4 34229

W3C validator