poimirlem17 - Mathbox for Brendan Leahy

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

Theorem poimirlem17 38211

Description: Lemma for poimir 38227 establishing existence for poimirlem18 38212. (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
poimirlem17	⊢ (𝜑 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

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

**Proof of Theorem poimirlem17**
Step	Hyp	Ref	Expression
1		poimir.0	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
2		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}))))}
3		poimirlem22.1	. . . . 5 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
4		poimirlem22.2	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
5		poimirlem18.3	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾)
6		poimirlem18.4	. . . . 5 ⊢ (𝜑 → (2^nd ‘𝑇) = 0)
7	1, 2, 3, 4, 5, 6	poimirlem16 38210	. . . 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})))))
8		elfznn0 13648	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℕ₀)
9	8	nn0red 12566	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℝ)
10	9	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 ∈ ℝ)
11	1	nnzd 12617	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℤ)
12		peano2zm 12637	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
13	11, 12	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
14	13	zred 12700	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ)
15	14	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑁 − 1) ∈ ℝ)
16	1	nnred 12248	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ ℝ)
17	16	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℝ)
18		elfzle2 13556	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ≤ (𝑁 − 1))
19	18	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 ≤ (𝑁 − 1))
20	16	ltm1d 12147	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) < 𝑁)
21	20	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑁 − 1) < 𝑁)
22	10, 15, 17, 19, 21	lelttrd 11368	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 < 𝑁)
23	22	adantlr 727	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 < 𝑁)
24		fveq2 6882	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (2^nd ‘𝑡) = (2^nd ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩))
25		opex 5446	. . . . . . . . . . . . . . . 16 ⊢ ⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩ ∈ V
26		op2ndg 7999	. . . . . . . . . . . . . . . 16 ⊢ ((⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩ ∈ V ∧ 𝑁 ∈ ℕ) → (2^nd ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) = 𝑁)
27	25, 1, 26	sylancr 598	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (2^nd ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) = 𝑁)
28	24, 27	sylan9eqr 2826	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (2^nd ‘𝑡) = 𝑁)
29	28	adantr 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑡) = 𝑁)
30	23, 29	breqtrrd 5141	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 < (2^nd ‘𝑡))
31	30	iftrued 4498	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (0...(𝑁 − 1))) → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = 𝑦)
32	31	csbeq1d 3863	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (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}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
33		vex 3465	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
34		oveq2 7419	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑦 → (1...𝑗) = (1...𝑦))
35	34	imaeq2d 6063	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑦 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)))
36	35	xpeq1d 5691	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑦 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) × {1}))
37		oveq1 7418	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 = 𝑦 → (𝑗 + 1) = (𝑦 + 1))
38	37	oveq1d 7426	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑦 → ((𝑗 + 1)...𝑁) = ((𝑦 + 1)...𝑁))
39	38	imaeq2d 6063	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑦 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)))
40	39	xpeq1d 5691	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑦 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) × {0}))
41	36, 40	uneq12d 4129	. . . . . . . . . . . . . 14 ⊢ (𝑗 = 𝑦 → ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) × {0})))
42	41	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ (𝑗 = 𝑦 → ((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}))))
43	33, 42	csbie 3894	. . . . . . . . . . . 12 ⊢ ⦋𝑦 / 𝑗⦌((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})))
44		2fveq3 6887	. . . . . . . . . . . . . 14 ⊢ (𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩)))
45		op1stg 7998	. . . . . . . . . . . . . . . . 17 ⊢ ((⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩ ∈ V ∧ 𝑁 ∈ ℕ) → (1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) = ⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩)
46	25, 1, 45	sylancr 598	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) = ⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩)
47	46	fveq2d 6886	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1^st ‘(1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩)) = (1^st ‘⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩))
48		ovex 7444	. . . . . . . . . . . . . . . . 17 ⊢ (1...𝑁) ∈ V
49	48	mptex 7222	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∈ V
50		fvex 6895	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘(1^st ‘𝑇)) ∈ V
51	48	mptex 7222	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∈ V
52	50, 51	coex 7927	. . . . . . . . . . . . . . . 16 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) ∈ V
53	49, 52	op1st 7994	. . . . . . . . . . . . . . 15 ⊢ (1^st ‘⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩) = (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)))
54	47, 53	eqtrdi 2820	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (1^st ‘(1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩)) = (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))))
55	44, 54	sylan9eqr 2826	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (1^st ‘(1^st ‘𝑡)) = (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))))
56		fveq2 6882	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (1^st ‘𝑡) = (1^st ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩))
57	56, 46	sylan9eqr 2826	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (1^st ‘𝑡) = ⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩)
58	57	fveq2d 6886	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩))
59	49, 52	op2nd 7995	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩) = ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
60	58, 59	eqtrdi 2820	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (2^nd ‘(1^st ‘𝑡)) = ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))))
61	60	imaeq1d 6062	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) = (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)))
62	61	xpeq1d 5691	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) × {1}) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ (1...𝑦)) × {1}))
63	60	imaeq1d 6062	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) = (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)))
64	63	xpeq1d 5691	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) × {0}) = ((((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) “ ((𝑦 + 1)...𝑁)) × {0}))
65	62, 64	uneq12d 4129	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → ((((2^nd ‘(1^st ‘𝑡)) “ (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})))
66	55, 65	oveq12d 7429	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → ((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) × {0}))) = ((𝑛 ∈ (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}))))
67	43, 66	eqtrid 2816	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → ⦋𝑦 / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((𝑛 ∈ (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}))))
68	67	adantr 485	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ⦋𝑦 / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((𝑛 ∈ (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}))))
69	32, 68	eqtrd 2804	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) ∧ 𝑦 ∈ (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 ‘𝑇))‘𝑛) + 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}))))
70	69	mpteq2dva 5206	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (𝑦 ∈ (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)) ↦ ((𝑛 ∈ (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})))))
71	70	eqeq2d 2780	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) → (𝐹 = (𝑦 ∈ (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)) ↦ ((𝑛 ∈ (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}))))))
72	71	ex 417	. . . . . 6 ⊢ (𝜑 → (𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (𝐹 = (𝑦 ∈ (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)) ↦ ((𝑛 ∈ (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})))))))
73	72	alrimiv 1954	. . . . 5 ⊢ (𝜑 → ∀𝑡(𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (𝐹 = (𝑦 ∈ (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)) ↦ ((𝑛 ∈ (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})))))))
74		oveq2 7419	. . . . . . . . . . 11 ⊢ (1 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) = (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)))
75	74	eleq1d 2854	. . . . . . . . . 10 ⊢ (1 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → ((((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) ∈ (0..^𝐾) ↔ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) ∈ (0..^𝐾)))
76		oveq2 7419	. . . . . . . . . . 11 ⊢ (0 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) = (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)))
77	76	eleq1d 2854	. . . . . . . . . 10 ⊢ (0 = if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0) → ((((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) ∈ (0..^𝐾) ↔ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) ∈ (0..^𝐾)))
78		fveq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((1^st ‘(1^st ‘𝑇))‘𝑛) = ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)))
79	78	oveq1d 7426	. . . . . . . . . . . . 13 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
80	79	adantl 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
81		elrabi 3653	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑇 ∈ {𝑡 ∈ ((((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...𝑁)))
82	81, 2	eleq2s 2887	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
83		xp1st 8018	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
84	4, 82, 83	3syl 19	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
85		xp1st 8018	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
86		elmapi 8846	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
87	84, 85, 86	3syl 19	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
88	4, 82	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
89		xp2nd 8019	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
90	88, 83, 89	3syl 19	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
91		f1oeq1 6809	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑇)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁)))
92	50, 91	elab 3645	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
93	90, 92	sylib 221	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
94		f1of 6821	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)⟶(1...𝑁))
95	93, 94	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)⟶(1...𝑁))
96		nnuz 12901	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ = (ℤ_≥‘1)
97	1, 96	eleqtrdi 2879	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
98		eluzfz1 13559	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑁))
99	97, 98	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 1 ∈ (1...𝑁))
100	95, 99	ffvelcdmd 7081	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁))
101	87, 100	ffvelcdmd 7081	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾))
102		elfzonn0 13736	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀)
103		peano2nn0 12544	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀ → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℕ₀)
104	101, 102, 103	3syl 19	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℕ₀)
105		elfzo0 13729	. . . . . . . . . . . . . . . 16 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾) ↔ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀ ∧ 𝐾 ∈ ℕ ∧ ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾))
106	101, 105	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀ ∧ 𝐾 ∈ ℕ ∧ ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾))
107	106	simp2d 1159	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐾 ∈ ℕ)
108	104	nn0red 12566	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℝ)
109	107	nnred 12248	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ ℝ)
110		elfzolt2 13697	. . . . . . . . . . . . . . . . 17 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾)
111	101, 110	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾)
112	101, 102	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀)
113	112	nn0zd 12616	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℤ)
114	107	nnzd 12617	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐾 ∈ ℤ)
115		zltp1le 12644	. . . . . . . . . . . . . . . . 17 ⊢ ((((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℤ ∧ 𝐾 ∈ ℤ) → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾 ↔ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ≤ 𝐾))
116	113, 114, 115	syl2anc 595	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾 ↔ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ≤ 𝐾))
117	111, 116	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ≤ 𝐾)
118		fvex 6895	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ V
119		eleq1 2857	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (𝑛 ∈ (1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)))
120	119	anbi2d 641	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝜑 ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁))))
121		fveq2 6882	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (𝑝‘𝑛) = (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)))
122	121	neeq1d 3023	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((𝑝‘𝑛) ≠ 𝐾 ↔ (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾))
123	122	rexbidv 3195	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾 ↔ ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾))
124	120, 123	imbi12d 347	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾) ↔ ((𝜑 ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾)))
125	118, 124, 5	vtocl 3532	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾)
126	100, 125	mpdan 699	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾)
127		fveq1 6881	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))‘((2^nd ‘(1^st ‘𝑇))‘1)))
128	87	ffnd 6707	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
129	128	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
130		1ex 11203	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 1 ∈ V
131		fnconstg 6767	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (1 ∈ V → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
132	130, 131	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1)))
133		c0ex 11200	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 0 ∈ V
134		fnconstg 6767	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (0 ∈ V → (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
135	133, 134	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}) Fn ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))
136	132, 135	pm3.2i 475	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((((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)...𝑁)))
137		dff1o3 6828	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁) ∧ Fun ^◡(2^nd ‘(1^st ‘𝑇))))
138	137	simprbi 502	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ^◡(2^nd ‘(1^st ‘𝑇)))
139		imain 6622	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (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)...𝑁))))
140	93, 138, 139	3syl 19	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
141		nn0p1nn 12543	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑦 ∈ ℕ₀ → (𝑦 + 1) ∈ ℕ)
142	8, 141	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℕ)
143	142	nnred 12248	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℝ)
144	143	ltp1d 12145	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) < ((𝑦 + 1) + 1))
145		fzdisj 13579	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
146	145	imaeq2d 6063	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ((2^nd ‘(1^st ‘𝑇)) “ ∅))
147		ima0 6080	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ∅) = ∅
148	146, 147	eqtrdi 2820	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
149	144, 148	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
150	140, 149	sylan9req 2825	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅)
151		fnun 6650	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((((((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)...𝑁))))
152	136, 150, 151	sylancr 598	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (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)...𝑁))))
153		imaundi 6148	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
154	142	peano2nnd 12250	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ ℕ)
155	154, 96	eleqtrdi 2879	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘1))
156	1	nncnd 12249	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝜑 → 𝑁 ∈ ℂ)
157		npcan1 11639	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
158	156, 157	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
159	158	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) = 𝑁)
160		elfzuz3 13549	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑁 − 1) ∈ (ℤ_≥‘𝑦))
161		eluzp1p1 12890	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘𝑦) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
162	160, 161	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
163	162	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
164	159, 163	eqeltrrd 2870	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ (ℤ_≥‘(𝑦 + 1)))
165		fzsplit2 13577	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((((𝑦 + 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑦 + 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
166	155, 164, 165	syl2an2 698	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
167	166	imaeq2d 6063	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))))
168		f1ofo 6829	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁))
169		foima 6798	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
170	93, 168, 169	3syl 19	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
171	170	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
172	167, 171	eqtr3d 2806	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
173	153, 172	eqtr3id 2818	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
174	173	fneq2d 6630	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (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...𝑁)))
175	152, 174	mpbid 235	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})) Fn (1...𝑁))
176	48	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) ∈ V)
177		inidm 4185	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((1...𝑁) ∩ (1...𝑁)) = (1...𝑁)
178		eqidd 2770	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) = ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)))
179		f1ofn 6822	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
180	93, 179	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
181	180	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
182		fzss2 13592	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑦 + 1)) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
183	164, 182	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
184	142, 96	eleqtrdi 2879	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ (ℤ_≥‘1))
185		eluzfz1 13559	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → 1 ∈ (1...(𝑦 + 1)))
186	184, 185	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 1 ∈ (1...(𝑦 + 1)))
187	186	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 1 ∈ (1...(𝑦 + 1)))
188		fnfvima 7232	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁) ∧ (1...(𝑦 + 1)) ⊆ (1...𝑁) ∧ 1 ∈ (1...(𝑦 + 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
189	181, 183, 187, 188	syl3anc 1396	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
190		fvun1 6973	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((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)))
191	132, 135, 190	mp3an12 1477	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((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)))
192	150, 189, 191	syl2anc 595	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (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)))
193	130	fvconst2 7203	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
194	189, 193	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
195	192, 194	eqtrd 2804	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
196	195	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 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)) = 1)
197	129, 175, 176, 176, 177, 178, 196	ofval 7686	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
198	100, 197	mpidan 701	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
199	127, 198	sylan9eqr 2826	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
200	199	adantllr 731	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑝 ∈ ran 𝐹) ∧ 𝑦 ∈ (0...(𝑁 − 1))) ∧ 𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
201		fveq2 6882	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (2^nd ‘𝑡) = (2^nd ‘𝑇))
202	201	breq2d 5123	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑡 = 𝑇 → (𝑦 < (2^nd ‘𝑡) ↔ 𝑦 < (2^nd ‘𝑇)))
203	202	ifbid 4514	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑡 = 𝑇 → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)))
204		2fveq3 6887	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑡 = 𝑇 → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘𝑇)))
205		2fveq3 6887	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (𝑡 = 𝑇 → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘(1^st ‘𝑇)))
206	205	imaeq1d 6062	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)))
207	206	xpeq1d 5691	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}))
208	205	imaeq1d 6062	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
209	208	xpeq1d 5691	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
210	207, 209	uneq12d 4129	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑡 = 𝑇 → ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
211	204, 210	oveq12d 7429	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑡 = 𝑇 → ((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}))))
212	203, 211	csbeq12dv 3868	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑡 = 𝑇 → ⦋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}))))
213	212	mpteq2dv 5207	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑡 = 𝑇 → (𝑦 ∈ (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})))))
214	213	eqeq2d 2780	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (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}))))))
215	214, 2	elrab2 3661	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((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}))))))
216	215	simprbi 502	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
217	4, 216	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
218	217	rneqd 5929	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → ran 𝐹 = ran (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
219	218	eleq2d 2855	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → (𝑝 ∈ ran 𝐹 ↔ 𝑝 ∈ ran (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
220		eqid 2769	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑦 ∈ (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}))))
221		ovex 7444	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) ∈ V
222	221	csbex 5276	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) ∈ V
223	220, 222	elrnmpti 5953	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑝 ∈ ran (𝑦 ∈ (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}))))
224	219, 223	bitrdi 290	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑝 ∈ ran 𝐹 ↔ ∃𝑦 ∈ (0...(𝑁 − 1))𝑝 = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
225	6	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) = 0)
226		elfzle1 13555	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 0 ≤ 𝑦)
227	226	adantl 486	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 0 ≤ 𝑦)
228	225, 227	eqbrtrd 5135	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) ≤ 𝑦)
229		0re 11210	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ 0 ∈ ℝ
230	6, 229	eqeltrdi 2877	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (2^nd ‘𝑇) ∈ ℝ)
231		lenlt 11288	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((2^nd ‘𝑇) ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
232	230, 9, 231	syl2an 607	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
233	228, 232	mpbid 235	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ¬ 𝑦 < (2^nd ‘𝑇))
234	233	iffalsed 4501	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) = (𝑦 + 1))
235	234	csbeq1d 3863	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑦 ∈ (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}))))
236		ovex 7444	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 + 1) ∈ V
237		oveq2 7419	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 = (𝑦 + 1) → (1...𝑗) = (1...(𝑦 + 1)))
238	237	imaeq2d 6063	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
239	238	xpeq1d 5691	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}))
240		oveq1 7418	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑗 = (𝑦 + 1) → (𝑗 + 1) = ((𝑦 + 1) + 1))
241	240	oveq1d 7426	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 = (𝑦 + 1) → ((𝑗 + 1)...𝑁) = (((𝑦 + 1) + 1)...𝑁))
242	241	imaeq2d 6063	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
243	242	xpeq1d 5691	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))
244	239, 243	uneq12d 4129	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑗 = (𝑦 + 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})))
245	244	oveq2d 7427	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑗 = (𝑦 + 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}))))
246	236, 245	csbie 3894	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ⦋(𝑦 + 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})))
247	235, 246	eqtrdi 2820	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (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}))))
248	247	eqeq2d 2780	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑦 ∈ (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})))))
249	248	rexbidva 3193	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (∃𝑦 ∈ (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))𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))))
250	224, 249	bitrd 282	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑝 ∈ ran 𝐹 ↔ ∃𝑦 ∈ (0...(𝑁 − 1))𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0})))))
251	250	biimpa 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → ∃𝑦 ∈ (0...(𝑁 − 1))𝑝 = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))))
252	200, 251	r19.29a 3179	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
253		eqtr3 2791	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∧ 𝐾 = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1)) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = 𝐾)
254	253	ex 417	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) → (𝐾 = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = 𝐾))
255	252, 254	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → (𝐾 = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = 𝐾))
256	255	necon3d 2985	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → ((𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1)))
257	256	rexlimdva 3172	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1)))
258	126, 257	mpd 16	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
259	108, 109, 117, 258	leneltd 11364	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) < 𝐾)
260		elfzo0 13729	. . . . . . . . . . . . . 14 ⊢ ((((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ (0..^𝐾) ↔ ((((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℕ₀ ∧ 𝐾 ∈ ℕ ∧ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) < 𝐾))
261	104, 107, 259, 260	syl3anbrc 1360	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ (0..^𝐾))
262	261	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ (0..^𝐾))
263	80, 262	eqeltrd 2869	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) ∈ (0..^𝐾))
264	263	adantlr 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) ∈ (0..^𝐾))
265	87	ffvelcdmda 7080	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾))
266		elfzonn0 13736	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
267	265, 266	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
268	267	nn0cnd 12567	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℂ)
269	268	addridd 11410	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) = ((1^st ‘(1^st ‘𝑇))‘𝑛))
270	269, 265	eqeltrd 2869	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) ∈ (0..^𝐾))
271	270	adantr 485	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) ∈ (0..^𝐾))
272	75, 77, 264, 271	ifbothda 4529	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) ∈ (0..^𝐾))
273	272	fmpttd 7111	. . . . . . . 8 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))):(1...𝑁)⟶(0..^𝐾))
274		ovex 7444	. . . . . . . . 9 ⊢ (0..^𝐾) ∈ V
275	274, 48	elmap 8869	. . . . . . . 8 ⊢ ((𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∈ ((0..^𝐾) ↑_m (1...𝑁)) ↔ (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))):(1...𝑁)⟶(0..^𝐾))
276	273, 275	sylibr 237	. . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
277		simpr 489	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ∈ (1...(𝑁 − 1)))
278		1z 12624	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℤ
279	13, 278	jctil 528	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ))
280		elfzelz 13552	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℤ)
281	280, 278	jctir 529	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → (𝑛 ∈ ℤ ∧ 1 ∈ ℤ))
282		fzaddel 13586	. . . . . . . . . . . . . . . 16 ⊢ (((1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
283	279, 281, 282	syl2an 607	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
284	277, 283	mpbid 235	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1)))
285	158	oveq2d 7427	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
286	285	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
287	284, 286	eleqtrd 2871	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...𝑁))
288	287	ralrimiva 3163	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑛 + 1) ∈ ((1 + 1)...𝑁))
289		simpr 489	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → 𝑦 ∈ ((1 + 1)...𝑁))
290		peano2z 12635	. . . . . . . . . . . . . . . . . . 19 ⊢ (1 ∈ ℤ → (1 + 1) ∈ ℤ)
291	278, 290	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ (1 + 1) ∈ ℤ
292	11, 291	jctil 528	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ))
293		elfzelz 13552	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℤ)
294	293, 278	jctir 529	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → (𝑦 ∈ ℤ ∧ 1 ∈ ℤ))
295		fzsubel 13588	. . . . . . . . . . . . . . . . 17 ⊢ ((((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑦 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
296	292, 294, 295	syl2an 607	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
297	289, 296	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1)))
298		ax-1cn 11158	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℂ
299	298, 298	pncan3oi 11473	. . . . . . . . . . . . . . . 16 ⊢ ((1 + 1) − 1) = 1
300	299	oveq1i 7421	. . . . . . . . . . . . . . 15 ⊢ (((1 + 1) − 1)...(𝑁 − 1)) = (1...(𝑁 − 1))
301	297, 300	eleqtrdi 2879	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (1...(𝑁 − 1)))
302	293	zcnd 12701	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℂ)
303		elfznn 13581	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℕ)
304	303	nncnd 12249	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℂ)
305		subadd2 11461	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
306	298, 305	mp3an2 1475	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
307	306	bicomd 226	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑛 + 1) = 𝑦 ↔ (𝑦 − 1) = 𝑛))
308		eqcom 2776	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝑛 + 1) ↔ (𝑛 + 1) = 𝑦)
309		eqcom 2776	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (𝑦 − 1) ↔ (𝑦 − 1) = 𝑛)
310	307, 308, 309	3bitr4g 317	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
311	302, 304, 310	syl2an 607	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ((1 + 1)...𝑁) ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
312	311	ralrimiva 3163	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
313	312	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
314		reu6i 3698	. . . . . . . . . . . . . 14 ⊢ (((𝑦 − 1) ∈ (1...(𝑁 − 1)) ∧ ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1))) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
315	301, 313, 314	syl2anc 595	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
316	315	ralrimiva 3163	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑦 ∈ ((1 + 1)...𝑁)∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
317		eqid 2769	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1))
318	317	f1ompt 7107	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁) ↔ (∀𝑛 ∈ (1...(𝑁 − 1))(𝑛 + 1) ∈ ((1 + 1)...𝑁) ∧ ∀𝑦 ∈ ((1 + 1)...𝑁)∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1)))
319	288, 316, 318	sylanbrc 594	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁))
320		f1osng 6864	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ ∧ 1 ∈ V) → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
321	1, 130, 320	sylancl 597	. . . . . . . . . . 11 ⊢ (𝜑 → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
322	14, 16	ltnled 11357	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑁 − 1) < 𝑁 ↔ ¬ 𝑁 ≤ (𝑁 − 1)))
323	20, 322	mpbid 235	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ 𝑁 ≤ (𝑁 − 1))
324		elfzle2 13556	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ (1...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
325	323, 324	nsyl 141	. . . . . . . . . . . 12 ⊢ (𝜑 → ¬ 𝑁 ∈ (1...(𝑁 − 1)))
326		disjsn 4680	. . . . . . . . . . . 12 ⊢ (((1...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1)))
327	325, 326	sylibr 237	. . . . . . . . . . 11 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∩ {𝑁}) = ∅)
328		1re 11208	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
329	328	ltp1i 12119	. . . . . . . . . . . . . . 15 ⊢ 1 < (1 + 1)
330	291	zrei 12597	. . . . . . . . . . . . . . . 16 ⊢ (1 + 1) ∈ ℝ
331	328, 330	ltnlei 11331	. . . . . . . . . . . . . . 15 ⊢ (1 < (1 + 1) ↔ ¬ (1 + 1) ≤ 1)
332	329, 331	mpbi 233	. . . . . . . . . . . . . 14 ⊢ ¬ (1 + 1) ≤ 1
333		elfzle1 13555	. . . . . . . . . . . . . 14 ⊢ (1 ∈ ((1 + 1)...𝑁) → (1 + 1) ≤ 1)
334	332, 333	mto 200	. . . . . . . . . . . . 13 ⊢ ¬ 1 ∈ ((1 + 1)...𝑁)
335		disjsn 4680	. . . . . . . . . . . . 13 ⊢ ((((1 + 1)...𝑁) ∩ {1}) = ∅ ↔ ¬ 1 ∈ ((1 + 1)...𝑁))
336	334, 335	mpbir 234	. . . . . . . . . . . 12 ⊢ (((1 + 1)...𝑁) ∩ {1}) = ∅
337	336	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (((1 + 1)...𝑁) ∩ {1}) = ∅)
338		f1oun 6841	. . . . . . . . . . 11 ⊢ ((((𝑛 ∈ (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}))
339	319, 321, 327, 337, 338	syl22anc 851	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1}))
340	130	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ V)
341	158, 97	eqeltrd 2869	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘1))
342		uzid 12877	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 − 1) ∈ ℤ → (𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)))
343		peano2uz 12925	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
344	13, 342, 343	3syl 19	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
345	158, 344	eqeltrrd 2870	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘(𝑁 − 1)))
346		fzsplit2 13577	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑁 − 1))) → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
347	341, 345, 346	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
348	158	oveq1d 7426	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = (𝑁...𝑁))
349		fzsn 13594	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℤ → (𝑁...𝑁) = {𝑁})
350	11, 349	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁...𝑁) = {𝑁})
351	348, 350	eqtrd 2804	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = {𝑁})
352	351	uneq2d 4128	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = ((1...(𝑁 − 1)) ∪ {𝑁}))
353	347, 352	eqtr2d 2805	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ {𝑁}) = (1...𝑁))
354		iftrue 4496	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
355	354	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 = 𝑁) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
356	1, 340, 353, 355	fmptapd 7170	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
357		eleq1 2857	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ (1...(𝑁 − 1)) ↔ 𝑁 ∈ (1...(𝑁 − 1))))
358	357	notbid 321	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑁 → (¬ 𝑛 ∈ (1...(𝑁 − 1)) ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1))))
359	325, 358	syl5ibrcom 250	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑛 = 𝑁 → ¬ 𝑛 ∈ (1...(𝑁 − 1))))
360	359	necon2ad 2979	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ≠ 𝑁))
361	360	imp 411	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ≠ 𝑁)
362		ifnefalse 4502	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ≠ 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
363	361, 362	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
364	363	mpteq2dva 5206	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)))
365	364	uneq1d 4127	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
366	356, 365	eqtr3d 2806	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
367	347, 352	eqtrd 2804	. . . . . . . . . . 11 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ {𝑁}))
368		uzid 12877	. . . . . . . . . . . . . 14 ⊢ (1 ∈ ℤ → 1 ∈ (ℤ_≥‘1))
369		peano2uz 12925	. . . . . . . . . . . . . 14 ⊢ (1 ∈ (ℤ_≥‘1) → (1 + 1) ∈ (ℤ_≥‘1))
370	278, 368, 369	mp2b 10	. . . . . . . . . . . . 13 ⊢ (1 + 1) ∈ (ℤ_≥‘1)
371		fzsplit2 13577	. . . . . . . . . . . . 13 ⊢ (((1 + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘1)) → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
372	370, 97, 371	sylancr 598	. . . . . . . . . . . 12 ⊢ (𝜑 → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
373		fzsn 13594	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ ℤ → (1...1) = {1})
374	278, 373	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ (1...1) = {1}
375	374	uneq1i 4124	. . . . . . . . . . . . 13 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = ({1} ∪ ((1 + 1)...𝑁))
376	375	equncomi 4120	. . . . . . . . . . . 12 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = (((1 + 1)...𝑁) ∪ {1})
377	372, 376	eqtrdi 2820	. . . . . . . . . . 11 ⊢ (𝜑 → (1...𝑁) = (((1 + 1)...𝑁) ∪ {1}))
378	366, 367, 377	f1oeq123d 6815	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1})))
379	339, 378	mpbird 260	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁))
380		f1oco 6845	. . . . . . . . 9 ⊢ (((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...𝑁))
381	93, 379, 380	syl2anc 595	. . . . . . . 8 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁))
382		f1oeq1 6809	. . . . . . . . 9 ⊢ (𝑓 = ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁)))
383	52, 382	elab 3645	. . . . . . . 8 ⊢ (((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁))
384	381, 383	sylibr 237	. . . . . . 7 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
385	276, 384	opelxpd 5701	. . . . . 6 ⊢ (𝜑 → ⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩ ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
386	1	nnnn0d 12565	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
387		nn0fz0 13653	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ ↔ 𝑁 ∈ (0...𝑁))
388	386, 387	sylib 221	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...𝑁))
389	385, 388	opelxpd 5701	. . . . 5 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
390		elrab3t 3656	. . . . 5 ⊢ ((∀𝑡(𝑡 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (𝐹 = (𝑦 ∈ (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)) ↦ ((𝑛 ∈ (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))))⟩, 𝑁⟩ ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁))) → (⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ {𝑡 ∈ ((((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...(𝑁 − 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}))))))
391	73, 389, 390	syl2anc 595	. . . 4 ⊢ (𝜑 → (⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ {𝑡 ∈ ((((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...(𝑁 − 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}))))))
392	7, 391	mpbird 260	. . 3 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ {𝑡 ∈ ((((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}))))})
393	392, 2	eleqtrrdi 2880	. 2 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ 𝑆)
394		fveqeq2 6891	. . . . . 6 ⊢ (⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ = 𝑇 → ((2^nd ‘⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩) = 𝑁 ↔ (2^nd ‘𝑇) = 𝑁))
395	27, 394	syl5ibcom 248	. . . . 5 ⊢ (𝜑 → (⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ = 𝑇 → (2^nd ‘𝑇) = 𝑁))
396	1	nnne0d 12286	. . . . . 6 ⊢ (𝜑 → 𝑁 ≠ 0)
397		neeq1 3026	. . . . . 6 ⊢ ((2^nd ‘𝑇) = 𝑁 → ((2^nd ‘𝑇) ≠ 0 ↔ 𝑁 ≠ 0))
398	396, 397	syl5ibrcom 250	. . . . 5 ⊢ (𝜑 → ((2^nd ‘𝑇) = 𝑁 → (2^nd ‘𝑇) ≠ 0))
399	395, 398	syld 48	. . . 4 ⊢ (𝜑 → (⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ = 𝑇 → (2^nd ‘𝑇) ≠ 0))
400	399	necon2d 2987	. . 3 ⊢ (𝜑 → ((2^nd ‘𝑇) = 0 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ≠ 𝑇))
401	6, 400	mpd 16	. 2 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ≠ 𝑇)
402		neeq1 3026	. . 3 ⊢ (𝑧 = ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ → (𝑧 ≠ 𝑇 ↔ ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ≠ 𝑇))
403	402	rspcev 3588	. 2 ⊢ ((⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ 𝑆 ∧ ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ≠ 𝑇) → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)
404	393, 401, 403	syl2anc 595	1 ⊢ (𝜑 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 ∀wal 1565 = wceq 1567 ∈ wcel 2149 {cab 2747 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ∃!wreu 3373 {crab 3422 Vcvv 3461 ⦋csb 3859 ∪ cun 3909 ∩ cin 3910 ⊆ wss 3911 ∅c0 4292 ifcif 4490 {csn 4592 ⟨cop 4598 class class class wbr 5111 ↦ cmpt 5194 × cxp 5660 ^◡ccnv 5661 ran crn 5663 “ cima 5665 ∘ ccom 5666 Fun wfun 6531 Fn wfn 6532 ⟶wf 6533 –onto→wfo 6535 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7411 ∘_f cof 7673 1^st c1st 7984 2^nd c2nd 7985 ↑_m cmap 8824 ℂcc 11098 ℝcr 11099 0cc0 11100 1c1 11101 + caddc 11103 < clt 11243 ≤ cle 11244 − cmin 11441 ℕcn 12233 ℕ₀cn0 12504 ℤcz 12591 ℤ_≥cuz 12862 ...cfz 13535 ..^cfzo 13682

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683

This theorem is referenced by: poimirlem18 38212

W3C validator