poimirlem13 - Mathbox for Brendan Leahy

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

Theorem poimirlem13 37627

Description: Lemma for poimir 37647- for at most one simplex associated with a shared face is the opposite vertex first on the walk. (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...𝑁)))

**Assertion**
Ref	Expression
poimirlem13	⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0)

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

Proof of Theorem poimirlem13 Dummy variables 𝑘 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		poimir.0	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ)
2	1	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑁 ∈ ℕ)
3		poimirlem22.s	. . . . . . . 8 ⊢ 𝑆 = {𝑡 ∈ ((((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}))))}
4		poimirlem22.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
5	4	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
6		simplrl 776	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 ∈ 𝑆)
7		simprl 770	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑧) = 0)
8	2, 3, 5, 6, 7	poimirlem10 37624	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_f − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑧)))
9		simplrr 777	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑘 ∈ 𝑆)
10		simprr 772	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑘) = 0)
11	2, 3, 5, 9, 10	poimirlem10 37624	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_f − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑘)))
12	8, 11	eqtr3d 2766	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)))
13		elrabi 3654	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ {𝑡 ∈ ((((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...𝑁)))
14	13, 3	eleq2s 2846	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
15		xp1st 8000	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
16	14, 15	syl 17	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
17		xp2nd 8001	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
18	16, 17	syl 17	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
19		fvex 6871	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑧)) ∈ V
20		f1oeq1 6788	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
21	19, 20	elab 3646	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
22	18, 21	sylib 218	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
23		f1ofn 6801	. . . . . . . . . 10 ⊢ ((2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
24	22, 23	syl 17	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
25	24	adantr 480	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
26	25	ad2antlr 727	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
27		elrabi 3654	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ {𝑡 ∈ ((((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...𝑁)))
28	27, 3	eleq2s 2846	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ 𝑆 → 𝑘 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
29		xp1st 8000	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
30	28, 29	syl 17	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝑆 → (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
31		xp2nd 8001	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝑘) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
32	30, 31	syl 17	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
33		fvex 6871	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑘)) ∈ V
34		f1oeq1 6788	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑘)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁)))
35	33, 34	elab 3646	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
36	32, 35	sylib 218	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
37		f1ofn 6801	. . . . . . . . . 10 ⊢ ((2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁) → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
38	36, 37	syl 17	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
39	38	adantl 481	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
40	39	ad2antlr 727	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
41		eleq1 2816	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ (1...𝑁) ↔ 𝑛 ∈ (1...𝑁)))
42	41	anbi2d 630	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁))))
43		oveq2 7395	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
44	43	imaeq2d 6031	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)))
45	43	imaeq2d 6031	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
46	44, 45	eqeq12d 2745	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) ↔ ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛))))
47	42, 46	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚))) ↔ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))))
48	1	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑁 ∈ ℕ)
49	4	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
50		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑧 ∈ 𝑆)
51	50	ad3antlr 731	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑧 ∈ 𝑆)
52		simplrl 776	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2^nd ‘𝑧) = 0)
53		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑘 ∈ 𝑆)
54	53	ad3antlr 731	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑘 ∈ 𝑆)
55		simplrr 777	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2^nd ‘𝑘) = 0)
56		simpr 484	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ∈ (1...𝑁))
57	48, 3, 49, 51, 52, 54, 55, 56	poimirlem11 37625	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) ⊆ ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)))
58	48, 3, 49, 54, 55, 51, 52, 56	poimirlem11 37625	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) ⊆ ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)))
59	57, 58	eqssd 3964	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)))
60	47, 59	chvarvv 1989	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
61		simpll 766	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝜑)
62		elfznn 13514	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℕ)
63		nnm1nn0 12483	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
64	62, 63	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℕ₀)
65	64	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ₀)
66	62	nncnd 12202	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℂ)
67		ax-1cn 11126	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
68		subeq0 11448	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
69	66, 67, 68	sylancl 586	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
70	69	necon3abid 2961	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) ≠ 0 ↔ ¬ 𝑛 = 1))
71	70	biimpar 477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ≠ 0)
72		elnnne0 12456	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 − 1) ∈ ℕ ↔ ((𝑛 − 1) ∈ ℕ₀ ∧ (𝑛 − 1) ≠ 0))
73	65, 71, 72	sylanbrc 583	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ)
74	73	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ ℕ)
75	64	nn0red 12504	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℝ)
76	75	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ∈ ℝ)
77	62	nnred 12201	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℝ)
78	77	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℝ)
79	1	nnred 12201	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℝ)
80	79	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑁 ∈ ℝ)
81	77	lem1d 12116	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ≤ 𝑛)
82	81	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑛)
83		elfzle2 13489	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ≤ 𝑁)
84	83	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ≤ 𝑁)
85	76, 78, 80, 82, 84	letrd 11331	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑁)
86	85	adantrr 717	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ≤ 𝑁)
87	1	nnzd 12556	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℤ)
88		fznn 13553	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℤ → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
89	87, 88	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
90	89	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
91	74, 86, 90	mpbir2and 713	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
92	61, 91	sylan 580	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
93		ovex 7420	. . . . . . . . . . . . . 14 ⊢ (𝑛 − 1) ∈ V
94		eleq1 2816	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → (𝑚 ∈ (1...𝑁) ↔ (𝑛 − 1) ∈ (1...𝑁)))
95	94	anbi2d 630	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁))))
96		oveq2 7395	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = (𝑛 − 1) → (1...𝑚) = (1...(𝑛 − 1)))
97	96	imaeq2d 6031	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))))
98	96	imaeq2d 6031	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
99	97, 98	eqeq12d 2745	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) ↔ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
100	95, 99	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑚 = (𝑛 − 1) → (((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚))) ↔ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))))
101	93, 100, 59	vtocl 3524	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
102	92, 101	syldan 591	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
103	102	expr 456	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → (¬ 𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
104		ima0 6048	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ∅
105		ima0 6048	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑘)) “ ∅) = ∅
106	104, 105	eqtr4i 2755	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ((2^nd ‘(1^st ‘𝑘)) “ ∅)
107		oveq1 7394	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 1 → (𝑛 − 1) = (1 − 1))
108		1m1e0 12258	. . . . . . . . . . . . . . . 16 ⊢ (1 − 1) = 0
109	107, 108	eqtrdi 2780	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 1 → (𝑛 − 1) = 0)
110	109	oveq2d 7403	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = (1...0))
111		fz10 13506	. . . . . . . . . . . . . 14 ⊢ (1...0) = ∅
112	110, 111	eqtrdi 2780	. . . . . . . . . . . . 13 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = ∅)
113	112	imaeq2d 6031	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑧)) “ ∅))
114	112	imaeq2d 6031	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ ∅))
115	106, 113, 114	3eqtr4a 2790	. . . . . . . . . . 11 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
116	103, 115	pm2.61d2 181	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
117	60, 116	difeq12d 4090	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
118		fnsnfv 6940	. . . . . . . . . . . 12 ⊢ (((2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
119	24, 118	sylan 580	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
120	62	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℕ)
121		uncom 4121	. . . . . . . . . . . . . . . 16 ⊢ ((1...(𝑛 − 1)) ∪ {𝑛}) = ({𝑛} ∪ (1...(𝑛 − 1)))
122	121	difeq1i 4085	. . . . . . . . . . . . . . 15 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1)))
123		difun2 4444	. . . . . . . . . . . . . . 15 ⊢ (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
124	122, 123	eqtri 2752	. . . . . . . . . . . . . 14 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
125		nncn 12194	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
126		npcan1 11603	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℂ → ((𝑛 − 1) + 1) = 𝑛)
127	125, 126	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) = 𝑛)
128		elnnuz 12837	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ_≥‘1))
129	128	biimpi 216	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘1))
130	127, 129	eqeltrd 2828	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘1))
131	63	nn0zd 12555	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℤ)
132		uzid 12808	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 − 1) ∈ ℤ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
133	131, 132	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
134		peano2uz 12860	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)) → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
135	133, 134	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
136	127, 135	eqeltrrd 2829	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘(𝑛 − 1)))
137		fzsplit2 13510	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑛 ∈ (ℤ_≥‘(𝑛 − 1))) → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
138	130, 136, 137	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
139	127	oveq1d 7402	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = (𝑛...𝑛))
140		nnz 12550	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
141		fzsn 13527	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℤ → (𝑛...𝑛) = {𝑛})
142	140, 141	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (𝑛...𝑛) = {𝑛})
143	139, 142	eqtrd 2764	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = {𝑛})
144	143	uneq2d 4131	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)) = ((1...(𝑛 − 1)) ∪ {𝑛}))
145	138, 144	eqtrd 2764	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ {𝑛}))
146	145	difeq1d 4088	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))))
147		nnre 12193	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
148		ltm1 12024	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) < 𝑛)
149		peano2rem 11489	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) ∈ ℝ)
150		ltnle 11253	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 − 1) ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
151	149, 150	mpancom 688	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
152	148, 151	mpbid 232	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ≤ (𝑛 − 1))
153		elfzle2 13489	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑛 − 1)) → 𝑛 ≤ (𝑛 − 1))
154	152, 153	nsyl 140	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
155	147, 154	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
156		incom 4172	. . . . . . . . . . . . . . . . 17 ⊢ ((1...(𝑛 − 1)) ∩ {𝑛}) = ({𝑛} ∩ (1...(𝑛 − 1)))
157	156	eqeq1i 2734	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ({𝑛} ∩ (1...(𝑛 − 1))) = ∅)
158		disjsn 4675	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ¬ 𝑛 ∈ (1...(𝑛 − 1)))
159		disj3 4417	. . . . . . . . . . . . . . . 16 ⊢ (({𝑛} ∩ (1...(𝑛 − 1))) = ∅ ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
160	157, 158, 159	3bitr3i 301	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑛 ∈ (1...(𝑛 − 1)) ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
161	155, 160	sylib 218	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
162	124, 146, 161	3eqtr4a 2790	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
163	120, 162	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
164	163	imaeq2d 6031	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
165		dff1o3 6806	. . . . . . . . . . . . . . 15 ⊢ ((2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((2^nd ‘(1^st ‘𝑧)):(1...𝑁)–onto→(1...𝑁) ∧ Fun ^◡(2^nd ‘(1^st ‘𝑧))))
166	165	simprbi 496	. . . . . . . . . . . . . 14 ⊢ ((2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ^◡(2^nd ‘(1^st ‘𝑧)))
167	22, 166	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → Fun ^◡(2^nd ‘(1^st ‘𝑧)))
168		imadif 6600	. . . . . . . . . . . . 13 ⊢ (Fun ^◡(2^nd ‘(1^st ‘𝑧)) → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
169	167, 168	syl 17	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
170	169	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
171	119, 164, 170	3eqtr2d 2770	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
172	6, 171	sylan 580	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
173		eleq1 2816	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (𝑧 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
174	173	anbi1d 631	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁))))
175		2fveq3 6863	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑘 → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
176	175	fveq1d 6860	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
177	176	sneqd 4601	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
178	175	imaeq1d 6030	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
179	175	imaeq1d 6030	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
180	178, 179	difeq12d 4090	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
181	177, 180	eqeq12d 2745	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ({((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))) ↔ {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))))
182	174, 181	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑘 → (((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))))) ↔ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))))
183	182, 171	chvarvv 1989	. . . . . . . . . 10 ⊢ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
184	9, 183	sylan 580	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
185	117, 172, 184	3eqtr4d 2774	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
186		fvex 6871	. . . . . . . . 9 ⊢ ((2^nd ‘(1^st ‘𝑧))‘𝑛) ∈ V
187	186	sneqr 4804	. . . . . . . 8 ⊢ ({((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)} → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
188	185, 187	syl 17	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
189	26, 40, 188	eqfnfvd 7006	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
190		xpopth 8009	. . . . . . . 8 ⊢ (((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ∧ (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})) → (((1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)) ∧ (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘))) ↔ (1^st ‘𝑧) = (1^st ‘𝑘)))
191	16, 30, 190	syl2an 596	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)) ∧ (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘))) ↔ (1^st ‘𝑧) = (1^st ‘𝑘)))
192	191	ad2antlr 727	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (((1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)) ∧ (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘))) ↔ (1^st ‘𝑧) = (1^st ‘𝑘)))
193	12, 189, 192	mpbi2and 712	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘𝑧) = (1^st ‘𝑘))
194		eqtr3 2751	. . . . . 6 ⊢ (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → (2^nd ‘𝑧) = (2^nd ‘𝑘))
195	194	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑧) = (2^nd ‘𝑘))
196		xpopth 8009	. . . . . . 7 ⊢ ((𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∧ 𝑘 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁))) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
197	14, 28, 196	syl2an 596	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
198	197	ad2antlr 727	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
199	193, 195, 198	mpbi2and 712	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 = 𝑘)
200	199	ex 412	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
201	200	ralrimivva 3180	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
202		fveqeq2 6867	. . 3 ⊢ (𝑧 = 𝑘 → ((2^nd ‘𝑧) = 0 ↔ (2^nd ‘𝑘) = 0))
203	202	rmo4 3701	. 2 ⊢ (∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0 ↔ ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
204	201, 203	sylibr 234	1 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {cab 2707 ≠ wne 2925 ∀wral 3044 ∃*wrmo 3353 {crab 3405 ⦋csb 3862 ∖ cdif 3911 ∪ cun 3912 ∩ cin 3913 ∅c0 4296 ifcif 4488 {csn 4589 class class class wbr 5107 ↦ cmpt 5188 × cxp 5636 ^◡ccnv 5637 “ cima 5641 Fun wfun 6505 Fn wfn 6506 ⟶wf 6507 –onto→wfo 6509 –1-1-onto→wf1o 6510 ‘cfv 6511 (class class class)co 7387 ∘_f cof 7651 1^st c1st 7966 2^nd c2nd 7967 ↑_m cmap 8799 ℂcc 11066 ℝcr 11067 0cc0 11068 1c1 11069 + caddc 11071 < clt 11208 ≤ cle 11209 − cmin 11405 ℕcn 12186 ℕ₀cn0 12442 ℤcz 12529 ℤ_≥cuz 12793 ...cfz 13468 ..^cfzo 13615

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616

This theorem is referenced by: poimirlem18 37632 poimirlem21 37635

W3C validator