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 36095

Description: Lemma for poimir 36111 establishing existence for poimirlem18 36096. (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 36094	. . . 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 13534	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℕ₀)
9	8	nn0red 12474	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ∈ ℝ)
10	9	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 ∈ ℝ)
11	1	nnzd 12526	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℤ)
12		peano2zm 12546	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
13	11, 12	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
14	13	zred 12607	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ)
15	14	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑁 − 1) ∈ ℝ)
16	1	nnred 12168	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ ℝ)
17	16	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℝ)
18		elfzle2 13445	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 𝑦 ≤ (𝑁 − 1))
19	18	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 ≤ (𝑁 − 1))
20	16	ltm1d 12087	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) < 𝑁)
21	20	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (𝑁 − 1) < 𝑁)
22	10, 15, 17, 19, 21	lelttrd 11313	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑦 < 𝑁)
23	22	adantlr 713	. . . . . . . . . . . . 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 6842	. . . . . . . . . . . . . . 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 5421	. . . . . . . . . . . . . . . 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 7934	. . . . . . . . . . . . . . . 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 587	. . . . . . . . . . . . . . 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 2798	. . . . . . . . . . . . . 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 481	. . . . . . . . . . . . 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 5133	. . . . . . . . . . . 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 4494	. . . . . . . . . . 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 3859	. . . . . . . . . 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 3449	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
34		oveq2 7365	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑦 → (1...𝑗) = (1...𝑦))
35	34	imaeq2d 6013	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑦 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)))
36	35	xpeq1d 5662	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑦 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑦)) × {1}))
37		oveq1 7364	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 = 𝑦 → (𝑗 + 1) = (𝑦 + 1))
38	37	oveq1d 7372	. . . . . . . . . . . . . . . . 17 ⊢ (𝑗 = 𝑦 → ((𝑗 + 1)...𝑁) = ((𝑦 + 1)...𝑁))
39	38	imaeq2d 6013	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 = 𝑦 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)))
40	39	xpeq1d 5662	. . . . . . . . . . . . . . 15 ⊢ (𝑗 = 𝑦 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑡)) “ ((𝑦 + 1)...𝑁)) × {0}))
41	36, 40	uneq12d 4124	. . . . . . . . . . . . . 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 7373	. . . . . . . . . . . . 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 3891	. . . . . . . . . . . 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 6847	. . . . . . . . . . . . . 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 7933	. . . . . . . . . . . . . . . . 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 587	. . . . . . . . . . . . . . . 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 6846	. . . . . . . . . . . . . . 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 7390	. . . . . . . . . . . . . . . . 17 ⊢ (1...𝑁) ∈ V
49	48	mptex 7173	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∈ V
50		fvex 6855	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘(1^st ‘𝑇)) ∈ V
51	48	mptex 7173	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∈ V
52	50, 51	coex 7867	. . . . . . . . . . . . . . . 16 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) ∈ V
53	49, 52	op1st 7929	. . . . . . . . . . . . . . 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 2792	. . . . . . . . . . . . . 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 2798	. . . . . . . . . . . . 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 6842	. . . . . . . . . . . . . . . . . . 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 2798	. . . . . . . . . . . . . . . . . 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 6846	. . . . . . . . . . . . . . . . 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 7930	. . . . . . . . . . . . . . . . 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 2792	. . . . . . . . . . . . . . . 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 6012	. . . . . . . . . . . . . . 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 5662	. . . . . . . . . . . . . 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 6012	. . . . . . . . . . . . . . 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 5662	. . . . . . . . . . . . . 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 4124	. . . . . . . . . . . . 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 7375	. . . . . . . . . . . 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 2788	. . . . . . . . . . 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 481	. . . . . . . . . 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 2776	. . . . . . . . 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 5205	. . . . . . . 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 2747	. . . . . . 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 413	. . . . . 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 1930	. . . . 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 7365	. . . . . . . . . . 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 2822	. . . . . . . . . 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 7365	. . . . . . . . . . 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 2822	. . . . . . . . . 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 6842	. . . . . . . . . . . . . 14 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((1^st ‘(1^st ‘𝑇))‘𝑛) = ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)))
79	78	oveq1d 7372	. . . . . . . . . . . . 13 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
80	79	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
81		elrabi 3639	. . . . . . . . . . . . . . . . . . 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 2856	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
83		xp1st 7953	. . . . . . . . . . . . . . . . . 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 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
85		xp1st 7953	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
86		elmapi 8787	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
87	84, 85, 86	3syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
88	4, 82	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
89		xp2nd 7954	. . . . . . . . . . . . . . . . . . . 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 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
91		f1oeq1 6772	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑇)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁)))
92	50, 91	elab 3630	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
93	90, 92	sylib 217	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
94		f1of 6784	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)⟶(1...𝑁))
95	93, 94	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)⟶(1...𝑁))
96		nnuz 12806	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ = (ℤ_≥‘1)
97	1, 96	eleqtrdi 2848	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
98		eluzfz1 13448	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑁))
99	97, 98	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 1 ∈ (1...𝑁))
100	95, 99	ffvelcdmd 7036	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁))
101	87, 100	ffvelcdmd 7036	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾))
102		elfzonn0 13617	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀)
103		peano2nn0 12453	. . . . . . . . . . . . . . 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 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℕ₀)
105		elfzo0 13613	. . . . . . . . . . . . . . . 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 217	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀ ∧ 𝐾 ∈ ℕ ∧ ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾))
107	106	simp2d 1143	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐾 ∈ ℕ)
108	104	nn0red 12474	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ ℝ)
109	107	nnred 12168	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ∈ ℝ)
110		elfzolt2 13581	. . . . . . . . . . . . . . . . 17 ⊢ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾)
111	101, 110	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾)
112	101, 102	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℕ₀)
113	112	nn0zd 12525	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) ∈ ℤ)
114	107	nnzd 12526	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐾 ∈ ℤ)
115		zltp1le 12553	. . . . . . . . . . . . . . . . 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 584	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) < 𝐾 ↔ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ≤ 𝐾))
117	111, 116	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ≤ 𝐾)
118		fvex 6855	. . . . . . . . . . . . . . . . . 18 ⊢ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ V
119		eleq1 2825	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (𝑛 ∈ (1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)))
120	119	anbi2d 629	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝜑 ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁))))
121		fveq2 6842	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (𝑝‘𝑛) = (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)))
122	121	neeq1d 3003	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → ((𝑝‘𝑛) ≠ 𝐾 ↔ (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾))
123	122	rexbidv 3175	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1) → (∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾 ↔ ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾))
124	120, 123	imbi12d 344	. . . . . . . . . . . . . . . . . 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 3518	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ ((2^nd ‘(1^st ‘𝑇))‘1) ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾)
126	100, 125	mpdan 685	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾)
127		fveq1 6841	. . . . . . . . . . . . . . . . . . . . . 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 6669	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
129	128	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1^st ‘(1^st ‘𝑇)) Fn (1...𝑁))
130		1ex 11151	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 1 ∈ V
131		fnconstg 6730	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 11149	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 0 ∈ V
134		fnconstg 6730	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 471	. . . . . . . . . . . . . . . . . . . . . . . . . 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 6790	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 497	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ^◡(2^nd ‘(1^st ‘𝑇)))
139		imain 6586	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 18	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))))
141		nn0p1nn 12452	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑦 ∈ ℕ₀ → (𝑦 + 1) ∈ ℕ)
142	8, 141	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℕ)
143	142	nnred 12168	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ ℝ)
144	143	ltp1d 12085	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) < ((𝑦 + 1) + 1))
145		fzdisj 13468	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁)) = ∅)
146	145	imaeq2d 6013	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ((2^nd ‘(1^st ‘𝑇)) “ ∅))
147		ima0 6029	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ∅) = ∅
148	146, 147	eqtrdi 2792	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑦 + 1) < ((𝑦 + 1) + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
149	144, 148	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∩ (((𝑦 + 1) + 1)...𝑁))) = ∅)
150	140, 149	sylan9req 2797	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∩ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = ∅)
151		fnun 6614	. . . . . . . . . . . . . . . . . . . . . . . . . 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 587	. . . . . . . . . . . . . . . . . . . . . . . . 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 6102	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
154	142	peano2nnd 12170	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ ℕ)
155	154, 96	eleqtrdi 2848	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑦 + 1) + 1) ∈ (ℤ_≥‘1))
156	1	nncnd 12169	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝜑 → 𝑁 ∈ ℂ)
157		npcan1 11580	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
158	156, 157	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
159	158	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) = 𝑁)
160		elfzuz3 13438	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑁 − 1) ∈ (ℤ_≥‘𝑦))
161		eluzp1p1 12791	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘𝑦) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
162	160, 161	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
163	162	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑦 + 1)))
164	159, 163	eqeltrrd 2839	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ (ℤ_≥‘(𝑦 + 1)))
165		fzsplit2 13466	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((((𝑦 + 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑦 + 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
166	155, 164, 165	syl2an2 684	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...𝑁) = ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁)))
167	166	imaeq2d 6013	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))))
168		f1ofo 6791	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁))
169		foima 6761	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–onto→(1...𝑁) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
170	93, 168, 169	3syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
171	170	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑁)) = (1...𝑁))
172	167, 171	eqtr3d 2778	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇)) “ ((1...(𝑦 + 1)) ∪ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
173	153, 172	eqtr3id 2790	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) ∪ ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁))) = (1...𝑁))
174	173	fneq2d 6596	. . . . . . . . . . . . . . . . . . . . . . . . 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 231	. . . . . . . . . . . . . . . . . . . . . . . 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 4178	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((1...𝑁) ∩ (1...𝑁)) = (1...𝑁)
178		eqidd 2737	. . . . . . . . . . . . . . . . . . . . . . . 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 6785	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
180	93, 179	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
181	180	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘(1^st ‘𝑇)) Fn (1...𝑁))
182		fzss2 13481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑁 ∈ (ℤ_≥‘(𝑦 + 1)) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
183	164, 182	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (1...(𝑦 + 1)) ⊆ (1...𝑁))
184	142, 96	eleqtrdi 2848	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → (𝑦 + 1) ∈ (ℤ_≥‘1))
185		eluzfz1 13448	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑦 + 1) ∈ (ℤ_≥‘1) → 1 ∈ (1...(𝑦 + 1)))
186	184, 185	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 1 ∈ (1...(𝑦 + 1)))
187	186	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 1 ∈ (1...(𝑦 + 1)))
188		fnfvima 7183	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 1371	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘(1^st ‘𝑇))‘1) ∈ ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
190		fvun1 6932	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 1451	. . . . . . . . . . . . . . . . . . . . . . . . . . 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 584	. . . . . . . . . . . . . . . . . . . . . . . . . 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 7153	. . . . . . . . . . . . . . . . . . . . . . . . . . 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 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1})‘((2^nd ‘(1^st ‘𝑇))‘1)) = 1)
195	192, 194	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . . . . . 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 481	. . . . . . . . . . . . . . . . . . . . . . . 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 7628	. . . . . . . . . . . . . . . . . . . . . . 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 687	. . . . . . . . . . . . . . . . . . . . . 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 2798	. . . . . . . . . . . . . . . . . . . . 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 717	. . . . . . . . . . . . . . . . . . . 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 6842	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (2^nd ‘𝑡) = (2^nd ‘𝑇))
202	201	breq2d 5117	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑡 = 𝑇 → (𝑦 < (2^nd ‘𝑡) ↔ 𝑦 < (2^nd ‘𝑇)))
203	202	ifbid 4509	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑡 = 𝑇 → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)))
204		2fveq3 6847	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝑡 = 𝑇 → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘𝑇)))
205		2fveq3 6847	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (𝑡 = 𝑇 → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘(1^st ‘𝑇)))
206	205	imaeq1d 6012	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)))
207	206	xpeq1d 5662	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}))
208	205	imaeq1d 6012	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
209	208	xpeq1d 5662	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
210	207, 209	uneq12d 4124	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 7375	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 3864	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 2747	. . . . . . . . . . . . . . . . . . . . . . . . . . . 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 3648	. . . . . . . . . . . . . . . . . . . . . . . . . . 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 497	. . . . . . . . . . . . . . . . . . . . . . . . . 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 17	. . . . . . . . . . . . . . . . . . . . . . . . 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 5893	. . . . . . . . . . . . . . . . . . . . . . . 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 2823	. . . . . . . . . . . . . . . . . . . . . . 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 2736	. . . . . . . . . . . . . . . . . . . . . . . 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 7390	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))) ∈ V
222	221	csbex 5268	. . . . . . . . . . . . . . . . . . . . . . . 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 5915	. . . . . . . . . . . . . . . . . . . . . . 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 286	. . . . . . . . . . . . . . . . . . . . . 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 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) = 0)
226		elfzle1 13444	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑦 ∈ (0...(𝑁 − 1)) → 0 ≤ 𝑦)
227	226	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → 0 ≤ 𝑦)
228	225, 227	eqbrtrd 5127	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → (2^nd ‘𝑇) ≤ 𝑦)
229		0re 11157	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ 0 ∈ ℝ
230	6, 229	eqeltrdi 2846	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (2^nd ‘𝑇) ∈ ℝ)
231		lenlt 11233	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((2^nd ‘𝑇) ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
232	230, 9, 231	syl2an 596	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ((2^nd ‘𝑇) ≤ 𝑦 ↔ ¬ 𝑦 < (2^nd ‘𝑇)))
233	228, 232	mpbid 231	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → ¬ 𝑦 < (2^nd ‘𝑇))
234	233	iffalsed 4497	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑦 ∈ (0...(𝑁 − 1))) → if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) = (𝑦 + 1))
235	234	csbeq1d 3859	. . . . . . . . . . . . . . . . . . . . . . . . 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 7390	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑦 + 1) ∈ V
237		oveq2 7365	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 = (𝑦 + 1) → (1...𝑗) = (1...(𝑦 + 1)))
238	237	imaeq2d 6013	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))))
239	238	xpeq1d 5662	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...(𝑦 + 1))) × {1}))
240		oveq1 7364	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑗 = (𝑦 + 1) → (𝑗 + 1) = ((𝑦 + 1) + 1))
241	240	oveq1d 7372	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑗 = (𝑦 + 1) → ((𝑗 + 1)...𝑁) = (((𝑦 + 1) + 1)...𝑁))
242	241	imaeq2d 6013	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑗 = (𝑦 + 1) → ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)))
243	242	xpeq1d 5662	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑗 = (𝑦 + 1) → (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ (((𝑦 + 1) + 1)...𝑁)) × {0}))
244	239, 243	uneq12d 4124	. . . . . . . . . . . . . . . . . . . . . . . . . . 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 7373	. . . . . . . . . . . . . . . . . . . . . . . . . 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 3891	. . . . . . . . . . . . . . . . . . . . . . . . 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 2792	. . . . . . . . . . . . . . . . . . . . . . . 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 2747	. . . . . . . . . . . . . . . . . . . . . . 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 3173	. . . . . . . . . . . . . . . . . . . . . 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 278	. . . . . . . . . . . . . . . . . . . . 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 477	. . . . . . . . . . . . . . . . . . . 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 3159	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
253		eqtr3 2762	. . . . . . . . . . . . . . . . . . . 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 413	. . . . . . . . . . . . . . . . . . 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 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → (𝐾 = (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) → (𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) = 𝐾))
256	255	necon3d 2964	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑝 ∈ ran 𝐹) → ((𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1)))
257	256	rexlimdva 3152	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (∃𝑝 ∈ ran 𝐹(𝑝‘((2^nd ‘(1^st ‘𝑇))‘1)) ≠ 𝐾 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1)))
258	126, 257	mpd 15	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾 ≠ (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1))
259	108, 109, 117, 258	leneltd 11309	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) < 𝐾)
260		elfzo0 13613	. . . . . . . . . . . . . 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 1343	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ (0..^𝐾))
262	261	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘((2^nd ‘(1^st ‘𝑇))‘1)) + 1) ∈ (0..^𝐾))
263	80, 262	eqeltrd 2838	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) ∈ (0..^𝐾))
264	263	adantlr 713	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ∧ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 1) ∈ (0..^𝐾))
265	87	ffvelcdmda 7035	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾))
266		elfzonn0 13617	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ (0..^𝐾) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
267	265, 266	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℕ₀)
268	267	nn0cnd 12475	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ((1^st ‘(1^st ‘𝑇))‘𝑛) ∈ ℂ)
269	268	addid1d 11355	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) = ((1^st ‘(1^st ‘𝑇))‘𝑛))
270	269, 265	eqeltrd 2838	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) ∈ (0..^𝐾))
271	270	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...𝑁)) ∧ ¬ 𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + 0) ∈ (0..^𝐾))
272	75, 77, 264, 271	ifbothda 4524	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0)) ∈ (0..^𝐾))
273	272	fmpttd 7063	. . . . . . . 8 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))):(1...𝑁)⟶(0..^𝐾))
274		ovex 7390	. . . . . . . . 9 ⊢ (0..^𝐾) ∈ V
275	274, 48	elmap 8809	. . . . . . . 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 233	. . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
277		simpr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ∈ (1...(𝑁 − 1)))
278		1z 12533	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℤ
279	13, 278	jctil 520	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ))
280		elfzelz 13441	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℤ)
281	280, 278	jctir 521	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → (𝑛 ∈ ℤ ∧ 1 ∈ ℤ))
282		fzaddel 13475	. . . . . . . . . . . . . . . 16 ⊢ (((1 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) ∧ (𝑛 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
283	279, 281, 282	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 ∈ (1...(𝑁 − 1)) ↔ (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1))))
284	277, 283	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...((𝑁 − 1) + 1)))
285	158	oveq2d 7373	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
286	285	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → ((1 + 1)...((𝑁 − 1) + 1)) = ((1 + 1)...𝑁))
287	284, 286	eleqtrd 2840	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑛 + 1) ∈ ((1 + 1)...𝑁))
288	287	ralrimiva 3143	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑛 + 1) ∈ ((1 + 1)...𝑁))
289		simpr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → 𝑦 ∈ ((1 + 1)...𝑁))
290		peano2z 12544	. . . . . . . . . . . . . . . . . . 19 ⊢ (1 ∈ ℤ → (1 + 1) ∈ ℤ)
291	278, 290	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ (1 + 1) ∈ ℤ
292	11, 291	jctil 520	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ))
293		elfzelz 13441	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℤ)
294	293, 278	jctir 521	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → (𝑦 ∈ ℤ ∧ 1 ∈ ℤ))
295		fzsubel 13477	. . . . . . . . . . . . . . . . 17 ⊢ ((((1 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑦 ∈ ℤ ∧ 1 ∈ ℤ)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
296	292, 294, 295	syl2an 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 ∈ ((1 + 1)...𝑁) ↔ (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1))))
297	289, 296	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (((1 + 1) − 1)...(𝑁 − 1)))
298		ax-1cn 11109	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℂ
299	298, 298	pncan3oi 11417	. . . . . . . . . . . . . . . 16 ⊢ ((1 + 1) − 1) = 1
300	299	oveq1i 7367	. . . . . . . . . . . . . . 15 ⊢ (((1 + 1) − 1)...(𝑁 − 1)) = (1...(𝑁 − 1))
301	297, 300	eleqtrdi 2848	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → (𝑦 − 1) ∈ (1...(𝑁 − 1)))
302	293	zcnd 12608	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → 𝑦 ∈ ℂ)
303		elfznn 13470	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℕ)
304	303	nncnd 12169	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ∈ ℂ)
305		subadd2 11405	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
306	298, 305	mp3an2 1449	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑦 − 1) = 𝑛 ↔ (𝑛 + 1) = 𝑦))
307	306	bicomd 222	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → ((𝑛 + 1) = 𝑦 ↔ (𝑦 − 1) = 𝑛))
308		eqcom 2743	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = (𝑛 + 1) ↔ (𝑛 + 1) = 𝑦)
309		eqcom 2743	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (𝑦 − 1) ↔ (𝑦 − 1) = 𝑛)
310	307, 308, 309	3bitr4g 313	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ ℂ ∧ 𝑛 ∈ ℂ) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
311	302, 304, 310	syl2an 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ((1 + 1)...𝑁) ∧ 𝑛 ∈ (1...(𝑁 − 1))) → (𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
312	311	ralrimiva 3143	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ((1 + 1)...𝑁) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
313	312	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1)))
314		reu6i 3686	. . . . . . . . . . . . . 14 ⊢ (((𝑦 − 1) ∈ (1...(𝑁 − 1)) ∧ ∀𝑛 ∈ (1...(𝑁 − 1))(𝑦 = (𝑛 + 1) ↔ 𝑛 = (𝑦 − 1))) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
315	301, 313, 314	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ((1 + 1)...𝑁)) → ∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
316	315	ralrimiva 3143	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑦 ∈ ((1 + 1)...𝑁)∃!𝑛 ∈ (1...(𝑁 − 1))𝑦 = (𝑛 + 1))
317		eqid 2736	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1))
318	317	f1ompt 7059	. . . . . . . . . . . 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 583	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)):(1...(𝑁 − 1))–1-1-onto→((1 + 1)...𝑁))
320		f1osng 6825	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ ∧ 1 ∈ V) → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
321	1, 130, 320	sylancl 586	. . . . . . . . . . 11 ⊢ (𝜑 → {⟨𝑁, 1⟩}:{𝑁}–1-1-onto→{1})
322	14, 16	ltnled 11302	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑁 − 1) < 𝑁 ↔ ¬ 𝑁 ≤ (𝑁 − 1)))
323	20, 322	mpbid 231	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ 𝑁 ≤ (𝑁 − 1))
324		elfzle2 13445	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ (1...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
325	323, 324	nsyl 140	. . . . . . . . . . . 12 ⊢ (𝜑 → ¬ 𝑁 ∈ (1...(𝑁 − 1)))
326		disjsn 4672	. . . . . . . . . . . 12 ⊢ (((1...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1)))
327	325, 326	sylibr 233	. . . . . . . . . . 11 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∩ {𝑁}) = ∅)
328		1re 11155	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
329	328	ltp1i 12059	. . . . . . . . . . . . . . 15 ⊢ 1 < (1 + 1)
330	291	zrei 12505	. . . . . . . . . . . . . . . 16 ⊢ (1 + 1) ∈ ℝ
331	328, 330	ltnlei 11276	. . . . . . . . . . . . . . 15 ⊢ (1 < (1 + 1) ↔ ¬ (1 + 1) ≤ 1)
332	329, 331	mpbi 229	. . . . . . . . . . . . . 14 ⊢ ¬ (1 + 1) ≤ 1
333		elfzle1 13444	. . . . . . . . . . . . . 14 ⊢ (1 ∈ ((1 + 1)...𝑁) → (1 + 1) ≤ 1)
334	332, 333	mto 196	. . . . . . . . . . . . 13 ⊢ ¬ 1 ∈ ((1 + 1)...𝑁)
335		disjsn 4672	. . . . . . . . . . . . 13 ⊢ ((((1 + 1)...𝑁) ∩ {1}) = ∅ ↔ ¬ 1 ∈ ((1 + 1)...𝑁))
336	334, 335	mpbir 230	. . . . . . . . . . . 12 ⊢ (((1 + 1)...𝑁) ∩ {1}) = ∅
337	336	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (((1 + 1)...𝑁) ∩ {1}) = ∅)
338		f1oun 6803	. . . . . . . . . . 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 837	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}):((1...(𝑁 − 1)) ∪ {𝑁})–1-1-onto→(((1 + 1)...𝑁) ∪ {1}))
340	130	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ V)
341	158, 97	eqeltrd 2838	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘1))
342		uzid 12778	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 − 1) ∈ ℤ → (𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)))
343		peano2uz 12826	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
344	13, 342, 343	3syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
345	158, 344	eqeltrrd 2839	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘(𝑁 − 1)))
346		fzsplit2 13466	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑁 − 1))) → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
347	341, 345, 346	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
348	158	oveq1d 7372	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = (𝑁...𝑁))
349		fzsn 13483	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℤ → (𝑁...𝑁) = {𝑁})
350	11, 349	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁...𝑁) = {𝑁})
351	348, 350	eqtrd 2776	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = {𝑁})
352	351	uneq2d 4123	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = ((1...(𝑁 − 1)) ∪ {𝑁}))
353	347, 352	eqtr2d 2777	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ {𝑁}) = (1...𝑁))
354		iftrue 4492	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
355	354	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 = 𝑁) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = 1)
356	1, 340, 353, 355	fmptapd 7117	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))
357		eleq1 2825	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ (1...(𝑁 − 1)) ↔ 𝑁 ∈ (1...(𝑁 − 1))))
358	357	notbid 317	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑁 → (¬ 𝑛 ∈ (1...(𝑁 − 1)) ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1))))
359	325, 358	syl5ibrcom 246	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑛 = 𝑁 → ¬ 𝑛 ∈ (1...(𝑁 − 1))))
360	359	necon2ad 2958	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) → 𝑛 ≠ 𝑁))
361	360	imp 407	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → 𝑛 ≠ 𝑁)
362		ifnefalse 4498	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ≠ 𝑁 → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
363	361, 362	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(𝑁 − 1))) → if(𝑛 = 𝑁, 1, (𝑛 + 1)) = (𝑛 + 1))
364	363	mpteq2dva 5205	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = (𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)))
365	364	uneq1d 4122	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ (1...(𝑁 − 1)) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) ∪ {⟨𝑁, 1⟩}) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
366	356, 365	eqtr3d 2778	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))) = ((𝑛 ∈ (1...(𝑁 − 1)) ↦ (𝑛 + 1)) ∪ {⟨𝑁, 1⟩}))
367	347, 352	eqtrd 2776	. . . . . . . . . . 11 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ {𝑁}))
368		uzid 12778	. . . . . . . . . . . . . 14 ⊢ (1 ∈ ℤ → 1 ∈ (ℤ_≥‘1))
369		peano2uz 12826	. . . . . . . . . . . . . 14 ⊢ (1 ∈ (ℤ_≥‘1) → (1 + 1) ∈ (ℤ_≥‘1))
370	278, 368, 369	mp2b 10	. . . . . . . . . . . . 13 ⊢ (1 + 1) ∈ (ℤ_≥‘1)
371		fzsplit2 13466	. . . . . . . . . . . . 13 ⊢ (((1 + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘1)) → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
372	370, 97, 371	sylancr 587	. . . . . . . . . . . 12 ⊢ (𝜑 → (1...𝑁) = ((1...1) ∪ ((1 + 1)...𝑁)))
373		fzsn 13483	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ ℤ → (1...1) = {1})
374	278, 373	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ (1...1) = {1}
375	374	uneq1i 4119	. . . . . . . . . . . . 13 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = ({1} ∪ ((1 + 1)...𝑁))
376	375	equncomi 4115	. . . . . . . . . . . 12 ⊢ ((1...1) ∪ ((1 + 1)...𝑁)) = (((1 + 1)...𝑁) ∪ {1})
377	372, 376	eqtrdi 2792	. . . . . . . . . . 11 ⊢ (𝜑 → (1...𝑁) = (((1 + 1)...𝑁) ∪ {1}))
378	366, 367, 377	f1oeq123d 6778	. . . . . . . . . 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 256	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))):(1...𝑁)–1-1-onto→(1...𝑁))
380		f1oco 6807	. . . . . . . . 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 584	. . . . . . . 8 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))):(1...𝑁)–1-1-onto→(1...𝑁))
382		f1oeq1 6772	. . . . . . . . 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 3630	. . . . . . . 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 233	. . . . . . 7 ⊢ (𝜑 → ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1)))) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
385	276, 384	opelxpd 5671	. . . . . 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 12473	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
387		nn0fz0 13539	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ ↔ 𝑁 ∈ (0...𝑁))
388	386, 387	sylib 217	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...𝑁))
389	385, 388	opelxpd 5671	. . . . 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 3644	. . . . 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 584	. . . 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 256	. . 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 2849	. 2 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ∈ 𝑆)
394		fveqeq2 6851	. . . . . 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 244	. . . . 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 12203	. . . . . 6 ⊢ (𝜑 → 𝑁 ≠ 0)
397		neeq1 3006	. . . . . 6 ⊢ ((2^nd ‘𝑇) = 𝑁 → ((2^nd ‘𝑇) ≠ 0 ↔ 𝑁 ≠ 0))
398	396, 397	syl5ibrcom 246	. . . . 5 ⊢ (𝜑 → ((2^nd ‘𝑇) = 𝑁 → (2^nd ‘𝑇) ≠ 0))
399	395, 398	syld 47	. . . 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 2966	. . 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 15	. 2 ⊢ (𝜑 → ⟨⟨(𝑛 ∈ (1...𝑁) ↦ (((1^st ‘(1^st ‘𝑇))‘𝑛) + if(𝑛 = ((2^nd ‘(1^st ‘𝑇))‘1), 1, 0))), ((2^nd ‘(1^st ‘𝑇)) ∘ (𝑛 ∈ (1...𝑁) ↦ if(𝑛 = 𝑁, 1, (𝑛 + 1))))⟩, 𝑁⟩ ≠ 𝑇)
402		neeq1 3006	. . 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 3581	. 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 584	1 ⊢ (𝜑 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 ∀wal 1539 = wceq 1541 ∈ wcel 2106 {cab 2713 ≠ wne 2943 ∀wral 3064 ∃wrex 3073 ∃!wreu 3351 {crab 3407 Vcvv 3445 ⦋csb 3855 ∪ 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 “ 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: poimirlem18 36096

W3C validator