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 32410

Description: Lemma for madjusmdet 32412. (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 12806	. . . . . . . . . . 11 ⊢ ℕ = (ℤ_≥‘1)
3	1, 2	eleqtrdi 2848	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
4		fzdif2 31694	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘1) → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
5	3, 4	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝑁) ∖ {𝑁}) = (1...(𝑁 − 1)))
6		difss 4091	. . . . . . . . 9 ⊢ ((1...𝑁) ∖ {𝑁}) ⊆ (1...𝑁)
7	5, 6	eqsstrrdi 3999	. . . . . . . 8 ⊢ (𝜑 → (1...(𝑁 − 1)) ⊆ (1...𝑁))
8	7	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (1...(𝑁 − 1)) ⊆ (1...𝑁))
9		simprl 769	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...(𝑁 − 1)))
10	8, 9	sseldd 3945	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ (1...𝑁))
11		simprr 771	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...(𝑁 − 1)))
12	8, 11	sseldd 3945	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ (1...𝑁))
13		ovexd 7392	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ V)
14		madjusmdetlem3.w	. . . . . . 7 ⊢ 𝑊 = (𝑖 ∈ (1...𝑁), 𝑗 ∈ (1...𝑁) ↦ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
15	14	ovmpt4g 7502	. . . . . 6 ⊢ ((𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁) ∧ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ V) → (𝑖𝑊𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
16	10, 12, 13, 15	syl3anc 1371	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖𝑊𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
17	9, 11	ovresd 7521	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗) = (𝑖𝑊𝑗))
18		eqid 2736	. . . . . . 7 ⊢ (𝐼(subMat1‘𝑈)𝐽) = (𝐼(subMat1‘𝑈)𝐽)
19	1	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑁 ∈ ℕ)
20		madjusmdet.i	. . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
21	20	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝐼 ∈ (1...𝑁))
22		madjusmdet.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (1...𝑁))
23	22	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝐽 ∈ (1...𝑁))
24		madjusmdetlem3.u	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝐵)
25		madjusmdet.a	. . . . . . . . . 10 ⊢ 𝐴 = ((1...𝑁) Mat 𝑅)
26		eqid 2736	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅)
27		madjusmdet.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐴)
28	25, 26, 27	matbas2i 21771	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐵 → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
29	24, 28	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
30	29	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑈 ∈ ((Base‘𝑅) ↑_m ((1...𝑁) × (1...𝑁))))
31		fz1ssnn 13472	. . . . . . . 8 ⊢ (1...𝑁) ⊆ ℕ
32	31, 10	sselid 3942	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑖 ∈ ℕ)
33	31, 12	sselid 3942	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → 𝑗 ∈ ℕ)
34		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)))
35		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)))
36	18, 19, 19, 21, 23, 30, 32, 33, 34, 35	smatlem 32378	. . . . . 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 32409	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...(𝑁 − 1))) → if(𝑖 < 𝐼, 𝑖, (𝑖 + 1)) = ((𝑃 ∘ ^◡𝑆)‘𝑖))
47	9, 46	syldan 591	. . . . . . 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 32409	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...(𝑁 − 1))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = ((𝑄 ∘ ^◡𝑇)‘𝑗))
51	11, 50	syldan 591	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → if(𝑗 < 𝐽, 𝑗, (𝑗 + 1)) = ((𝑄 ∘ ^◡𝑇)‘𝑗))
52	47, 51	oveq12d 7375	. . . . . 6 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (if(𝑖 < 𝐼, 𝑖, (𝑖 + 1))𝑈if(𝑗 < 𝐽, 𝑗, (𝑗 + 1))) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
53	36, 52	eqtrd 2776	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)))
54	16, 17, 53	3eqtr4rd 2787	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ (1...(𝑁 − 1)) ∧ 𝑗 ∈ (1...(𝑁 − 1)))) → (𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗))
55	54	ralrimivva 3197	. . 3 ⊢ (𝜑 → ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗))
56		eqid 2736	. . . . 5 ⊢ (Base‘((1...(𝑁 − 1)) Mat 𝑅)) = (Base‘((1...(𝑁 − 1)) Mat 𝑅))
57	25, 27, 56, 18, 1, 20, 22, 24	smatcl 32383	. . . 4 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
58		fzfid 13878	. . . . . . . 8 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
59		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (1...𝑁) = (1...𝑁)
60		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (SymGrp‘(1...𝑁)) = (SymGrp‘(1...𝑁))
61		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (Base‘(SymGrp‘(1...𝑁))) = (Base‘(SymGrp‘(1...𝑁)))
62	59, 44, 60, 61	fzto1st 31952	. . . . . . . . . . . . 13 ⊢ (𝐼 ∈ (1...𝑁) → 𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))))
63	20, 62	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))))
64		eluzfz2 13449	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 𝑁 ∈ (1...𝑁))
65	3, 64	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ (1...𝑁))
66	59, 45, 60, 61	fzto1st 31952	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (1...𝑁) → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
67	65, 66	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
68		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (inv_g‘(SymGrp‘(1...𝑁))) = (inv_g‘(SymGrp‘(1...𝑁)))
69	60, 61, 68	symginv 19184	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) = ^◡𝑆)
70	67, 69	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) = ^◡𝑆)
71	60	symggrp 19182	. . . . . . . . . . . . . . 15 ⊢ ((1...𝑁) ∈ Fin → (SymGrp‘(1...𝑁)) ∈ Grp)
72	58, 71	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (SymGrp‘(1...𝑁)) ∈ Grp)
73	61, 68	grpinvcl 18798	. . . . . . . . . . . . . 14 ⊢ (((SymGrp‘(1...𝑁)) ∈ Grp ∧ 𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
74	72, 67, 73	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
75	70, 74	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ (𝜑 → ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁))))
76		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (+_g‘(SymGrp‘(1...𝑁))) = (+_g‘(SymGrp‘(1...𝑁)))
77	60, 61, 76	symgov 19165	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃(+_g‘(SymGrp‘(1...𝑁)))^◡𝑆) = (𝑃 ∘ ^◡𝑆))
78	60, 61, 76	symgcl 19166	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃(+_g‘(SymGrp‘(1...𝑁)))^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
79	77, 78	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑆 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
80	63, 75, 79	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
81	80	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))))
82		simp2 1137	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑖 ∈ (1...𝑁))
83	60, 61	symgfv 19161	. . . . . . . . . 10 ⊢ (((𝑃 ∘ ^◡𝑆) ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ 𝑖 ∈ (1...𝑁)) → ((𝑃 ∘ ^◡𝑆)‘𝑖) ∈ (1...𝑁))
84	81, 82, 83	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑃 ∘ ^◡𝑆)‘𝑖) ∈ (1...𝑁))
85	59, 48, 60, 61	fzto1st 31952	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (1...𝑁) → 𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))))
86	22, 85	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))))
87	59, 49, 60, 61	fzto1st 31952	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (1...𝑁) → 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
88	65, 87	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
89	60, 61, 68	symginv 19184	. . . . . . . . . . . . . 14 ⊢ (𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) = ^◡𝑇)
90	88, 89	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) = ^◡𝑇)
91	61, 68	grpinvcl 18798	. . . . . . . . . . . . . 14 ⊢ (((SymGrp‘(1...𝑁)) ∈ Grp ∧ 𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
92	72, 88, 91	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((inv_g‘(SymGrp‘(1...𝑁)))‘𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
93	90, 92	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ (𝜑 → ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁))))
94	60, 61, 76	symgov 19165	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄(+_g‘(SymGrp‘(1...𝑁)))^◡𝑇) = (𝑄 ∘ ^◡𝑇))
95	60, 61, 76	symgcl 19166	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄(+_g‘(SymGrp‘(1...𝑁)))^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
96	94, 95	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ ((𝑄 ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ ^◡𝑇 ∈ (Base‘(SymGrp‘(1...𝑁)))) → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
97	86, 93, 96	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
98	97	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))))
99		simp3 1138	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑗 ∈ (1...𝑁))
100	60, 61	symgfv 19161	. . . . . . . . . 10 ⊢ (((𝑄 ∘ ^◡𝑇) ∈ (Base‘(SymGrp‘(1...𝑁))) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑄 ∘ ^◡𝑇)‘𝑗) ∈ (1...𝑁))
101	98, 99, 100	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → ((𝑄 ∘ ^◡𝑇)‘𝑗) ∈ (1...𝑁))
102	24	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → 𝑈 ∈ 𝐵)
103	25, 26, 27, 84, 101, 102	matecld 21775	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑁) ∧ 𝑗 ∈ (1...𝑁)) → (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗)) ∈ (Base‘𝑅))
104	25, 26, 27, 58, 42, 103	matbas2d 21772	. . . . . . 7 ⊢ (𝜑 → (𝑖 ∈ (1...𝑁), 𝑗 ∈ (1...𝑁) ↦ (((𝑃 ∘ ^◡𝑆)‘𝑖)𝑈((𝑄 ∘ ^◡𝑇)‘𝑗))) ∈ 𝐵)
105	14, 104	eqeltrid 2842	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ 𝐵)
106	25, 27	submatres 32387	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝑊 ∈ 𝐵) → (𝑁(subMat1‘𝑊)𝑁) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
107	1, 105, 106	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁(subMat1‘𝑊)𝑁) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
108		eqid 2736	. . . . . 6 ⊢ (𝑁(subMat1‘𝑊)𝑁) = (𝑁(subMat1‘𝑊)𝑁)
109	25, 27, 56, 108, 1, 65, 65, 105	smatcl 32383	. . . . 5 ⊢ (𝜑 → (𝑁(subMat1‘𝑊)𝑁) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
110	107, 109	eqeltrrd 2839	. . . 4 ⊢ (𝜑 → (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ∈ (Base‘((1...(𝑁 − 1)) Mat 𝑅)))
111		eqid 2736	. . . . 5 ⊢ ((1...(𝑁 − 1)) Mat 𝑅) = ((1...(𝑁 − 1)) Mat 𝑅)
112	111, 56	eqmat 21773	. . . 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 584	. . 3 ⊢ (𝜑 → ((𝐼(subMat1‘𝑈)𝐽) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))) ↔ ∀𝑖 ∈ (1...(𝑁 − 1))∀𝑗 ∈ (1...(𝑁 − 1))(𝑖(𝐼(subMat1‘𝑈)𝐽)𝑗) = (𝑖(𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1))))𝑗)))
114	55, 113	mpbird 256	. 2 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) = (𝑊 ↾ ((1...(𝑁 − 1)) × (1...(𝑁 − 1)))))
115	114, 107	eqtr4d 2779	1 ⊢ (𝜑 → (𝐼(subMat1‘𝑈)𝐽) = (𝑁(subMat1‘𝑊)𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3064 Vcvv 3445 ∖ cdif 3907 ⊆ wss 3910 ifcif 4486 {csn 4586 class class class wbr 5105 ↦ cmpt 5188 × cxp 5631 ^◡ccnv 5632 ↾ cres 5635 ∘ ccom 5637 ‘cfv 6496 (class class class)co 7357 ∈ cmpo 7359 ↑_m cmap 8765 Fincfn 8883 1c1 11052 + caddc 11054 < clt 11189 ≤ cle 11190 − cmin 11385 ℕcn 12153 ℤ_≥cuz 12763 ...cfz 13424 Basecbs 17083 +_gcplusg 17133 ._rcmulr 17134 Grpcgrp 18748 inv_gcminusg 18749 SymGrpcsymg 19148 CRingccrg 19965 ℤRHomczrh 20900 Mat cmat 21754 maDet cmdat 21933 maAdju cmadu 21981 subMat1csmat 32374

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-tp 4591 df-op 4593 df-ot 4595 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-1st 7921 df-2nd 7922 df-supp 8093 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-2o 8413 df-er 8648 df-map 8767 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9306 df-sup 9378 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-5 12219 df-6 12220 df-7 12221 df-8 12222 df-9 12223 df-n0 12414 df-z 12500 df-dec 12619 df-uz 12764 df-rp 12916 df-fz 13425 df-fzo 13568 df-struct 17019 df-sets 17036 df-slot 17054 df-ndx 17066 df-base 17084 df-ress 17113 df-plusg 17146 df-mulr 17147 df-sca 17149 df-vsca 17150 df-ip 17151 df-tset 17152 df-ple 17153 df-ds 17155 df-hom 17157 df-cco 17158 df-0g 17323 df-prds 17329 df-pws 17331 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-submnd 18602 df-efmnd 18679 df-grp 18751 df-minusg 18752 df-symg 19149 df-pmtr 19224 df-sra 20633 df-rgmod 20634 df-dsmm 21138 df-frlm 21153 df-mat 21755 df-subma 21926 df-smat 32375

This theorem is referenced by: madjusmdetlem4 32411

W3C validator