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 35717

Description: Lemma for poimir 35737- 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 722	. . . . . . . 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 722	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
6		simplrl 773	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 ∈ 𝑆)
7		simprl 767	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑧) = 0)
8	2, 3, 5, 6, 7	poimirlem10 35714	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_f − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑧)))
9		simplrr 774	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑘 ∈ 𝑆)
10		simprr 769	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘𝑘) = 0)
11	2, 3, 5, 9, 10	poimirlem10 35714	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘_f − ((1...𝑁) × {1})) = (1^st ‘(1^st ‘𝑘)))
12	8, 11	eqtr3d 2780	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)))
13		elrabi 3611	. . . . . . . . . . . . . 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 2857	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
15		xp1st 7836	. . . . . . . . . . . . 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 7837	. . . . . . . . . . . 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 6769	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑧)) ∈ V
20		f1oeq1 6688	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
21	19, 20	elab 3602	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
22	18, 21	sylib 217	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
23		f1ofn 6701	. . . . . . . . . 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 723	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁))
27		elrabi 3611	. . . . . . . . . . . . . 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 2857	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ 𝑆 → 𝑘 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
29		xp1st 7836	. . . . . . . . . . . . 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 7837	. . . . . . . . . . . 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 6769	. . . . . . . . . . . 12 ⊢ (2^nd ‘(1^st ‘𝑘)) ∈ V
34		f1oeq1 6688	. . . . . . . . . . . 12 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑘)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁)))
35	33, 34	elab 3602	. . . . . . . . . . 11 ⊢ ((2^nd ‘(1^st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
36	32, 35	sylib 217	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
37		f1ofn 6701	. . . . . . . . . 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 723	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑘)) Fn (1...𝑁))
41		eleq1 2826	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ (1...𝑁) ↔ 𝑛 ∈ (1...𝑁)))
42	41	anbi2d 628	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁))))
43		oveq2 7263	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
44	43	imaeq2d 5958	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)))
45	43	imaeq2d 5958	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
46	44, 45	eqeq12d 2754	. . . . . . . . . . . 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 726	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑁 ∈ ℕ)
49	4	ad3antrrr 726	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
50		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑧 ∈ 𝑆)
51	50	ad3antlr 727	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑧 ∈ 𝑆)
52		simplrl 773	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2^nd ‘𝑧) = 0)
53		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑘 ∈ 𝑆)
54	53	ad3antlr 727	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑘 ∈ 𝑆)
55		simplrr 774	. . . . . . . . . . . . 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 35715	. . . . . . . . . . . 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 35715	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) ⊆ ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)))
59	57, 58	eqssd 3934	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)))
60	47, 59	chvarvv 2003	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
61		simpll 763	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝜑)
62		elfznn 13214	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℕ)
63		nnm1nn0 12204	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ₀)
64	62, 63	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℕ₀)
65	64	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ₀)
66	62	nncnd 11919	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℂ)
67		ax-1cn 10860	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
68		subeq0 11177	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
69	66, 67, 68	sylancl 585	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
70	69	necon3abid 2979	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) ≠ 0 ↔ ¬ 𝑛 = 1))
71	70	biimpar 477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ≠ 0)
72		elnnne0 12177	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 − 1) ∈ ℕ ↔ ((𝑛 − 1) ∈ ℕ₀ ∧ (𝑛 − 1) ≠ 0))
73	65, 71, 72	sylanbrc 582	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ)
74	73	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ ℕ)
75	64	nn0red 12224	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℝ)
76	75	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ∈ ℝ)
77	62	nnred 11918	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℝ)
78	77	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℝ)
79	1	nnred 11918	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℝ)
80	79	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑁 ∈ ℝ)
81	77	lem1d 11838	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ≤ 𝑛)
82	81	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑛)
83		elfzle2 13189	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ≤ 𝑁)
84	83	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ≤ 𝑁)
85	76, 78, 80, 82, 84	letrd 11062	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑁)
86	85	adantrr 713	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ≤ 𝑁)
87	1	nnzd 12354	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℤ)
88		fznn 13253	. . . . . . . . . . . . . . . . 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 709	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
92	61, 91	sylan 579	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
93		ovex 7288	. . . . . . . . . . . . . 14 ⊢ (𝑛 − 1) ∈ V
94		eleq1 2826	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → (𝑚 ∈ (1...𝑁) ↔ (𝑛 − 1) ∈ (1...𝑁)))
95	94	anbi2d 628	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁))))
96		oveq2 7263	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = (𝑛 − 1) → (1...𝑚) = (1...(𝑛 − 1)))
97	96	imaeq2d 5958	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))))
98	96	imaeq2d 5958	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑚)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
99	97, 98	eqeq12d 2754	. . . . . . . . . . . . . . 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 3488	. . . . . . . . . . . . 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 590	. . . . . . . . . . . 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 5974	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ∅
105		ima0 5974	. . . . . . . . . . . . 13 ⊢ ((2^nd ‘(1^st ‘𝑘)) “ ∅) = ∅
106	104, 105	eqtr4i 2769	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(1^st ‘𝑧)) “ ∅) = ((2^nd ‘(1^st ‘𝑘)) “ ∅)
107		oveq1 7262	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 1 → (𝑛 − 1) = (1 − 1))
108		1m1e0 11975	. . . . . . . . . . . . . . . 16 ⊢ (1 − 1) = 0
109	107, 108	eqtrdi 2795	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 1 → (𝑛 − 1) = 0)
110	109	oveq2d 7271	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = (1...0))
111		fz10 13206	. . . . . . . . . . . . . 14 ⊢ (1...0) = ∅
112	110, 111	eqtrdi 2795	. . . . . . . . . . . . 13 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = ∅)
113	112	imaeq2d 5958	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑧)) “ ∅))
114	112	imaeq2d 5958	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ ∅))
115	106, 113, 114	3eqtr4a 2805	. . . . . . . . . . 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 4054	. . . . . . . . 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 6829	. . . . . . . . . . . 12 ⊢ (((2^nd ‘(1^st ‘𝑧)) Fn (1...𝑁) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
119	24, 118	sylan 579	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
120	62	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℕ)
121		uncom 4083	. . . . . . . . . . . . . . . 16 ⊢ ((1...(𝑛 − 1)) ∪ {𝑛}) = ({𝑛} ∪ (1...(𝑛 − 1)))
122	121	difeq1i 4049	. . . . . . . . . . . . . . 15 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1)))
123		difun2 4411	. . . . . . . . . . . . . . 15 ⊢ (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
124	122, 123	eqtri 2766	. . . . . . . . . . . . . 14 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
125		nncn 11911	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
126		npcan1 11330	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℂ → ((𝑛 − 1) + 1) = 𝑛)
127	125, 126	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) = 𝑛)
128		elnnuz 12551	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ_≥‘1))
129	128	biimpi 215	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘1))
130	127, 129	eqeltrd 2839	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘1))
131	63	nn0zd 12353	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℤ)
132		uzid 12526	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 − 1) ∈ ℤ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
133	131, 132	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)))
134		peano2uz 12570	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 − 1) ∈ (ℤ_≥‘(𝑛 − 1)) → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
135	133, 134	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ_≥‘(𝑛 − 1)))
136	127, 135	eqeltrrd 2840	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ_≥‘(𝑛 − 1)))
137		fzsplit2 13210	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑛 ∈ (ℤ_≥‘(𝑛 − 1))) → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
138	130, 136, 137	syl2anc 583	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
139	127	oveq1d 7270	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = (𝑛...𝑛))
140		nnz 12272	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
141		fzsn 13227	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℤ → (𝑛...𝑛) = {𝑛})
142	140, 141	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (𝑛...𝑛) = {𝑛})
143	139, 142	eqtrd 2778	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = {𝑛})
144	143	uneq2d 4093	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)) = ((1...(𝑛 − 1)) ∪ {𝑛}))
145	138, 144	eqtrd 2778	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ {𝑛}))
146	145	difeq1d 4052	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))))
147		nnre 11910	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
148		ltm1 11747	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) < 𝑛)
149		peano2rem 11218	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) ∈ ℝ)
150		ltnle 10985	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 − 1) ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
151	149, 150	mpancom 684	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
152	148, 151	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ≤ (𝑛 − 1))
153		elfzle2 13189	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑛 − 1)) → 𝑛 ≤ (𝑛 − 1))
154	152, 153	nsyl 140	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
155	147, 154	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
156		incom 4131	. . . . . . . . . . . . . . . . 17 ⊢ ((1...(𝑛 − 1)) ∩ {𝑛}) = ({𝑛} ∩ (1...(𝑛 − 1)))
157	156	eqeq1i 2743	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ({𝑛} ∩ (1...(𝑛 − 1))) = ∅)
158		disjsn 4644	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ¬ 𝑛 ∈ (1...(𝑛 − 1)))
159		disj3 4384	. . . . . . . . . . . . . . . 16 ⊢ (({𝑛} ∩ (1...(𝑛 − 1))) = ∅ ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
160	157, 158, 159	3bitr3i 300	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑛 ∈ (1...(𝑛 − 1)) ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
161	155, 160	sylib 217	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
162	124, 146, 161	3eqtr4a 2805	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
163	120, 162	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
164	163	imaeq2d 5958	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2^nd ‘(1^st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = ((2^nd ‘(1^st ‘𝑧)) “ {𝑛}))
165		dff1o3 6706	. . . . . . . . . . . . . . 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 6502	. . . . . . . . . . . . 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 2784	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1)))))
172	6, 171	sylan 579	. . . . . . . . 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 2826	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (𝑧 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
174	173	anbi1d 629	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁))))
175		2fveq3 6761	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑘 → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
176	175	fveq1d 6758	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧))‘𝑛) = ((2^nd ‘(1^st ‘𝑘))‘𝑛))
177	176	sneqd 4570	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
178	175	imaeq1d 5957	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑛)) = ((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)))
179	175	imaeq1d 5957	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2^nd ‘(1^st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1))))
180	178, 179	difeq12d 4054	. . . . . . . . . . . . 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 2754	. . . . . . . . . . . 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 2003	. . . . . . . . . 10 ⊢ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑘))‘𝑛)} = (((2^nd ‘(1^st ‘𝑘)) “ (1...𝑛)) ∖ ((2^nd ‘(1^st ‘𝑘)) “ (1...(𝑛 − 1)))))
184	9, 183	sylan 579	. . . . . . . . 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 2788	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2^nd ‘(1^st ‘𝑧))‘𝑛)} = {((2^nd ‘(1^st ‘𝑘))‘𝑛)})
186		fvex 6769	. . . . . . . . 9 ⊢ ((2^nd ‘(1^st ‘𝑧))‘𝑛) ∈ V
187	186	sneqr 4768	. . . . . . . 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 6894	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘)))
190		xpopth 7845	. . . . . . . 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 595	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘(1^st ‘𝑧)) = (1^st ‘(1^st ‘𝑘)) ∧ (2^nd ‘(1^st ‘𝑧)) = (2^nd ‘(1^st ‘𝑘))) ↔ (1^st ‘𝑧) = (1^st ‘𝑘)))
192	191	ad2antlr 723	. . . . . 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 708	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (1^st ‘𝑧) = (1^st ‘𝑘))
194		eqtr3 2764	. . . . . 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 7845	. . . . . . 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 595	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
198	197	ad2antlr 723	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → (((1^st ‘𝑧) = (1^st ‘𝑘) ∧ (2^nd ‘𝑧) = (2^nd ‘𝑘)) ↔ 𝑧 = 𝑘))
199	193, 195, 198	mpbi2and 708	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0)) → 𝑧 = 𝑘)
200	199	ex 412	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
201	200	ralrimivva 3114	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
202		fveqeq2 6765	. . 3 ⊢ (𝑧 = 𝑘 → ((2^nd ‘𝑧) = 0 ↔ (2^nd ‘𝑘) = 0))
203	202	rmo4 3660	. 2 ⊢ (∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0 ↔ ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑘) = 0) → 𝑧 = 𝑘))
204	201, 203	sylibr 233	1 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {cab 2715 ≠ wne 2942 ∀wral 3063 ∃*wrmo 3066 {crab 3067 ⦋csb 3828 ∖ cdif 3880 ∪ cun 3881 ∩ cin 3882 ∅c0 4253 ifcif 4456 {csn 4558 class class class wbr 5070 ↦ cmpt 5153 × cxp 5578 ^◡ccnv 5579 “ cima 5583 Fun wfun 6412 Fn wfn 6413 ⟶wf 6414 –onto→wfo 6416 –1-1-onto→wf1o 6417 ‘cfv 6418 (class class class)co 7255 ∘_f cof 7509 1^st c1st 7802 2^nd c2nd 7803 ↑_m cmap 8573 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 − cmin 11135 ℕcn 11903 ℕ₀cn0 12163 ℤcz 12249 ℤ_≥cuz 12511 ...cfz 13168 ..^cfzo 13311

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-fzo 13312

This theorem is referenced by: poimirlem18 35722 poimirlem21 35725

W3C validator