poimirlem16 - Mathbox for Brendan Leahy

	Mathbox for Brendan Leahy		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > poimirlem16		Structured version Visualization version GIF version

Theorem poimirlem16 36094

Description: Lemma for poimir 36111 establishing the vertices of the simplex of poimirlem17 36095. (Contributed by Brendan Leahy, 21-Aug-2020.)

**Hypotheses**
Ref	Expression
poimir.0	⊢ (𝜑 → 𝑁 ∈ ℕ)
poimirlem22.s	⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem22.1	⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
poimirlem22.2	⊢ (𝜑 → 𝑇 ∈ 𝑆)
poimirlem18.3	⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾)
poimirlem18.4	⊢ (𝜑 → (2^nd ‘𝑇) = 0)

**Assertion**
Ref	Expression
poimirlem16	⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∘_f + (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})))))

Distinct variable groups: 𝑓,𝑗,𝑛,𝑝,𝑡,𝑦 𝜑,𝑗,𝑛,𝑦 𝑗,𝐹,𝑛,𝑦 𝑗,𝑁,𝑛,𝑦 𝑇,𝑗,𝑛,𝑦 𝜑,𝑝,𝑡 𝑓,𝐾,𝑗,𝑛,𝑝,𝑡 𝑓,𝑁,𝑝,𝑡 𝑇,𝑓,𝑝 𝑓,𝐹,𝑝,𝑡 𝑡,𝑇 𝑆,𝑗,𝑛,𝑝,𝑡,𝑦 Allowed substitution hints: 𝜑(𝑓) 𝑆(𝑓) 𝐾(𝑦)

