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 32592

Description: Lemma for poimir 32612- 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..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_𝑓 + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem22.1	⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_𝑚 (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 758	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑁 ∈ ℕ)
3		poimirlem22.s	. . . . . . . 8 ⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_𝑓 + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
4		poimirlem22.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_𝑚 (1...𝑁)))
5	4	ad2antrr 758	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_𝑚 (1...𝑁)))
6		simplrl 796	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 ∈ 𝑆)
7		simprl 790	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑧) = 0)
8	2, 3, 5, 6, 7	poimirlem10 32589	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_𝑓 − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑧)))
9		simplrr 797	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑘 ∈ 𝑆)
10		simprr 792	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑘) = 0)
11	2, 3, 5, 9, 10	poimirlem10 32589	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_𝑓 − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑘)))
12	8, 11	eqtr3d 2646	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)))
13		elrabi 3328	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ {𝑡 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_𝑓 + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑧 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
14	13, 3	eleq2s 2706	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
15		xp1st 7089	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
16	14, 15	syl 17	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
17		xp2nd 7090	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_𝑚 (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 6113	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑧)) ∈ V
20		f1oeq1 6040	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
21	19, 20	elab 3319	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
22	18, 21	sylib 207	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
23		f1ofn 6051	. . . . . . . . . 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 759	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
27		elrabi 3328	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ {𝑡 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_𝑓 + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑘 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
28	27, 3	eleq2s 2706	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ 𝑆 → 𝑘 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
29		xp1st 7089	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
30	28, 29	syl 17	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝑆 → (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
31		xp2nd 7090	. . . . . . . . . . . 12 ⊢ ((1^st ‘𝑘) ∈ (((0..^𝐾) ↑_𝑚 (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 6113	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑘)) ∈ V
34		f1oeq1 6040	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑘)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁)))
35	33, 34	elab 3319	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
36	32, 35	sylib 207	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
37		f1ofn 6051	. . . . . . . . . 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 759	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
41		eleq1 2676	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ (1...𝑁) ↔ 𝑛 ∈ (1...𝑁)))
42	41	anbi2d 736	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁))))
43		oveq2 6557	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
44	43	imaeq2d 5385	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)))
45	43	imaeq2d 5385	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
46	44, 45	eqeq12d 2625	. . . . . . . . . . . 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 333	. . . . . . . . . . 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 762	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑁 ∈ ℕ)
49	4	ad3antrrr 762	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_𝑚 (1...𝑁)))
50		simpl 472	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑧 ∈ 𝑆)
51	50	ad3antlr 763	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑧 ∈ 𝑆)
52		simplrl 796	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2^nd ‘𝑧) = 0)
53		simpr 476	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑘 ∈ 𝑆)
54	53	ad3antlr 763	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑘 ∈ 𝑆)
55		simplrr 797	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2^nd ‘𝑘) = 0)
56		simpr 476	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ∈ (1...𝑁))
57	48, 3, 49, 51, 52, 54, 55, 56	poimirlem11 32590	. . . . . . . . . . . 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 32590	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) ⊆ ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)))
59	57, 58	eqssd 3585	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)))
60	47, 59	chvarv 2251	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
61		simpll 786	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝜑)
62		elfznn 12241	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℕ)
63		nnm1nn0 11211	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
64	62, 63	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℕ₀)
65	64	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ₀)
66	62	nncnd 10913	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℂ)
67		ax-1cn 9873	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
68		subeq0 10186	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
69	66, 67, 68	sylancl 693	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
70	69	necon3abid 2818	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) ≠ 0 ↔ ¬ 𝑛 = 1))
71	70	biimpar 501	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ≠ 0)
72		elnnne0 11183	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 − 1) ∈ ℕ ↔ ((𝑛 − 1) ∈ ℕ₀ ∧ (𝑛 − 1) ≠ 0))
73	65, 71, 72	sylanbrc 695	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ)
74	73	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ ℕ)
75	64	nn0red 11229	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℝ)
76	75	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ∈ ℝ)
77	62	nnred 10912	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℝ)
78	77	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℝ)
79	1	nnred 10912	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℝ)
80	79	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑁 ∈ ℝ)
81	77	lem1d 10836	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ≤ 𝑛)
82	81	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑛)
83		elfzle2 12216	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ≤ 𝑁)
84	83	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ≤ 𝑁)
85	76, 78, 80, 82, 84	letrd 10073	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑁)
86	85	adantrr 749	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ≤ 𝑁)
87	1	nnzd 11357	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℤ)
88		fznn 12278	. . . . . . . . . . . . . . . . 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 959	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
92	61, 91	sylan 487	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
93		ovex 6577	. . . . . . . . . . . . . 14 ⊢ (𝑛 − 1) ∈ V
94		eleq1 2676	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → (𝑚 ∈ (1...𝑁) ↔ (𝑛 − 1) ∈ (1...𝑁)))
95	94	anbi2d 736	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁))))
96		oveq2 6557	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = (𝑛 − 1) → (1...𝑚) = (1...(𝑛 − 1)))
97	96	imaeq2d 5385	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))))
98	96	imaeq2d 5385	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
99	97, 98	eqeq12d 2625	. . . . . . . . . . . . . . 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 333	. . . . . . . . . . . . . 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 3232	. . . . . . . . . . . . 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 486	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
103	102	expr 641	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → (¬ 𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
104		ima0 5400	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ∅
105		ima0 5400	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑘)) “ ∅) = ∅
106	104, 105	eqtr4i 2635	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ((2^nd ‘(1^st ‘𝑘)) “ ∅)
107		oveq1 6556	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 1 → (𝑛 − 1) = (1 − 1))
108		1m1e0 10966	. . . . . . . . . . . . . . . 16 ⊢ (1 − 1) = 0
109	107, 108	syl6eq 2660	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 1 → (𝑛 − 1) = 0)
110	109	oveq2d 6565	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = (1...0))
111		fz10 12233	. . . . . . . . . . . . . 14 ⊢ (1...0) = ∅
112	110, 111	syl6eq 2660	. . . . . . . . . . . . 13 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = ∅)
113	112	imaeq2d 5385	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑧)) “ ∅))
114	112	imaeq2d 5385	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ ∅))
115	106, 113, 114	3eqtr4a 2670	. . . . . . . . . . 11 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
116	103, 115	pm2.61d2 171	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
117	60, 116	difeq12d 3691	. . . . . . . . 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 6168	. . . . . . . . . . . 12 ⊢ (((2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
119	24, 118	sylan 487	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
120	62	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℕ)
121		uncom 3719	. . . . . . . . . . . . . . . 16 ⊢ ((1...(𝑛 − 1)) ∪ {𝑛}) = ({𝑛} ∪ (1...(𝑛 − 1)))
122	121	difeq1i 3686	. . . . . . . . . . . . . . 15 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1)))
123		difun2 4000	. . . . . . . . . . . . . . 15 ⊢ (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
124	122, 123	eqtri 2632	. . . . . . . . . . . . . 14 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
125		nncn 10905	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
126		npcan1 10334	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℂ → ((𝑛 − 1) + 1) = 𝑛)
127	125, 126	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) = 𝑛)
128		elnnuz 11600	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ_≥‘1))
129	128	biimpi 205	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘1))
130	127, 129	eqeltrd 2688	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘1))
131	63	nn0zd 11356	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℤ)
132		uzid 11578	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 − 1) ∈ ℤ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
133	131, 132	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
134		peano2uz 11617	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)) → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
135	133, 134	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
136	127, 135	eqeltrrd 2689	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘(𝑛 − 1)))
137		fzsplit2 12237	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑛 ∈ (ℤ_≥‘(𝑛 − 1))) → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
138	130, 136, 137	syl2anc 691	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
139	127	oveq1d 6564	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = (𝑛...𝑛))
140		nnz 11276	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
141		fzsn 12254	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℤ → (𝑛...𝑛) = {𝑛})
142	140, 141	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (𝑛...𝑛) = {𝑛})
143	139, 142	eqtrd 2644	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = {𝑛})
144	143	uneq2d 3729	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)) = ((1...(𝑛 − 1)) ∪ {𝑛}))
145	138, 144	eqtrd 2644	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ {𝑛}))
146	145	difeq1d 3689	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))))
147		nnre 10904	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
148		ltm1 10742	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) < 𝑛)
149		peano2rem 10227	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) ∈ ℝ)
150		ltnle 9996	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 − 1) ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
151	149, 150	mpancom 700	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
152	148, 151	mpbid 221	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ≤ (𝑛 − 1))
153		elfzle2 12216	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑛 − 1)) → 𝑛 ≤ (𝑛 − 1))
154	152, 153	nsyl 134	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
155	147, 154	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
156		incom 3767	. . . . . . . . . . . . . . . . 17 ⊢ ((1...(𝑛 − 1)) ∩ {𝑛}) = ({𝑛} ∩ (1...(𝑛 − 1)))
157	156	eqeq1i 2615	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ({𝑛} ∩ (1...(𝑛 − 1))) = ∅)
158		disjsn 4192	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ¬ 𝑛 ∈ (1...(𝑛 − 1)))
159		disj3 3973	. . . . . . . . . . . . . . . 16 ⊢ (({𝑛} ∩ (1...(𝑛 − 1))) = ∅ ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
160	157, 158, 159	3bitr3i 289	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑛 ∈ (1...(𝑛 − 1)) ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
161	155, 160	sylib 207	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
162	124, 146, 161	3eqtr4a 2670	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
163	120, 162	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
164	163	imaeq2d 5385	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
165		dff1o3 6056	. . . . . . . . . . . . . . 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 479	. . . . . . . . . . . . . 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 5887	. . . . . . . . . . . . 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 2650	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
172	6, 171	sylan 487	. . . . . . . . 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 2676	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (𝑧 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
174	173	anbi1d 737	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁))))
175		fveq2 6103	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = 𝑘 → (1^st ‘𝑧) = (1^st ‘𝑘))
176	175	fveq2d 6107	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑘 → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
177	176	fveq1d 6105	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
178	177	sneqd 4137	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
179	176	imaeq1d 5384	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
180	176	imaeq1d 5384	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
181	179, 180	difeq12d 3691	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))) = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
182	178, 181	eqeq12d 2625	. . . . . . . . . . . 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))))))
183	174, 182	imbi12d 333	. . . . . . . . . . 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)))))))
184	183, 171	chvarv 2251	. . . . . . . . . 10 ⊢ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
185	9, 184	sylan 487	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
186	117, 172, 185	3eqtr4d 2654	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
187		fvex 6113	. . . . . . . . 9 ⊢ ((2^nd ‘(1^st ‘𝑧))‘𝑛) ∈ V
188	187	sneqr 4311	. . . . . . . 8 ⊢ ({((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)} → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
189	186, 188	syl 17	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
190	26, 40, 189	eqfnfvd 6222	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
191		xpopth 7098	. . . . . . . 8 ⊢ (((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ∧ (1^st ‘𝑘) ∈ (((0..^𝐾) ↑_𝑚 (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 ‘𝑘)))
192	16, 30, 191	syl2an 493	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)) ∧ (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘))) ↔ (1^st ‘𝑧) = (1^st ‘𝑘)))
193	192	ad2antlr 759	. . . . . 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 ‘𝑘)))
194	12, 190, 193	mpbi2and 958	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘𝑧) = (1^st ‘𝑘))
195		eqtr3 2631	. . . . . 6 ⊢ (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → (2^nd ‘𝑧) = (2^nd ‘𝑘))
196	195	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑧) = (2^nd ‘𝑘))
197		xpopth 7098	. . . . . . 7 ⊢ ((𝑧 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∧ 𝑘 ∈ ((((0..^𝐾) ↑_𝑚 (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁))) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
198	14, 28, 197	syl2an 493	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
199	198	ad2antlr 759	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
200	194, 196, 199	mpbi2and 958	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 = 𝑘)
201	200	ex 449	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
202	201	ralrimivva 2954	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
203		fveq2 6103	. . . 4 ⊢ (𝑧 = 𝑘 → (2^nd ‘𝑧) = (2^nd ‘𝑘))
204	203	eqeq1d 2612	. . 3 ⊢ (𝑧 = 𝑘 → ((2^nd ‘𝑧) = 0 ↔ (2^nd ‘𝑘) = 0))
205	204	rmo4 3366	. 2 ⊢ (∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0 ↔ ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
206	202, 205	sylibr 223	1 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {cab 2596 ≠ wne 2780 ∀wral 2896 ∃*wrmo 2899 {crab 2900 ⦋csb 3499 ∖ cdif 3537 ∪ cun 3538 ∩ cin 3539 ∅c0 3874 ifcif 4036 {csn 4125 class class class wbr 4583 ↦ cmpt 4643 × cxp 5036 ^◡ccnv 5037 “ cima 5041 Fun wfun 5798 Fn wfn 5799 ⟶wf 5800 –onto→wfo 5802 –1-1-onto→wf1o 5803 ‘cfv 5804 (class class class)co 6549 ∘_𝑓 cof 6793 1^st c1st 7057 2^nd c2nd 7058 ↑_𝑚 cmap 7744 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 < clt 9953 ≤ cle 9954 − cmin 10145 ℕcn 10897 ℕ₀cn0 11169 ℤcz 11254 ℤ_≥cuz 11563 ...cfz 12197 ..^cfzo 12334

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335

This theorem is referenced by: poimirlem18 32597 poimirlem21 32600

W3C validator