Theorem psgnfzto1st 33186

Description: The permutation sign for moving one element to the first position. (Contributed by Thierry Arnoux, 21-Aug-2020.)

Hypotheses

Ref	Expression
psgnfzto1st.d	⊢ 𝐷 = (1...𝑁)
psgnfzto1st.p	⊢ 𝑃 = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
psgnfzto1st.g	⊢ 𝐺 = (SymGrp‘𝐷)
psgnfzto1st.b	⊢ 𝐵 = (Base‘𝐺)
psgnfzto1st.s	⊢ 𝑆 = (pmSgn‘𝐷)

Assertion

Ref	Expression
psgnfzto1st	⊢ (𝐼 ∈ 𝐷 → (𝑆‘𝑃) = (-1↑(𝐼 + 1)))

Distinct variable groups:   𝐷,𝑖   𝑖,𝐼   𝑖,𝑁   𝐵,𝑖

Allowed substitution hints:   𝑃(𝑖)   𝑆(𝑖)   𝐺(𝑖)

Proof of Theorem psgnfzto1st

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfz1b 13538	. . . . 5 ⊢ (𝐼 ∈ (1...𝑁) ↔ (𝐼 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐼 ≤ 𝑁))
2	1	biimpi 217	. . . 4 ⊢ (𝐼 ∈ (1...𝑁) → (𝐼 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐼 ≤ 𝑁))
3		psgnfzto1st.d	. . . 4 ⊢ 𝐷 = (1...𝑁)
4	2, 3	eleq2s 2857	. . 3 ⊢ (𝐼 ∈ 𝐷 → (𝐼 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐼 ≤ 𝑁))
5		3ancoma 1103	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝑁) ↔ (𝐼 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐼 ≤ 𝑁))
6	4, 5	sylibr 235	. 2 ⊢ (𝐼 ∈ 𝐷 → (𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝑁))
7		df-3an 1094	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝑁) ↔ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ) ∧ 𝐼 ≤ 𝑁))
8		breq1 5075	. . . . . 6 ⊢ (𝑚 = 1 → (𝑚 ≤ 𝑁 ↔ 1 ≤ 𝑁))
9		id 22	. . . . . . . . . 10 ⊢ (𝑚 = 1 → 𝑚 = 1)
10		breq2 5076	. . . . . . . . . . 11 ⊢ (𝑚 = 1 → (𝑖 ≤ 𝑚 ↔ 𝑖 ≤ 1))
11	10	ifbid 4478	. . . . . . . . . 10 ⊢ (𝑚 = 1 → if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖) = if(𝑖 ≤ 1, (𝑖 − 1), 𝑖))
12	9, 11	ifeq12d 4476	. . . . . . . . 9 ⊢ (𝑚 = 1 → if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)) = if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))
13	12	mpteq2dv 5166	. . . . . . . 8 ⊢ (𝑚 = 1 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖))))
14	13	fveq2d 6831	. . . . . . 7 ⊢ (𝑚 = 1 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))))
15		oveq1 7363	. . . . . . . 8 ⊢ (𝑚 = 1 → (𝑚 + 1) = (1 + 1))
16	15	oveq2d 7372	. . . . . . 7 ⊢ (𝑚 = 1 → (-1↑(𝑚 + 1)) = (-1↑(1 + 1)))
17	14, 16	eqeq12d 2755	. . . . . 6 ⊢ (𝑚 = 1 → ((𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1)) ↔ (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))) = (-1↑(1 + 1))))
18	8, 17	imbi12d 345	. . . . 5 ⊢ (𝑚 = 1 → ((𝑚 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1))) ↔ (1 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))) = (-1↑(1 + 1)))))
19		breq1 5075	. . . . . 6 ⊢ (𝑚 = 𝑛 → (𝑚 ≤ 𝑁 ↔ 𝑛 ≤ 𝑁))
20		id 22	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → 𝑚 = 𝑛)
21		breq2 5076	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑖 ≤ 𝑚 ↔ 𝑖 ≤ 𝑛))
22	21	ifbid 4478	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖) = if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))
23	20, 22	ifeq12d 4476	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)) = if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))
24	23	mpteq2dv 5166	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))
25	24	fveq2d 6831	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))))
26		oveq1 7363	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (𝑚 + 1) = (𝑛 + 1))
27	26	oveq2d 7372	. . . . . . 7 ⊢ (𝑚 = 𝑛 → (-1↑(𝑚 + 1)) = (-1↑(𝑛 + 1)))
28	25, 27	eqeq12d 2755	. . . . . 6 ⊢ (𝑚 = 𝑛 → ((𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1)) ↔ (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1))))
29	19, 28	imbi12d 345	. . . . 5 ⊢ (𝑚 = 𝑛 → ((𝑚 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1))) ↔ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))))
30		breq1 5075	. . . . . 6 ⊢ (𝑚 = (𝑛 + 1) → (𝑚 ≤ 𝑁 ↔ (𝑛 + 1) ≤ 𝑁))
31		id 22	. . . . . . . . . 10 ⊢ (𝑚 = (𝑛 + 1) → 𝑚 = (𝑛 + 1))
32		breq2 5076	. . . . . . . . . . 11 ⊢ (𝑚 = (𝑛 + 1) → (𝑖 ≤ 𝑚 ↔ 𝑖 ≤ (𝑛 + 1)))
33	32	ifbid 4478	. . . . . . . . . 10 ⊢ (𝑚 = (𝑛 + 1) → if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖) = if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖))
34	31, 33	ifeq12d 4476	. . . . . . . . 9 ⊢ (𝑚 = (𝑛 + 1) → if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)) = if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))
35	34	mpteq2dv 5166	. . . . . . . 8 ⊢ (𝑚 = (𝑛 + 1) → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖))))
36	35	fveq2d 6831	. . . . . . 7 ⊢ (𝑚 = (𝑛 + 1) → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))))
37		oveq1 7363	. . . . . . . 8 ⊢ (𝑚 = (𝑛 + 1) → (𝑚 + 1) = ((𝑛 + 1) + 1))
38	37	oveq2d 7372	. . . . . . 7 ⊢ (𝑚 = (𝑛 + 1) → (-1↑(𝑚 + 1)) = (-1↑((𝑛 + 1) + 1)))
39	36, 38	eqeq12d 2755	. . . . . 6 ⊢ (𝑚 = (𝑛 + 1) → ((𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1)) ↔ (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))) = (-1↑((𝑛 + 1) + 1))))
40	30, 39	imbi12d 345	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → ((𝑚 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1))) ↔ ((𝑛 + 1) ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))) = (-1↑((𝑛 + 1) + 1)))))
41		breq1 5075	. . . . . 6 ⊢ (𝑚 = 𝐼 → (𝑚 ≤ 𝑁 ↔ 𝐼 ≤ 𝑁))
42		id 22	. . . . . . . . . . 11 ⊢ (𝑚 = 𝐼 → 𝑚 = 𝐼)
43		breq2 5076	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝐼 → (𝑖 ≤ 𝑚 ↔ 𝑖 ≤ 𝐼))
44	43	ifbid 4478	. . . . . . . . . . 11 ⊢ (𝑚 = 𝐼 → if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖) = if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖))
45	42, 44	ifeq12d 4476	. . . . . . . . . 10 ⊢ (𝑚 = 𝐼 → if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)) = if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
46	45	mpteq2dv 5166	. . . . . . . . 9 ⊢ (𝑚 = 𝐼 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖))))
47		psgnfzto1st.p	. . . . . . . . 9 ⊢ 𝑃 = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝐼, if(𝑖 ≤ 𝐼, (𝑖 − 1), 𝑖)))
48	46, 47	eqtr4di 2792	. . . . . . . 8 ⊢ (𝑚 = 𝐼 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖))) = 𝑃)
49	48	fveq2d 6831	. . . . . . 7 ⊢ (𝑚 = 𝐼 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (𝑆‘𝑃))
50		oveq1 7363	. . . . . . . 8 ⊢ (𝑚 = 𝐼 → (𝑚 + 1) = (𝐼 + 1))
51	50	oveq2d 7372	. . . . . . 7 ⊢ (𝑚 = 𝐼 → (-1↑(𝑚 + 1)) = (-1↑(𝐼 + 1)))
52	49, 51	eqeq12d 2755	. . . . . 6 ⊢ (𝑚 = 𝐼 → ((𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1)) ↔ (𝑆‘𝑃) = (-1↑(𝐼 + 1))))
53	41, 52	imbi12d 345	. . . . 5 ⊢ (𝑚 = 𝐼 → ((𝑚 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑚, if(𝑖 ≤ 𝑚, (𝑖 − 1), 𝑖)))) = (-1↑(𝑚 + 1))) ↔ (𝐼 ≤ 𝑁 → (𝑆‘𝑃) = (-1↑(𝐼 + 1)))))
54		fzfi 13925	. . . . . . . . 9 ⊢ (1...𝑁) ∈ Fin
55	3, 54	eqeltri 2835	. . . . . . . 8 ⊢ 𝐷 ∈ Fin
56		psgnfzto1st.s	. . . . . . . . 9 ⊢ 𝑆 = (pmSgn‘𝐷)
57	56	psgnid 33178	. . . . . . . 8 ⊢ (𝐷 ∈ Fin → (𝑆‘( I ↾ 𝐷)) = 1)
58	55, 57	ax-mp 5	. . . . . . 7 ⊢ (𝑆‘( I ↾ 𝐷)) = 1
59		eqid 2739	. . . . . . . . 9 ⊢ 1 = 1
60		eqid 2739	. . . . . . . . . 10 ⊢ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))
61	3, 60	fzto1st1 33183	. . . . . . . . 9 ⊢ (1 = 1 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖))) = ( I ↾ 𝐷))
62	59, 61	ax-mp 5	. . . . . . . 8 ⊢ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖))) = ( I ↾ 𝐷)
63	62	fveq2i 6830	. . . . . . 7 ⊢ (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))) = (𝑆‘( I ↾ 𝐷))
64		1p1e2 12292	. . . . . . . . 9 ⊢ (1 + 1) = 2
65	64	oveq2i 7367	. . . . . . . 8 ⊢ (-1↑(1 + 1)) = (-1↑2)
66		neg1sqe1 14149	. . . . . . . 8 ⊢ (-1↑2) = 1
67	65, 66	eqtri 2762	. . . . . . 7 ⊢ (-1↑(1 + 1)) = 1
68	58, 63, 67	3eqtr4i 2772	. . . . . 6 ⊢ (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))) = (-1↑(1 + 1))
69	68	2a1i 12	. . . . 5 ⊢ (𝑁 ∈ ℕ → (1 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 1, if(𝑖 ≤ 1, (𝑖 − 1), 𝑖)))) = (-1↑(1 + 1))))
70		simplr 774	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ∈ ℕ)
71	70	peano2nnd 12182	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 + 1) ∈ ℕ)
72		simpll 772	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑁 ∈ ℕ)
73		simpr 485	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 + 1) ≤ 𝑁)
74	71, 72, 73	3jca 1134	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → ((𝑛 + 1) ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ (𝑛 + 1) ≤ 𝑁))
75		elfz1b 13538	. . . . . . . . . . . 12 ⊢ ((𝑛 + 1) ∈ (1...𝑁) ↔ ((𝑛 + 1) ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ (𝑛 + 1) ≤ 𝑁))
76	74, 75	sylibr 235	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 + 1) ∈ (1...𝑁))
77	76, 3	eleqtrrdi 2850	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 + 1) ∈ 𝐷)
78	3	psgnfzto1stlem 33181	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (𝑛 + 1) ∈ 𝐷) → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖))) = (((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))))
79	70, 77, 78	syl2anc 590	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖))) = (((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))))
80	79	adantlr 721	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖))) = (((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))))
81	80	fveq2d 6831	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))) = (𝑆‘(((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))))
82	55	a1i 11	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → 𝐷 ∈ Fin)
83		eqid 2739	. . . . . . . . . 10 ⊢ ran (pmTrsp‘𝐷) = ran (pmTrsp‘𝐷)
84		psgnfzto1st.g	. . . . . . . . . 10 ⊢ 𝐺 = (SymGrp‘𝐷)
85		psgnfzto1st.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐺)
86	83, 84, 85	symgtrf 19435	. . . . . . . . 9 ⊢ ran (pmTrsp‘𝐷) ⊆ 𝐵
87		eqid 2739	. . . . . . . . . . . 12 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷)
88	3, 87	pmtrto1cl 33180	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ (𝑛 + 1) ∈ 𝐷) → ((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ ran (pmTrsp‘𝐷))
89	70, 77, 88	syl2anc 590	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → ((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ ran (pmTrsp‘𝐷))
90	89	adantlr 721	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → ((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ ran (pmTrsp‘𝐷))
91	86, 90	sselid 3913	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → ((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ 𝐵)
92	70	nnred 12180	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ∈ ℝ)
93		1red 11136	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 1 ∈ ℝ)
94	92, 93	readdcld 11165	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 + 1) ∈ ℝ)
95	72	nnred 12180	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑁 ∈ ℝ)
96	92	lep1d 12078	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ≤ (𝑛 + 1))
97	92, 94, 95, 96, 73	letrd 11294	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ≤ 𝑁)
98	70, 72, 97	3jca 1134	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑛 ≤ 𝑁))
99		elfz1b 13538	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (1...𝑁) ↔ (𝑛 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑛 ≤ 𝑁))
100	98, 99	sylibr 235	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ∈ (1...𝑁))
101	100, 3	eleqtrrdi 2850	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ∈ 𝐷)
102	101	adantlr 721	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ∈ 𝐷)
103		eqid 2739	. . . . . . . . . 10 ⊢ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))) = (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))
104	3, 103, 84, 85	fzto1st 33184	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝐷 → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))) ∈ 𝐵)
105	102, 104	syl 17	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))) ∈ 𝐵)
106	84, 56, 85	psgnco 21558	. . . . . . . 8 ⊢ ((𝐷 ∈ Fin ∧ ((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ 𝐵 ∧ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))) ∈ 𝐵) → (𝑆‘(((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))) = ((𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) · (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))))
107	82, 91, 105, 106	syl3anc 1379	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘(((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∘ (𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))) = ((𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) · (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))))
108	84, 83, 56	psgnpmtr 19476	. . . . . . . . . . 11 ⊢ (((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)}) ∈ ran (pmTrsp‘𝐷) → (𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) = -1)
109	89, 108	syl 17	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) = -1)
110	109	adantlr 721	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) = -1)
111	97	adantlr 721	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → 𝑛 ≤ 𝑁)
112		simplr 774	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1))))
113	111, 112	mpd 15	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))
114	110, 113	oveq12d 7374	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → ((𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) · (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))) = (-1 · (-1↑(𝑛 + 1))))
115		neg1cn 12135	. . . . . . . . . . 11 ⊢ -1 ∈ ℂ
116		peano2nn 12177	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (𝑛 + 1) ∈ ℕ)
117	116	nnnn0d 12489	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝑛 + 1) ∈ ℕ0)
118		expp1 14021	. . . . . . . . . . 11 ⊢ ((-1 ∈ ℂ ∧ (𝑛 + 1) ∈ ℕ0) → (-1↑((𝑛 + 1) + 1)) = ((-1↑(𝑛 + 1)) · -1))
119	115, 117, 118	sylancr 593	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (-1↑((𝑛 + 1) + 1)) = ((-1↑(𝑛 + 1)) · -1))
120	115	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → -1 ∈ ℂ)
121	120, 117	expcld 14099	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (-1↑(𝑛 + 1)) ∈ ℂ)
122	121, 120	mulcomd 11157	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → ((-1↑(𝑛 + 1)) · -1) = (-1 · (-1↑(𝑛 + 1))))
123	119, 122	eqtr2d 2775	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (-1 · (-1↑(𝑛 + 1))) = (-1↑((𝑛 + 1) + 1)))
124	123	ad3antlr 737	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (-1 · (-1↑(𝑛 + 1))) = (-1↑((𝑛 + 1) + 1)))
125	114, 124	eqtrd 2774	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → ((𝑆‘((pmTrsp‘𝐷)‘{𝑛, (𝑛 + 1)})) · (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖))))) = (-1↑((𝑛 + 1) + 1)))
126	81, 107, 125	3eqtrd 2778	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) ∧ (𝑛 + 1) ≤ 𝑁) → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))) = (-1↑((𝑛 + 1) + 1)))
127	126	ex 413	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝑛 ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, 𝑛, if(𝑖 ≤ 𝑛, (𝑖 − 1), 𝑖)))) = (-1↑(𝑛 + 1)))) → ((𝑛 + 1) ≤ 𝑁 → (𝑆‘(𝑖 ∈ 𝐷 ↦ if(𝑖 = 1, (𝑛 + 1), if(𝑖 ≤ (𝑛 + 1), (𝑖 − 1), 𝑖)))) = (-1↑((𝑛 + 1) + 1))))
128	18, 29, 40, 53, 69, 127	nnindd 12185	. . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ) → (𝐼 ≤ 𝑁 → (𝑆‘𝑃) = (-1↑(𝐼 + 1))))
129	128	imp 407	. . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ) ∧ 𝐼 ≤ 𝑁) → (𝑆‘𝑃) = (-1↑(𝐼 + 1)))
130	7, 129	sylbi 218	. 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝑁) → (𝑆‘𝑃) = (-1↑(𝐼 + 1)))
131	6, 130	syl 17	1 ⊢ (𝐼 ∈ 𝐷 → (𝑆‘𝑃) = (-1↑(𝐼 + 1)))

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119  ifcif 4454  {cpr 4557   class class class wbr 5072   ↦ cmpt 5153   I cid 5512  ran crn 5619   ↾ cres 5620   ∘ ccom 5622  ‘cfv 6485  (class class class)co 7356  Fincfn 8883  ℂcc 11027  1c1 11030   + caddc 11032   · cmul 11034   ≤ cle 11171   − cmin 11368  -cneg 11369  ℕcn 12165  2c2 12227  ℕ₀cn0 12428  ...cfz 13452  ↑cexp 14014  Basecbs 17170  SymGrpcsymg 19335  pmTrspcpmtr 19407  pmSgncpsgn 19455

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-addf 11108  ax-mulf 11109

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-xor 1519  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-ot 4564  df-uni 4839  df-int 4878  df-iun 4923  df-iin 4924  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-isom 6494  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-tpos 8166  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-er 8633  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-xnn0 12502  df-z 12516  df-dec 12636  df-uz 12780  df-rp 12934  df-fz 13453  df-fzo 13600  df-seq 13955  df-exp 14015  df-hash 14284  df-word 14467  df-lsw 14516  df-concat 14524  df-s1 14550  df-substr 14595  df-pfx 14625  df-splice 14703  df-reverse 14712  df-s2 14801  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-mulr 17225  df-starv 17226  df-tset 17230  df-ple 17231  df-ds 17233  df-unif 17234  df-0g 17395  df-gsum 17396  df-mre 17539  df-mrc 17540  df-acs 17542  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-submnd 18743  df-efmnd 18828  df-grp 18903  df-minusg 18904  df-subg 19090  df-ghm 19179  df-gim 19225  df-oppg 19312  df-symg 19336  df-pmtr 19408  df-psgn 19457  df-cmn 19748  df-abl 19749  df-mgp 20113  df-rng 20125  df-ur 20154  df-ring 20207  df-cring 20208  df-oppr 20308  df-dvdsr 20328  df-unit 20329  df-invr 20359  df-dvr 20372  df-drng 20703  df-cnfld 21348

This theorem is referenced by:  madjusmdetlem4  34014