**Proof of Theorem poimirlem16**
Step	Hyp	Ref	Expression
1		poimirlem22.2	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
2		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (2^nd ‘𝑡) = (2^nd ‘𝑇))
3	2	breq2d 5117	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (𝑦 < (2^nd ‘𝑡) ↔ 𝑦 < (2^nd ‘𝑇)))
4	3	ifbid 4509	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)))
5		2fveq3 6847	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘𝑇)))
6		2fveq3 6847	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑇 → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘(1^st ‘𝑇)))
7	6	imaeq1d 6012	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)))
8	7	xpeq1d 5662	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}))
9	6	imaeq1d 6012	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
10	9	xpeq1d 5662	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
11	8, 10	uneq12d 4124	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
12	5, 11	oveq12d 7375	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → ((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
13	4, 12	csbeq12dv 3864	. . . . . . 7 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
14	13	mpteq2dv 5207	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
15	14	eqeq2d 2747	. . . . 5 ⊢ (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
16		poimirlem22.s	. . . . 5 ⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
17	15, 16	elrab2 3648	. . . 4 ⊢ (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∧ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
18	17	simprbi 497	. . 3 ⊢ (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
19	1, 18	syl 17	. 2 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
20		elrabi 3639	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ {𝑡 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
21	20, 16	eleq2s 2856	. . . . . . . . . . 11 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
22	1, 21	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
23		xp1st 7953	. . . . . . . . . 10 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
24	22, 23	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
25		xp1st 7953	. . . . . . . . 9 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
26	24, 25	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
27		elmapfn 8803	. . . . . . . 8 ⊢ ((1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
28	26, 27	syl 17	. . . . . . 7 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
29	28	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
30		1ex 11151	. . . . . . . . . 10 ⊢ 1 ∈ V
31		fnconstg 6730	. . . . . . . . . 10 ⊢ (1 ∈ V → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
32	30, 31	ax-mp 5	. . . . . . . . 9 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1)))
33		c0ex 11149	. . . . . . . . . 10 ⊢ 0 ∈ V
34		fnconstg 6730	. . . . . . . . . 10 ⊢ (0 ∈ V → (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
35	33, 34	ax-mp 5	. . . . . . . . 9 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))
36	32, 35	pm3.2i 471	. . . . . . . 8 ⊢ ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
37		xp2nd 7954	. . . . . . . . . . . . 13 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
38	24, 37	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
39		fvex 6855	. . . . . . . . . . . . 13 ⊢ (2^nd ‘(1^st ‘𝑇)) ∈ V
40		f1oeq1 6772	. . . . . . . . . . . . 13 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑇)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁)))
41	39, 40	elab 3630	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
42	38, 41	sylib 217	. . . . . . . . . . 11 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
43		dff1o3 6790	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁) ∧ Fun ^◡(2^nd ‘(1^st ‘𝑇))))
44	43	simprbi 497	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ^◡(2^nd ‘(1^st ‘𝑇)))
45	42, 44	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → Fun ^◡(2^nd ‘(1^st ‘𝑇)))
46		imain 6586	. . . . . . . . . 10 ⊢ (Fun ^◡(2^nd ‘(1^st ‘𝑇)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
47	45, 46	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
48		elfznn0 13534	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℕ₀)
49		nn0p1nn 12452	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℕ₀ → (𝑦 + 1) ∈ ℕ)
50	48, 49	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℕ)
51	50	nnred 12168	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℝ)
52	51	ltp1d 12085	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) < ((𝑦 + 1) + 1))
53		fzdisj 13468	. . . . . . . . . . . 12 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
54	52, 53	syl 17	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
55	54	imaeq2d 6013	. . . . . . . . . 10 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ((2^nd ‘(1^st ‘𝑇)) “ ∅))
56		ima0 6029	. . . . . . . . . 10 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ∅) = ∅
57	55, 56	eqtrdi 2792	. . . . . . . . 9 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
58	47, 57	sylan9req 2797	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅)
59		fnun 6614	. . . . . . . 8 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
60	36, 58, 59	sylancr 587	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
61		imaundi 6102	. . . . . . . . 9 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
62		nnuz 12806	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ_≥‘1)
63	50, 62	eleqtrdi 2848	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ (ℤ_≥‘1))
64		peano2uz 12826	. . . . . . . . . . . . 13 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘1))
65	63, 64	syl 17	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘1))
66		poimir.0	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ ℕ)
67	66	nncnd 12169	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ ℂ)
68		npcan1 11580	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
69	67, 68	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
70	69	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) = 𝑁)
71		elfzuz3 13438	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑁 − 1) ∈ (ℤ_≥‘𝑦))
72		eluzp1p1 12791	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘𝑦) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
73	71, 72	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
74	73	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
75	70, 74	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ (ℤ_≥‘(𝑦 + 1)))
76		fzsplit2 13466	. . . . . . . . . . . 12 ⊢ ((((𝑦 + 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑦 + 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
77	65, 75, 76	syl2an2 684	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
78	77	imaeq2d 6013	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))))
79		f1ofo 6791	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁))
80		foima 6761	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
81	42, 79, 80	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
82	81	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
83	78, 82	eqtr3d 2778	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
84	61, 83	eqtr3id 2790	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
85	84	fneq2d 6596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) ↔ ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (1...𝑁)))
86	60, 85	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (1...𝑁))
87		ovexd 7392	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) ∈ V)
88		inidm 4178	. . . . . 6 ⊢ ((1...𝑁) ∩ (1...𝑁)) = (1...𝑁)
89		eqidd 2737	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) = ((1^st ‘(1^st ‘𝑇))‘𝑛))
90		eqidd 2737	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))
91	29, 86, 87, 87, 88, 89, 90	offval 7626	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))) = (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))))
92		oveq1 7364	. . . . . . . . . 10 ⊢ (1 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
93	92	eqeq2d 2747	. . . . . . . . 9 ⊢ (1 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → ((((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) ↔ (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
94		oveq1 7364	. . . . . . . . . 10 ⊢ (0 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → (0 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
95	94	eqeq2d 2747	. . . . . . . . 9 ⊢ (0 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → ((((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (0 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) ↔ (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
96		1p0e1 12277	. . . . . . . . . . . . . 14 ⊢ (1 + 0) = 1
97	96	eqcomi 2745	. . . . . . . . . . . . 13 ⊢ 1 = (1 + 0)
98		f1ofn 6785	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
99	42, 98	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
100	99	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
101		fzss2 13481	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑦 + 1)) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
102	75, 101	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
103		eluzfz1 13448	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → 1 ∈ (1...(𝑦 + 1)))
104	63, 103	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 1 ∈ (1...(𝑦 + 1)))
105	104	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 1 ∈ (1...(𝑦 + 1)))
106		fnfvima 7183	. . . . . . . . . . . . . . . 16 ⊢ (((2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁) ∧ (1...(𝑦 + 1)) ⊆ (1...𝑁) ∧ 1 ∈ (1...(𝑦 + 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
107	100, 102, 105, 106	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
108		fvun1 6932	. . . . . . . . . . . . . . . 16 ⊢ (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) ∧ ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅ ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)))
109	32, 35, 108	mp3an12 1451	. . . . . . . . . . . . . . 15 ⊢ (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅ ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1)))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)))
110	58, 107, 109	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)))
111	30	fvconst2 7153	. . . . . . . . . . . . . . 15 ⊢ (((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
112	107, 111	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
113	110, 112	eqtrd 2776	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
114		simpr 485	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ∈ (1...(𝑁 − 1)))
115	66	nnzd 12526	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → 𝑁 ∈ ℤ)
116		peano2zm 12546	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
117	115, 116	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
118		1z 12533	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 1 ∈ ℤ
119	117, 118	jctil 520	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ))
120		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℤ)
121	120, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → (𝑛 ∈ ℤ ∧ 1 ∈ ℤ))
122		fzaddel 13475	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
123	119, 121, 122	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
124	114, 123	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1)))
125	69	oveq2d 7373	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
126	125	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
127	124, 126	eleqtrd 2840	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...𝑁))
128	127	ralrimiva 3143	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑛 + 1) ∈ ((1 + 1)...𝑁))
129		simpr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → 𝑦 ∈ ((1 + 1)...𝑁))
130		peano2z 12544	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (1 ∈ ℤ → (1 + 1) ∈ ℤ)
131	118, 130	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (1 + 1) ∈ ℤ
132	115, 131	jctil 520	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → ((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ))
133		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℤ)
134	133, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → (𝑦 ∈ ℤ ∧ 1 ∈ ℤ))
135		fzsubel 13477	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑦 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
136	132, 134, 135	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
137	129, 136	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1)))
138		ax-1cn 11109	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 1 ∈ ℂ
139	138, 138	pncan3oi 11417	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((1 + 1) − 1) = 1
140	139	oveq1i 7367	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((1 + 1) − 1)...(𝑁 − 1)) = (1...(𝑁 − 1))
141	137, 140	eleqtrdi 2848	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (1...(𝑁 − 1)))
142	133	zcnd 12608	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℂ)
143		elfznn 13470	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℕ)
144	143	nncnd 12169	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℂ)
145		subadd2 11405	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑦 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
146	138, 145	mp3an2 1449	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
147	146	bicomd 222	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑛 + 1) = 𝑦 ↔ (𝑦 − 1) = 𝑛))
148		eqcom 2743	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑛 + 1) = 𝑦 ↔ 𝑦 = (𝑛 + 1))
149		eqcom 2743	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑦 − 1) = 𝑛 ↔ 𝑛 = (𝑦 − 1))
150	147, 148, 149	3bitr3g 312	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
151	142, 144, 150	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑦 ∈ ((1 + 1)...𝑁) ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
152	151	ralrimiva 3143	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
153	152	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
154		reu6i 3686	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑦 − 1) ∈ (1...(𝑁 − 1)) ∧ ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1))) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
155	141, 153, 154	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
156	155	ralrimiva 3143	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ∀𝑦 ∈ ((1 + 1)...𝑁)∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
157		eqid 2736	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1))
158	157	f1ompt 7059	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁) ↔ (∀𝑛 ∈ (1...(𝑁 − 1))(𝑛 + 1) ∈ ((1 + 1)...𝑁) ∧ ∀𝑦 ∈ ((1 + 1)...𝑁)∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1)))
159	128, 156, 158	sylanbrc 583	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁))
160		f1osng 6825	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑁 ∈ ℕ ∧ 1 ∈ V) → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
161	66, 30, 160	sylancl 586	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
162	66	nnred 12168	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝑁 ∈ ℝ)
163	162	ltm1d 12087	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝑁 − 1) < 𝑁)
164	117	zred 12607	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ)
165	164, 162	ltnled 11302	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → ((𝑁 − 1) < 𝑁 ↔ ¬ 𝑁 ≤ (𝑁 − 1)))
166	163, 165	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → ¬ 𝑁 ≤ (𝑁 − 1))
167		elfzle2 13445	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ (1...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
168	166, 167	nsyl 140	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ¬ 𝑁 ∈ (1...(𝑁 − 1)))
169		disjsn 4672	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((1...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1)))
170	168, 169	sylibr 233	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∩ {𝑁}) = ∅)
171		1re 11155	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ 1 ∈ ℝ
172	171	ltp1i 12059	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 1 < (1 + 1)
173	171, 171	readdcli 11170	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (1 + 1) ∈ ℝ
174	171, 173	ltnlei 11276	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (1 < (1 + 1) ↔ ¬ (1 + 1) ≤ 1)
175	172, 174	mpbi 229	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ¬ (1 + 1) ≤ 1
176		elfzle1 13444	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (1 ∈ ((1 + 1)...𝑁) → (1 + 1) ≤ 1)
177	175, 176	mto 196	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ¬ 1 ∈ ((1 + 1)...𝑁)
178		disjsn 4672	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((1 + 1)...𝑁) ∩ {1}) = ∅ ↔ ¬ 1 ∈ ((1 + 1)...𝑁))
179	177, 178	mpbir 230	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((1 + 1)...𝑁) ∩ {1}) = ∅
180		f1oun 6803	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁) ∧ {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1}) ∧ (((1...(𝑁 − 1)) ∩ {𝑁}) = ∅ ∧ (((1 + 1)...𝑁) ∩ {1}) = ∅)) → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1}))
181	179, 180	mpanr2 702	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁) ∧ {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1}) ∧ ((1...(𝑁 − 1)) ∩ {𝑁}) = ∅) → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1}))
182	159, 161, 170, 181	syl21anc 836	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1}))
183	30	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 1 ∈ V)
184	66, 62	eleqtrdi 2848	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
185	69, 184	eqeltrd 2838	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘1))
186		uzid 12778	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑁 − 1) ∈ ℤ → (𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)))
187		peano2uz 12826	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
188	117, 186, 187	3syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
189	69, 188	eqeltrrd 2839	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘(𝑁 − 1)))
190		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑁 − 1))) → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
191	185, 189, 190	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
192	69	oveq1d 7372	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = (𝑁...𝑁))
193		fzsn 13483	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑁 ∈ ℤ → (𝑁...𝑁) = {𝑁})
194	115, 193	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (𝑁...𝑁) = {𝑁})
195	192, 194	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = {𝑁})
196	195	uneq2d 4123	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = ((1...(𝑁 − 1)) ∪ {𝑁}))
197	191, 196	eqtr2d 2777	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ {𝑁}) = (1...𝑁))
198		iftrue 4492	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑛 = 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
199	198	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑛 = 𝑁) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
200	66, 183, 197, 199	fmptapd 7117	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
201		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ (1...(𝑁 − 1)) ↔ 𝑁 ∈ (1...(𝑁 − 1))))
202	201	notbid 317	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑛 = 𝑁 → (¬ 𝑛 ∈ (1...(𝑁 − 1)) ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1))))
203	168, 202	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → (𝑛 = 𝑁 → ¬ 𝑛 ∈ (1...(𝑁 − 1))))
204	203	necon2ad 2958	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ≠ 𝑁))
205	204	imp 407	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ≠ 𝑁)
206		ifnefalse 4498	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑛 ≠ 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
207	205, 206	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
208	207	mpteq2dva 5205	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)))
209	208	uneq1d 4122	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
210	200, 209	eqtr3d 2778	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
211	191, 196	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ {𝑁}))
212		uzid 12778	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (1 ∈ ℤ → 1 ∈ (ℤ_≥‘1))
213		peano2uz 12826	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (1 ∈ (ℤ_≥‘1) → (1 + 1) ∈ (ℤ_≥‘1))
214	118, 212, 213	mp2b 10	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (1 + 1) ∈ (ℤ_≥‘1)
215		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((1 + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘1)) → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
216	214, 184, 215	sylancr 587	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
217		fzsn 13483	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (1 ∈ ℤ → (1...1) = {1})
218	118, 217	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (1...1) = {1}
219	218	uneq1i 4119	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = ({1} ∪ ((1 + 1)...𝑁))
220	219	equncomi 4115	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = (((1 + 1)...𝑁) ∪ {1})
221	216, 220	eqtrdi 2792	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (1...𝑁) = (((1 + 1)...𝑁) ∪ {1}))
222	210, 211, 221	f1oeq123d 6778	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1})))
223	182, 222	mpbird 256	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁))
224		f1oco 6807	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) ∧ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁)) → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁))
225	42, 223, 224	syl2anc 584	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁))
226		dff1o3 6790	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁) ↔ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–onto→(1...𝑁) ∧ Fun ^◡((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))))
227	226	simprbi 497	. . . . . . . . . . . . . . . . . . 19 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ^◡((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))))
228	225, 227	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → Fun ^◡((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))))
229		imain 6586	. . . . . . . . . . . . . . . . . 18 ⊢ (Fun ^◡((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∩ ((𝑦 + 1)...𝑁))) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))))
230	228, 229	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∩ ((𝑦 + 1)...𝑁))) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))))
231	48	nn0red 12474	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℝ)
232	231	ltp1d 12085	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 < (𝑦 + 1))
233		fzdisj 13468	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 < (𝑦 + 1) → ((1...𝑦) ∩ ((𝑦 + 1)...𝑁)) = ∅)
234	232, 233	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((1...𝑦) ∩ ((𝑦 + 1)...𝑁)) = ∅)
235	234	imaeq2d 6013	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∩ ((𝑦 + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ∅))
236		ima0 6029	. . . . . . . . . . . . . . . . . 18 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ∅) = ∅
237	235, 236	eqtrdi 2792	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∩ ((𝑦 + 1)...𝑁))) = ∅)
238	230, 237	sylan9req 2797	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) = ∅)
239		imassrn 6024	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)) ⊆ ran (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))
240		f1of 6784	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁) → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)⟶(1...𝑁))
241		frn 6675	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)⟶(1...𝑁) → ran (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ⊆ (1...𝑁))
242	223, 240, 241	3syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ran (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ⊆ (1...𝑁))
243	239, 242	sstrid 3955	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)) ⊆ (1...𝑁))
244	243	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)) ⊆ (1...𝑁))
245		elfz1end 13471	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (1...𝑁))
246	66, 245	sylib 217	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝑁 ∈ (1...𝑁))
247		eqid 2736	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))
248	198, 247, 30	fvmpt 6948	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ (1...𝑁) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁) = 1)
249	246, 248	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁) = 1)
250	249	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁) = 1)
251		f1ofn 6785	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁) → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) Fn (1...𝑁))
252	223, 251	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) Fn (1...𝑁))
253	252	adantr 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) Fn (1...𝑁))
254		fzss1 13480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → ((𝑦 + 1)...𝑁) ⊆ (1...𝑁))
255	63, 254	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1)...𝑁) ⊆ (1...𝑁))
256	255	adantl 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1)...𝑁) ⊆ (1...𝑁))
257		eluzfz2 13449	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑦 + 1)) → 𝑁 ∈ ((𝑦 + 1)...𝑁))
258	75, 257	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ((𝑦 + 1)...𝑁))
259		fnfvima 7183	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) Fn (1...𝑁) ∧ ((𝑦 + 1)...𝑁) ⊆ (1...𝑁) ∧ 𝑁 ∈ ((𝑦 + 1)...𝑁)) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁) ∈ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)))
260	253, 256, 258, 259	syl3anc 1371	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁) ∈ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)))
261	250, 260	eqeltrrd 2839	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 1 ∈ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)))
262		fnfvima 7183	. . . . . . . . . . . . . . . . . 18 ⊢ (((2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁) ∧ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)) ⊆ (1...𝑁) ∧ 1 ∈ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁))))
263	100, 244, 261, 262	syl3anc 1371	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁))))
264		imaco 6203	. . . . . . . . . . . . . . . . 17 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...𝑁)))
265	263, 264	eleqtrrdi 2849	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))
266		fnconstg 6730	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ V → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)))
267	30, 266	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦))
268		fnconstg 6730	. . . . . . . . . . . . . . . . . 18 ⊢ (0 ∈ V → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))
269	33, 268	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))
270		fvun2 6933	. . . . . . . . . . . . . . . . 17 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∧ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}) Fn (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) ∧ (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) = ∅ ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})‘((2^nd ‘(1^st ‘𝑇))‘1)))
271	267, 269, 270	mp3an12 1451	. . . . . . . . . . . . . . . 16 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) = ∅ ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})‘((2^nd ‘(1^st ‘𝑇))‘1)))
272	238, 265, 271	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})‘((2^nd ‘(1^st ‘𝑇))‘1)))
273	33	fvconst2 7153	. . . . . . . . . . . . . . . 16 ⊢ (((2^nd ‘(1^st ‘𝑇))‘1) ∈ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 0)
274	265, 273	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 0)
275	272, 274	eqtrd 2776	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = 0)
276	275	oveq2d 7373	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1))) = (1 + 0))
277	97, 113, 276	3eqtr4a 2802	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1))))
278		fveq2 6842	. . . . . . . . . . . . 13 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)))
279		fveq2 6842	. . . . . . . . . . . . . 14 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)))
280	279	oveq2d 7373	. . . . . . . . . . . . 13 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1))))
281	278, 280	eqeq12d 2752	. . . . . . . . . . . 12 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) ↔ (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)))))
282	277, 281	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
283	282	imp 407	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
284	283	adantlr 713	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (1 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
285		eldifsn 4747	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ↔ (𝑛 ∈ (1...𝑁) ∧ 𝑛 ≠ ((2^nd ‘(1^st ‘𝑇))‘1)))
286		df-ne 2944	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ≠ ((2^nd ‘(1^st ‘𝑇))‘1) ↔ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1))
287	286	anbi2i 623	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (1...𝑁) ∧ 𝑛 ≠ ((2^nd ‘(1^st ‘𝑇))‘1)) ↔ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)))
288	285, 287	bitri 274	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ↔ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)))
289		fnconstg 6730	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ V → (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))))
290	30, 289	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1)))
291	290, 35	pm3.2i 471	. . . . . . . . . . . . . . . 16 ⊢ ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
292		imain 6586	. . . . . . . . . . . . . . . . . 18 ⊢ (Fun ^◡(2^nd ‘(1^st ‘𝑇)) → ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
293	45, 292	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
294		fzdisj 13468	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
295	52, 294	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
296	295	imaeq2d 6013	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ((2^nd ‘(1^st ‘𝑇)) “ ∅))
297	296, 56	eqtrdi 2792	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
298	293, 297	sylan9req 2797	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅)
299		fnun 6614	. . . . . . . . . . . . . . . 16 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) ∧ (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅) → ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
300	291, 298, 299	sylancr 587	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
301		imaundi 6102	. . . . . . . . . . . . . . . . 17 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
302		fzpred 13489	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (1...𝑁) = ({1} ∪ ((1 + 1)...𝑁)))
303	184, 302	syl 17	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → (1...𝑁) = ({1} ∪ ((1 + 1)...𝑁)))
304		uncom 4113	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ({1} ∪ ((1 + 1)...𝑁)) = (((1 + 1)...𝑁) ∪ {1})
305	303, 304	eqtrdi 2792	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → (1...𝑁) = (((1 + 1)...𝑁) ∪ {1}))
306	305	difeq1d 4081	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ((1...𝑁) ∖ {1}) = ((((1 + 1)...𝑁) ∪ {1}) ∖ {1}))
307		difun2 4440	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((1 + 1)...𝑁) ∪ {1}) ∖ {1}) = (((1 + 1)...𝑁) ∖ {1})
308		disj3 4413	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((1 + 1)...𝑁) ∩ {1}) = ∅ ↔ ((1 + 1)...𝑁) = (((1 + 1)...𝑁) ∖ {1}))
309	179, 308	mpbi 229	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((1 + 1)...𝑁) = (((1 + 1)...𝑁) ∖ {1})
310	307, 309	eqtr4i 2767	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((1 + 1)...𝑁) ∪ {1}) ∖ {1}) = ((1 + 1)...𝑁)
311	306, 310	eqtrdi 2792	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((1...𝑁) ∖ {1}) = ((1 + 1)...𝑁))
312	311	adantr 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((1...𝑁) ∖ {1}) = ((1 + 1)...𝑁))
313		eluzp1p1 12791	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘(1 + 1)))
314	63, 313	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘(1 + 1)))
315		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑦 + 1) + 1) ∈ (ℤ_≥‘(1 + 1)) ∧ 𝑁 ∈ (ℤ_≥‘(𝑦 + 1))) → ((1 + 1)...𝑁) = (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
316	314, 75, 315	syl2an2 684	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((1 + 1)...𝑁) = (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
317	312, 316	eqtrd 2776	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((1...𝑁) ∖ {1}) = (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
318	317	imaeq2d 6013	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...𝑁) ∖ {1})) = ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))))
319		imadif 6585	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (Fun ^◡(2^nd ‘(1^st ‘𝑇)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...𝑁) ∖ {1})) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) ∖ ((2^nd ‘(1^st ‘𝑇)) “ {1})))
320	45, 319	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ ((1...𝑁) ∖ {1})) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) ∖ ((2^nd ‘(1^st ‘𝑇)) “ {1})))
321		eluzfz1 13448	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑁))
322	184, 321	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 1 ∈ (1...𝑁))
323		fnsnfv 6920	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁) ∧ 1 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑇))‘1)} = ((2^nd ‘(1^st ‘𝑇)) “ {1}))
324	99, 322, 323	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → {((2^nd ‘(1^st ‘𝑇))‘1)} = ((2^nd ‘(1^st ‘𝑇)) “ {1}))
325	324	eqcomd 2742	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ {1}) = {((2^nd ‘(1^st ‘𝑇))‘1)})
326	81, 325	difeq12d 4083	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) ∖ ((2^nd ‘(1^st ‘𝑇)) “ {1})) = ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
327	320, 326	eqtrd 2776	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ ((1...𝑁) ∖ {1})) = ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
328	327	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...𝑁) ∖ {1})) = ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
329	318, 328	eqtr3d 2778	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (((1 + 1)...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
330	301, 329	eqtr3id 2790	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
331	330	fneq2d 6596	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) ↔ ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)})))
332	300, 331	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))
333		disjdifr 4432	. . . . . . . . . . . . . . 15 ⊢ (((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅
334		fnconstg 6730	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ V → ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)})
335	30, 334	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)}
336		fvun1 6932	. . . . . . . . . . . . . . . . 17 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)} ∧ ((((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅ ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))
337	335, 336	mp3an2 1449	. . . . . . . . . . . . . . . 16 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ ((((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅ ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))
338		fnconstg 6730	. . . . . . . . . . . . . . . . . 18 ⊢ (0 ∈ V → ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)})
339	33, 338	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)}
340		fvun1 6932	. . . . . . . . . . . . . . . . 17 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) Fn {((2^nd ‘(1^st ‘𝑇))‘1)} ∧ ((((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅ ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))
341	339, 340	mp3an2 1449	. . . . . . . . . . . . . . . 16 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ ((((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅ ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))
342	337, 341	eqtr4d 2779	. . . . . . . . . . . . . . 15 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ ((((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∩ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ∅ ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
343	333, 342	mpanr1 701	. . . . . . . . . . . . . 14 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)}) ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)})) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
344	332, 343	sylan 580	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ ((1...𝑁) ∖ {((2^nd ‘(1^st ‘𝑇))‘1)})) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
345	288, 344	sylan2br 595	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1))) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
346	345	anassrs 468	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
347		fzpred 13489	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → (1...(𝑦 + 1)) = ({1} ∪ ((1 + 1)...(𝑦 + 1))))
348	63, 347	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (1...(𝑦 + 1)) = ({1} ∪ ((1 + 1)...(𝑦 + 1))))
349	348	imaeq2d 6013	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) = ((2^nd ‘(1^st ‘𝑇)) “ ({1} ∪ ((1 + 1)...(𝑦 + 1)))))
350	349	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) = ((2^nd ‘(1^st ‘𝑇)) “ ({1} ∪ ((1 + 1)...(𝑦 + 1)))))
351	324	uneq1d 4122	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1)))) = (((2^nd ‘(1^st ‘𝑇)) “ {1}) ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1)))))
352		uncom 4113	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))))
353		imaundi 6102	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ({1} ∪ ((1 + 1)...(𝑦 + 1)))) = (((2^nd ‘(1^st ‘𝑇)) “ {1}) ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))))
354	351, 352, 353	3eqtr4g 2801	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ((2^nd ‘(1^st ‘𝑇)) “ ({1} ∪ ((1 + 1)...(𝑦 + 1)))))
355	354	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}) = ((2^nd ‘(1^st ‘𝑇)) “ ({1} ∪ ((1 + 1)...(𝑦 + 1)))))
356	350, 355	eqtr4d 2779	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) = (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}))
357	356	xpeq1d 5662	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) = ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}) × {1}))
358		xpundir 5701	. . . . . . . . . . . . . . . 16 ⊢ ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) ∪ {((2^nd ‘(1^st ‘𝑇))‘1)}) × {1}) = ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))
359	357, 358	eqtrdi 2792	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) = ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1})))
360	359	uneq1d 4122	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1})) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))
361		un23 4128	. . . . . . . . . . . . . 14 ⊢ (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1})) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))
362	360, 361	eqtrdi 2792	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1})))
363	362	fveq1d 6844	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛))
364	363	ad2antrr 724	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {1}))‘𝑛))
365		imaco 6203	. . . . . . . . . . . . . . . . 17 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ (1...𝑦)))
366		df-ima 5646	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ (1...𝑦)) = ran ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ (1...𝑦))
367		peano2uz 12826	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘𝑦) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘𝑦))
368	71, 367	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘𝑦))
369	368	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘𝑦))
370	70, 369	eqeltrrd 2839	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ (ℤ_≥‘𝑦))
371		fzss2 13481	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ (ℤ_≥‘𝑦) → (1...𝑦) ⊆ (1...𝑁))
372	370, 371	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑦) ⊆ (1...𝑁))
373	372	resmptd 5994	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ (1...𝑦)) = (𝑛 ∈ (1...𝑦) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
374		fzss2 13481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘𝑦) → (1...𝑦) ⊆ (1...(𝑁 − 1)))
375	71, 374	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (1...𝑦) ⊆ (1...(𝑁 − 1)))
376	375	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑦) ⊆ (1...(𝑁 − 1)))
377	168	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ¬ 𝑁 ∈ (1...(𝑁 − 1)))
378	376, 377	ssneldd 3947	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ¬ 𝑁 ∈ (1...𝑦))
379		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ (1...𝑦) ↔ 𝑁 ∈ (1...𝑦)))
380	379	notbid 317	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑛 = 𝑁 → (¬ 𝑛 ∈ (1...𝑦) ↔ ¬ 𝑁 ∈ (1...𝑦)))
381	378, 380	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 = 𝑁 → ¬ 𝑛 ∈ (1...𝑦)))
382	381	necon2ad 2958	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ (1...𝑦) → 𝑛 ≠ 𝑁))
383	382	imp 407	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑦)) → 𝑛 ≠ 𝑁)
384	383, 206	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑦)) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
385	384	mpteq2dva 5205	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ (1...𝑦) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)))
386	373, 385	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ (1...𝑦)) = (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)))
387	386	rneqd 5893	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ran ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ (1...𝑦)) = ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)))
388	366, 387	eqtrid 2788	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ (1...𝑦)) = ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)))
389		eqid 2736	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)) = (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1))
390	389	elrnmpt 5911	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑗 ∈ V → (𝑗 ∈ ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)) ↔ ∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1)))
391	390	elv 3451	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)) ↔ ∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1))
392		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℤ)
393	392	adantl 482	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 ∈ ℤ)
394		simpr 485	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑦 ∈ ℤ ∧ 𝑛 ∈ (1...𝑦)) → 𝑛 ∈ (1...𝑦))
395	118	jctl 524	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 ∈ ℤ → (1 ∈ ℤ ∧ 𝑦 ∈ ℤ))
396		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 ∈ (1...𝑦) → 𝑛 ∈ ℤ)
397	396, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑛 ∈ (1...𝑦) → (𝑛 ∈ ℤ ∧ 1 ∈ ℤ))
398		fzaddel 13475	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑛 ∈ (1...𝑦) ↔ (𝑛 + 1) ∈ ((1 + 1)...(𝑦 + 1))))
399	395, 397, 398	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑦 ∈ ℤ ∧ 𝑛 ∈ (1...𝑦)) → (𝑛 ∈ (1...𝑦) ↔ (𝑛 + 1) ∈ ((1 + 1)...(𝑦 + 1))))
400	394, 399	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑦 ∈ ℤ ∧ 𝑛 ∈ (1...𝑦)) → (𝑛 + 1) ∈ ((1 + 1)...(𝑦 + 1)))
401		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑗 = (𝑛 + 1) → (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...(𝑦 + 1))))
402	400, 401	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑦 ∈ ℤ ∧ 𝑛 ∈ (1...𝑦)) → (𝑗 = (𝑛 + 1) → 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
403	402	rexlimdva 3152	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 ∈ ℤ → (∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1) → 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
404		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → 𝑗 ∈ ℤ)
405	404	zcnd 12608	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → 𝑗 ∈ ℂ)
406		npcan1 11580	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 ∈ ℂ → ((𝑗 − 1) + 1) = 𝑗)
407	405, 406	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → ((𝑗 − 1) + 1) = 𝑗)
408	407	eleq1d 2822	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → (((𝑗 − 1) + 1) ∈ ((1 + 1)...(𝑦 + 1)) ↔ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
409	408	ibir 267	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → ((𝑗 − 1) + 1) ∈ ((1 + 1)...(𝑦 + 1)))
410	409	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → ((𝑗 − 1) + 1) ∈ ((1 + 1)...(𝑦 + 1)))
411		peano2zm 12546	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 ∈ ℤ → (𝑗 − 1) ∈ ℤ)
412	404, 411	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → (𝑗 − 1) ∈ ℤ)
413	412, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → ((𝑗 − 1) ∈ ℤ ∧ 1 ∈ ℤ))
414		fzaddel 13475	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((1 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ ((𝑗 − 1) ∈ ℤ ∧ 1 ∈ ℤ)) → ((𝑗 − 1) ∈ (1...𝑦) ↔ ((𝑗 − 1) + 1) ∈ ((1 + 1)...(𝑦 + 1))))
415	395, 413, 414	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → ((𝑗 − 1) ∈ (1...𝑦) ↔ ((𝑗 − 1) + 1) ∈ ((1 + 1)...(𝑦 + 1))))
416	410, 415	mpbird 256	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → (𝑗 − 1) ∈ (1...𝑦))
417	405	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → 𝑗 ∈ ℂ)
418	406	eqcomd 2742	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑗 ∈ ℂ → 𝑗 = ((𝑗 − 1) + 1))
419	417, 418	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → 𝑗 = ((𝑗 − 1) + 1))
420		oveq1 7364	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑛 = (𝑗 − 1) → (𝑛 + 1) = ((𝑗 − 1) + 1))
421	420	rspceeqv 3595	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑗 − 1) ∈ (1...𝑦) ∧ 𝑗 = ((𝑗 − 1) + 1)) → ∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1))
422	416, 419, 421	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑦 ∈ ℤ ∧ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))) → ∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1))
423	422	ex 413	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 ∈ ℤ → (𝑗 ∈ ((1 + 1)...(𝑦 + 1)) → ∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1)))
424	403, 423	impbid 211	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 ∈ ℤ → (∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1) ↔ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
425	393, 424	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (∃𝑛 ∈ (1...𝑦)𝑗 = (𝑛 + 1) ↔ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
426	391, 425	bitrid 282	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑗 ∈ ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)) ↔ 𝑗 ∈ ((1 + 1)...(𝑦 + 1))))
427	426	eqrdv 2734	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ran (𝑛 ∈ (1...𝑦) ↦ (𝑛 + 1)) = ((1 + 1)...(𝑦 + 1)))
428	388, 427	eqtrd 2776	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ (1...𝑦)) = ((1 + 1)...(𝑦 + 1)))
429	428	imaeq2d 6013	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ (1...𝑦))) = ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))))
430	365, 429	eqtrid 2788	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) = ((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))))
431	430	xpeq1d 5662	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}))
432		imaundi 6102	. . . . . . . . . . . . . . . . . . 19 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ({𝑁} ∪ ((𝑦 + 1)...(𝑁 − 1)))) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ {𝑁}) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...(𝑁 − 1))))
433		imaco 6203	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ {𝑁}) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁}))
434		imaco 6203	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...(𝑁 − 1))) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1))))
435	433, 434	uneq12i 4121	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ {𝑁}) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...(𝑁 − 1)))) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})) ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1)))))
436	432, 435	eqtri 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ({𝑁} ∪ ((𝑦 + 1)...(𝑁 − 1)))) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})) ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1)))))
437	189	adantr 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ (ℤ_≥‘(𝑁 − 1)))
438		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)) ∧ 𝑁 ∈ (ℤ_≥‘(𝑁 − 1))) → ((𝑦 + 1)...𝑁) = (((𝑦 + 1)...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
439	73, 437, 438	syl2an2 684	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1)...𝑁) = (((𝑦 + 1)...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
440	195	uneq2d 4123	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (((𝑦 + 1)...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = (((𝑦 + 1)...(𝑁 − 1)) ∪ {𝑁}))
441	440	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((𝑦 + 1)...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = (((𝑦 + 1)...(𝑁 − 1)) ∪ {𝑁}))
442	439, 441	eqtrd 2776	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1)...𝑁) = (((𝑦 + 1)...(𝑁 − 1)) ∪ {𝑁}))
443		uncom 4113	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑦 + 1)...(𝑁 − 1)) ∪ {𝑁}) = ({𝑁} ∪ ((𝑦 + 1)...(𝑁 − 1)))
444	442, 443	eqtrdi 2792	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1)...𝑁) = ({𝑁} ∪ ((𝑦 + 1)...(𝑁 − 1))))
445	444	imaeq2d 6013	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) = (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ({𝑁} ∪ ((𝑦 + 1)...(𝑁 − 1)))))
446	249	sneqd 4598	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → {((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁)} = {1})
447		fnsnfv 6920	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) Fn (1...𝑁) ∧ 𝑁 ∈ (1...𝑁)) → {((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁)} = ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁}))
448	252, 246, 447	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → {((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))‘𝑁)} = ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁}))
449	446, 448	eqtr3d 2778	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → {1} = ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁}))
450	449	imaeq2d 6013	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ {1}) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})))
451	324, 450	eqtrd 2776	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → {((2^nd ‘(1^st ‘𝑇))‘1)} = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})))
452	451	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → {((2^nd ‘(1^st ‘𝑇))‘1)} = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})))
453		df-ima 5646	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1))) = ran ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ ((𝑦 + 1)...(𝑁 − 1)))
454		fzss1 13480	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → ((𝑦 + 1)...(𝑁 − 1)) ⊆ (1...(𝑁 − 1)))
455	63, 454	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1)...(𝑁 − 1)) ⊆ (1...(𝑁 − 1)))
456		fzss2 13481	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑁 − 1)) → (1...(𝑁 − 1)) ⊆ (1...𝑁))
457	189, 456	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → (1...(𝑁 − 1)) ⊆ (1...𝑁))
458	455, 457	sylan9ssr 3958	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1)...(𝑁 − 1)) ⊆ (1...𝑁))
459	458	resmptd 5994	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ ((𝑦 + 1)...(𝑁 − 1))) = (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
460		elfzle2 13445	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑁 ∈ ((𝑦 + 1)...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
461	166, 460	nsyl 140	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝜑 → ¬ 𝑁 ∈ ((𝑦 + 1)...(𝑁 − 1)))
462		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ 𝑁 ∈ ((𝑦 + 1)...(𝑁 − 1))))
463	462	notbid 317	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑛 = 𝑁 → (¬ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ ¬ 𝑁 ∈ ((𝑦 + 1)...(𝑁 − 1))))
464	461, 463	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (𝑛 = 𝑁 → ¬ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))))
465	464	con2d 134	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) → ¬ 𝑛 = 𝑁))
466	465	imp 407	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → ¬ 𝑛 = 𝑁)
467	466	iffalsed 4497	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
468	467	mpteq2dva 5205	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
469	468	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
470	459, 469	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ ((𝑦 + 1)...(𝑁 − 1))) = (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
471	470	rneqd 5893	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ran ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ↾ ((𝑦 + 1)...(𝑁 − 1))) = ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
472	453, 471	eqtrid 2788	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1))) = ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
473		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → 𝑗 ∈ ℤ)
474	473	zcnd 12608	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → 𝑗 ∈ ℂ)
475	474, 406	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → ((𝑗 − 1) + 1) = 𝑗)
476	475	eleq1d 2822	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → (((𝑗 − 1) + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) ↔ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
477	476	ibir 267	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → ((𝑗 − 1) + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)))
478	477	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))) → ((𝑗 − 1) + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)))
479	50	nnzd 12526	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℤ)
480	117, 479	anim12ci 614	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑦 + 1) ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ))
481	473, 411	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → (𝑗 − 1) ∈ ℤ)
482	481, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → ((𝑗 − 1) ∈ ℤ ∧ 1 ∈ ℤ))
483		fzaddel 13475	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((((𝑦 + 1) ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) ∧ ((𝑗 − 1) ∈ ℤ ∧ 1 ∈ ℤ)) → ((𝑗 − 1) ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ ((𝑗 − 1) + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
484	480, 482, 483	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))) → ((𝑗 − 1) ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ ((𝑗 − 1) + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
485	478, 484	mpbird 256	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))) → (𝑗 − 1) ∈ ((𝑦 + 1)...(𝑁 − 1)))
486	474, 418	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → 𝑗 = ((𝑗 − 1) + 1))
487	486	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))) → 𝑗 = ((𝑗 − 1) + 1))
488	420	rspceeqv 3595	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝑗 − 1) ∈ ((𝑦 + 1)...(𝑁 − 1)) ∧ 𝑗 = ((𝑗 − 1) + 1)) → ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1))
489	485, 487, 488	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))) → ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1))
490	489	ex 413	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) → ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1)))
491		simpr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)))
492		elfzelz 13441	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) → 𝑛 ∈ ℤ)
493	492, 118	jctir 521	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) → (𝑛 ∈ ℤ ∧ 1 ∈ ℤ))
494		fzaddel 13475	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((((𝑦 + 1) ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
495	480, 493, 494	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
496	491, 495	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → (𝑛 + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)))
497		eleq1 2825	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑗 = (𝑛 + 1) → (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) ↔ (𝑛 + 1) ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
498	496, 497	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))) → (𝑗 = (𝑛 + 1) → 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
499	498	rexlimdva 3152	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1) → 𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1))))
500	490, 499	impbid 211	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) ↔ ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1)))
501		eqid 2736	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)) = (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1))
502	501	elrnmpt 5911	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑗 ∈ V → (𝑗 ∈ ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)) ↔ ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1)))
503	502	elv 3451	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑗 ∈ ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)) ↔ ∃𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1))𝑗 = (𝑛 + 1))
504	500, 503	bitr4di 288	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑗 ∈ (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) ↔ 𝑗 ∈ ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1))))
505	504	eqrdv 2734	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) = ran (𝑛 ∈ ((𝑦 + 1)...(𝑁 − 1)) ↦ (𝑛 + 1)))
506	69	oveq2d 7373	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) = (((𝑦 + 1) + 1)...𝑁))
507	506	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((𝑦 + 1) + 1)...((𝑁 − 1) + 1)) = (((𝑦 + 1) + 1)...𝑁))
508	472, 505, 507	3eqtr2rd 2783	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((𝑦 + 1) + 1)...𝑁) = ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1))))
509	508	imaeq2d 6013	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1)))))
510	452, 509	uneq12d 4124	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ {𝑁})) ∪ ((2^nd ‘(1^st ‘𝑇)) “ ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) “ ((𝑦 + 1)...(𝑁 − 1))))))
511	436, 445, 510	3eqtr4a 2802	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) = ({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
512	511	xpeq1d 5662	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}) = (({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) × {0}))
513		xpundir 5701	. . . . . . . . . . . . . . . 16 ⊢ (({((2^nd ‘(1^st ‘𝑇))‘1)} ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) × {0}) = (({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))
514	512, 513	eqtrdi 2792	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}) = (({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))
515	431, 514	uneq12d 4124	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))))
516		unass 4126	. . . . . . . . . . . . . . 15 ⊢ (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0})) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))
517		un23 4128	. . . . . . . . . . . . . . 15 ⊢ (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0})) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))
518	516, 517	eqtr3i 2766	. . . . . . . . . . . . . 14 ⊢ ((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))
519	515, 518	eqtrdi 2792	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) = (((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0})))
520	519	fveq1d 6844	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
521	520	ad2antrr 724	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) “ ((1 + 1)...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) ∪ ({((2^nd ‘(1^st ‘𝑇))‘1)} × {0}))‘𝑛))
522	346, 364, 521	3eqtr4d 2786	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))
523		snssi 4768	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ ℂ → {1} ⊆ ℂ)
524	138, 523	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ {1} ⊆ ℂ
525		0cn 11147	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℂ
526		snssi 4768	. . . . . . . . . . . . . . 15 ⊢ (0 ∈ ℂ → {0} ⊆ ℂ)
527	525, 526	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ ℂ
528	524, 527	unssi 4145	. . . . . . . . . . . . 13 ⊢ ({1} ∪ {0}) ⊆ ℂ
529	30	fconst 6728	. . . . . . . . . . . . . . . . 17 ⊢ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦))⟶{1}
530	33	fconst 6728	. . . . . . . . . . . . . . . . 17 ⊢ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))⟶{0}
531	529, 530	pm3.2i 471	. . . . . . . . . . . . . . . 16 ⊢ (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦))⟶{1} ∧ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))⟶{0})
532		fun 6704	. . . . . . . . . . . . . . . 16 ⊢ (((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦))⟶{1} ∧ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}):(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))⟶{0}) ∧ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∩ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) = ∅) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})):((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))⟶({1} ∪ {0}))
533	531, 238, 532	sylancr 587	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})):((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))⟶({1} ∪ {0}))
534		imaundi 6102	. . . . . . . . . . . . . . . . 17 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∪ ((𝑦 + 1)...𝑁))) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))
535		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑦 + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘𝑦)) → (1...𝑁) = ((1...𝑦) ∪ ((𝑦 + 1)...𝑁)))
536	63, 370, 535	syl2an2 684	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) = ((1...𝑦) ∪ ((𝑦 + 1)...𝑁)))
537	536	imaeq2d 6013	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑁)) = (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∪ ((𝑦 + 1)...𝑁))))
538		f1ofo 6791	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁) → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–onto→(1...𝑁))
539		foima 6761	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–onto→(1...𝑁) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑁)) = (1...𝑁))
540	225, 538, 539	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑁)) = (1...𝑁))
541	540	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑁)) = (1...𝑁))
542	537, 541	eqtr3d 2778	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((1...𝑦) ∪ ((𝑦 + 1)...𝑁))) = (1...𝑁))
543	534, 542	eqtr3id 2790	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))) = (1...𝑁))
544	543	feq2d 6654	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})):((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) ∪ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))⟶({1} ∪ {0}) ↔ (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})):(1...𝑁)⟶({1} ∪ {0})))
545	533, 544	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})):(1...𝑁)⟶({1} ∪ {0}))
546	545	ffvelcdmda 7035	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) ∈ ({1} ∪ {0}))
547	528, 546	sselid 3942	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) ∈ ℂ)
548	547	addid2d 11356	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (0 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))
549	548	adantr 481	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (0 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))
550	522, 549	eqtr4d 2779	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (0 + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
551	93, 95, 284, 550	ifbothda 4524	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛) = (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
552	551	oveq2d 7373	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛)) = (((1^st ‘(1^st ‘𝑇))‘𝑛) + (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
553		elmapi 8787	. . . . . . . . . . . . 13 ⊢ ((1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
554	26, 553	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
555	554	ffvelcdmda 7035	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾))
556		elfzonn0 13617	. . . . . . . . . . 11 ⊢ (((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
557	555, 556	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
558	557	nn0cnd 12475	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℂ)
559	558	adantlr 713	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℂ)
560	138, 525	ifcli 4533	. . . . . . . . 9 ⊢ if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) ∈ ℂ
561	560	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) ∈ ℂ)
562	559, 561, 547	addassd 11177	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)) = (((1^st ‘(1^st ‘𝑇))‘𝑛) + (if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
563	552, 562	eqtr4d 2779	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛)) = ((((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
564	563	mpteq2dva 5205	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘𝑛))) = (𝑛 ∈ (1...𝑁) ↦ ((((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
565	91, 564	eqtrd 2776	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))) = (𝑛 ∈ (1...𝑁) ↦ ((((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
566		poimirlem18.4	. . . . . . . . . 10 ⊢ (𝜑 → (2^nd ‘𝑇) = 0)
567	566	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) = 0)
568		elfzle1 13444	. . . . . . . . . 10 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 0 ≤ 𝑦)
569	568	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 0 ≤ 𝑦)
570	567, 569	eqbrtrd 5127	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) ≤ 𝑦)
571		0re 11157	. . . . . . . . . 10 ⊢ 0 ∈ ℝ
572	566, 571	eqeltrdi 2846	. . . . . . . . 9 ⊢ (𝜑 → (2^nd ‘𝑇) ∈ ℝ)
573		lenlt 11233	. . . . . . . . 9 ⊢ (((2^nd ‘𝑇) ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
574	572, 231, 573	syl2an 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
575	570, 574	mpbid 231	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ¬ 𝑦 < (2^nd ‘𝑇))
576	575	iffalsed 4497	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) = (𝑦 + 1))
577	576	csbeq1d 3859	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋(𝑦 + 1) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
578		ovex 7390	. . . . . 6 ⊢ (𝑦 + 1) ∈ V
579		oveq2 7365	. . . . . . . . . 10 ⊢ (𝑗 = (𝑦 + 1) → (1...𝑗) = (1...(𝑦 + 1)))
580	579	imaeq2d 6013	. . . . . . . . 9 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
581	580	xpeq1d 5662	. . . . . . . 8 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}))
582		oveq1 7364	. . . . . . . . . . 11 ⊢ (𝑗 = (𝑦 + 1) → (𝑗 + 1) = ((𝑦 + 1) + 1))
583	582	oveq1d 7372	. . . . . . . . . 10 ⊢ (𝑗 = (𝑦 + 1) → ((𝑗 + 1)...𝑁) = (((𝑦 + 1) + 1)...𝑁))
584	583	imaeq2d 6013	. . . . . . . . 9 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
585	584	xpeq1d 5662	. . . . . . . 8 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))
586	581, 585	uneq12d 4124	. . . . . . 7 ⊢ (𝑗 = (𝑦 + 1) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))
587	586	oveq2d 7373	. . . . . 6 ⊢ (𝑗 = (𝑦 + 1) → ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))))
588	578, 587	csbie 3891	. . . . 5 ⊢ ⦋(𝑦 + 1) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))
589	577, 588	eqtrdi 2792	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))))
590		ovexd 7392	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) ∈ V)
591		fvexd 6857	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑛 ∈ (1...𝑁)) → ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛) ∈ V)
592		eqidd 2737	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) = (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))))
593	545	ffnd 6669	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) Fn (1...𝑁))
594		nfcv 2907	. . . . . . . . . . 11 ⊢ Ⅎ𝑛(2^nd ‘(1^st ‘𝑇))
595		nfmpt1 5213	. . . . . . . . . . 11 ⊢ Ⅎ𝑛(𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))
596	594, 595	nfco 5821	. . . . . . . . . 10 ⊢ Ⅎ𝑛((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
597		nfcv 2907	. . . . . . . . . 10 ⊢ Ⅎ𝑛(1...𝑦)
598	596, 597	nfima 6021	. . . . . . . . 9 ⊢ Ⅎ𝑛(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦))
599		nfcv 2907	. . . . . . . . 9 ⊢ Ⅎ𝑛{1}
600	598, 599	nfxp 5666	. . . . . . . 8 ⊢ Ⅎ𝑛((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1})
601		nfcv 2907	. . . . . . . . . 10 ⊢ Ⅎ𝑛((𝑦 + 1)...𝑁)
602	596, 601	nfima 6021	. . . . . . . . 9 ⊢ Ⅎ𝑛(((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁))
603		nfcv 2907	. . . . . . . . 9 ⊢ Ⅎ𝑛{0}
604	602, 603	nfxp 5666	. . . . . . . 8 ⊢ Ⅎ𝑛((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})
605	600, 604	nfun 4125	. . . . . . 7 ⊢ Ⅎ𝑛(((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))
606	605	dffn5f 6913	. . . . . 6 ⊢ ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) Fn (1...𝑁) ↔ (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) = (𝑛 ∈ (1...𝑁) ↦ ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
607	593, 606	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})) = (𝑛 ∈ (1...𝑁) ↦ ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛)))
608	87, 590, 591, 592, 607	offval2 7637	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∘_f + (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))) = (𝑛 ∈ (1...𝑁) ↦ ((((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) + ((((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))‘𝑛))))
609	565, 589, 608	3eqtr4rd 2787	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∘_f + (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
610	609	mpteq2dva 5205	. 2 ⊢ (𝜑 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∘_f + (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
611	19, 610	eqtr4d 2779	1 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∘_f + (((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}) ∪ ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0})))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 {cab 2713 ≠ wne 2943 ∀wral 3064 ∃wrex 3073 ∃!wreu 3351 {crab 3407 Vcvv 3445 ⦋csb 3855 ∖ cdif 3907 ∪ cun 3908 ∩ cin 3909 ⊆ wss 3910 ∅c0 4282 ifcif 4486 {csn 4586 ⟨cop 4592 class class class wbr 5105 ↦ cmpt 5188 × cxp 5631 ^◡ccnv 5632 ran crn 5634 ↾ cres 5635 “ cima 5636 ∘ ccom 5637 Fun wfun 6490 Fn wfn 6491 ⟶wf 6492 –onto→wfo 6494 –1-1-onto→wf1o 6495 ‘cfv 6496 (class class class)co 7357 ∘_f cof 7615 1^st c1st 7919 2^nd c2nd 7920 ↑_m cmap 8765 ℂcc 11049 ℝcr 11050 0cc0 11051 1c1 11052 + caddc 11054 < clt 11189 ≤ cle 11190 − cmin 11385 ℕcn 12153 ℕ₀cn0 12413 ℤcz 12499 ℤ_≥cuz 12763 ...cfz 13424 ..^cfzo 13567

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-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-op 4593 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-of 7617 df-om 7803 df-1st 7921 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-er 8648 df-map 8767 df-en 8884 df-dom 8885 df-sdom 8886 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-n0 12414 df-z 12500 df-uz 12764 df-fz 13425 df-fzo 13568

This theorem is referenced by: poimirlem17 36095

W3C validator