Theorem poimirlem13 38312

Description: Lemma for poimir 38332- 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(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem22.1	⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))

Assertion

Ref	Expression
poimirlem13	⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 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 738	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝑁 ∈ ℕ)
3		poimirlem22.s	. . . . . . . 8 ⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
4		poimirlem22.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
5	4	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
6		simplrl 788	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝑧 ∈ 𝑆)
7		simprl 782	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘𝑧) = 0)
8	2, 3, 5, 6, 7	poimirlem10 38309	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘f − ((1...𝑁) × {1})) = (1st ‘(1st ‘𝑧)))
9		simplrr 789	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝑘 ∈ 𝑆)
10		simprr 784	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘𝑘) = 0)
11	2, 3, 5, 9, 10	poimirlem10 38309	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → ((𝐹‘(𝑁 − 1)) ∘f − ((1...𝑁) × {1})) = (1st ‘(1st ‘𝑘)))
12	8, 11	eqtr3d 2799	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (1st ‘(1st ‘𝑧)) = (1st ‘(1st ‘𝑘)))
13		elrabi 3645	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
14	13, 3	eleq2s 2880	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
15		xp1st 8016	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
16	14, 15	syl 18	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → (1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
17		xp2nd 8017	. . . . . . . . . . . 12 ⊢ ((1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
18	16, 17	syl 18	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
19		fvex 6894	. . . . . . . . . . . 12 ⊢ (2nd ‘(1st ‘𝑧)) ∈ V
20		f1oeq1 6808	. . . . . . . . . . . 12 ⊢ (𝑓 = (2nd ‘(1st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
21	19, 20	elab 3637	. . . . . . . . . . 11 ⊢ ((2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
22	18, 21	sylib 221	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
23		f1ofn 6821	. . . . . . . . . 10 ⊢ ((2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) → (2nd ‘(1st ‘𝑧)) Fn (1...𝑁))
24	22, 23	syl 18	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘(1st ‘𝑧)) Fn (1...𝑁))
25	24	adantr 485	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (2nd ‘(1st ‘𝑧)) Fn (1...𝑁))
26	25	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘(1st ‘𝑧)) Fn (1...𝑁))
27		elrabi 3645	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ {𝑡 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))} → 𝑘 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
28	27, 3	eleq2s 2880	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ 𝑆 → 𝑘 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
29		xp1st 8016	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑘) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
30	28, 29	syl 18	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ 𝑆 → (1st ‘𝑘) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
31		xp2nd 8017	. . . . . . . . . . . 12 ⊢ ((1st ‘𝑘) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2nd ‘(1st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
32	30, 31	syl 18	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝑆 → (2nd ‘(1st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
33		fvex 6894	. . . . . . . . . . . 12 ⊢ (2nd ‘(1st ‘𝑘)) ∈ V
34		f1oeq1 6808	. . . . . . . . . . . 12 ⊢ (𝑓 = (2nd ‘(1st ‘𝑘)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2nd ‘(1st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁)))
35	33, 34	elab 3637	. . . . . . . . . . 11 ⊢ ((2nd ‘(1st ‘𝑘)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2nd ‘(1st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
36	32, 35	sylib 221	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑆 → (2nd ‘(1st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁))
37		f1ofn 6821	. . . . . . . . . 10 ⊢ ((2nd ‘(1st ‘𝑘)):(1...𝑁)–1-1-onto→(1...𝑁) → (2nd ‘(1st ‘𝑘)) Fn (1...𝑁))
38	36, 37	syl 18	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝑆 → (2nd ‘(1st ‘𝑘)) Fn (1...𝑁))
39	38	adantl 486	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (2nd ‘(1st ‘𝑘)) Fn (1...𝑁))
40	39	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘(1st ‘𝑘)) Fn (1...𝑁))
41		eleq1 2850	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ (1...𝑁) ↔ 𝑛 ∈ (1...𝑁)))
42	41	anbi2d 641	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁))))
43		oveq2 7420	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (1...𝑚) = (1...𝑛))
44	43	imaeq2d 6061	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑧)) “ (1...𝑛)))
45	43	imaeq2d 6061	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑛)))
46	44, 45	eqeq12d 2778	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)) ↔ ((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑛))))
47	42, 46	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑚))) ↔ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑛)))))
48	1	ad3antrrr 742	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑁 ∈ ℕ)
49	4	ad3antrrr 742	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
50		simpl 487	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑧 ∈ 𝑆)
51	50	ad3antlr 743	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑧 ∈ 𝑆)
52		simplrl 788	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2nd ‘𝑧) = 0)
53		simpr 489	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → 𝑘 ∈ 𝑆)
54	53	ad3antlr 743	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑘 ∈ 𝑆)
55		simplrr 789	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → (2nd ‘𝑘) = 0)
56		simpr 489	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → 𝑚 ∈ (1...𝑁))
57	48, 3, 49, 51, 52, 54, 55, 56	poimirlem11 38310	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) ⊆ ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)))
58	48, 3, 49, 54, 55, 51, 52, 56	poimirlem11 38310	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)) ⊆ ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)))
59	57, 58	eqssd 3953	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)))
60	47, 59	chvarvv 2018	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑛)))
61		simpll 778	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝜑)
62		elfznn 13588	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℕ)
63		nnm1nn0 12551	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ0)
64	62, 63	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℕ0)
65	64	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ0)
66	62	nncnd 12255	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℂ)
67		ax-1cn 11164	. . . . . . . . . . . . . . . . . . . 20 ⊢ 1 ∈ ℂ
68		subeq0 11490	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
69	66, 67, 68	sylancl 597	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) = 0 ↔ 𝑛 = 1))
70	69	necon3abid 2993	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → ((𝑛 − 1) ≠ 0 ↔ ¬ 𝑛 = 1))
71	70	biimpar 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ≠ 0)
72		elnnne0 12524	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 − 1) ∈ ℕ ↔ ((𝑛 − 1) ∈ ℕ0 ∧ (𝑛 − 1) ≠ 0))
73	65, 71, 72	sylanbrc 594	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1) → (𝑛 − 1) ∈ ℕ)
74	73	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ ℕ)
75	64	nn0red 12572	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ∈ ℝ)
76	75	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ∈ ℝ)
77	62	nnred 12254	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ∈ ℝ)
78	77	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℝ)
79	1	nnred 12254	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ ℝ)
80	79	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑁 ∈ ℝ)
81	77	lem1d 12154	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → (𝑛 − 1) ≤ 𝑛)
82	81	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑛)
83		elfzle2 13562	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (1...𝑁) → 𝑛 ≤ 𝑁)
84	83	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ≤ 𝑁)
85	76, 78, 80, 82, 84	letrd 11373	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → (𝑛 − 1) ≤ 𝑁)
86	85	adantrr 729	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ≤ 𝑁)
87	1	nnzd 12623	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℤ)
88		fznn 13627	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℤ → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
89	87, 88	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
90	89	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → ((𝑛 − 1) ∈ (1...𝑁) ↔ ((𝑛 − 1) ∈ ℕ ∧ (𝑛 − 1) ≤ 𝑁)))
91	74, 86, 90	mpbir2and 725	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
92	61, 91	sylan 591	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → (𝑛 − 1) ∈ (1...𝑁))
93		ovex 7445	. . . . . . . . . . . . . 14 ⊢ (𝑛 − 1) ∈ V
94		eleq1 2850	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → (𝑚 ∈ (1...𝑁) ↔ (𝑛 − 1) ∈ (1...𝑁)))
95	94	anbi2d 641	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) ↔ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁))))
96		oveq2 7420	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = (𝑛 − 1) → (1...𝑚) = (1...(𝑛 − 1)))
97	96	imaeq2d 6061	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))))
98	96	imaeq2d 6061	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = (𝑛 − 1) → ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
99	97, 98	eqeq12d 2778	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = (𝑛 − 1) → (((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑚)) ↔ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
100	95, 99	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑚 = (𝑛 − 1) → (((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑚 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...𝑚)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑚))) ↔ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))))
101	93, 100, 59	vtocl 3524	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ (𝑛 − 1) ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
102	92, 101	syldan 602	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ (𝑛 ∈ (1...𝑁) ∧ ¬ 𝑛 = 1)) → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
103	102	expr 461	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → (¬ 𝑛 = 1 → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
104		ima0 6078	. . . . . . . . . . . . 13 ⊢ ((2nd ‘(1st ‘𝑧)) “ ∅) = ∅
105		ima0 6078	. . . . . . . . . . . . 13 ⊢ ((2nd ‘(1st ‘𝑘)) “ ∅) = ∅
106	104, 105	eqtr4i 2788	. . . . . . . . . . . 12 ⊢ ((2nd ‘(1st ‘𝑧)) “ ∅) = ((2nd ‘(1st ‘𝑘)) “ ∅)
107		oveq1 7419	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 1 → (𝑛 − 1) = (1 − 1))
108		1m1e0 12319	. . . . . . . . . . . . . . . 16 ⊢ (1 − 1) = 0
109	107, 108	eqtrdi 2813	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 1 → (𝑛 − 1) = 0)
110	109	oveq2d 7428	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = (1...0))
111		fz10 13579	. . . . . . . . . . . . . 14 ⊢ (1...0) = ∅
112	110, 111	eqtrdi 2813	. . . . . . . . . . . . 13 ⊢ (𝑛 = 1 → (1...(𝑛 − 1)) = ∅)
113	112	imaeq2d 6061	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑧)) “ ∅))
114	112	imaeq2d 6061	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ ∅))
115	106, 113, 114	3eqtr4a 2823	. . . . . . . . . . 11 ⊢ (𝑛 = 1 → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
116	103, 115	pm2.61d2 183	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
117	60, 116	difeq12d 4081	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))) = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
118		fnsnfv 6960	. . . . . . . . . . . 12 ⊢ (((2nd ‘(1st ‘𝑧)) Fn (1...𝑁) ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = ((2nd ‘(1st ‘𝑧)) “ {𝑛}))
119	24, 118	sylan 591	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = ((2nd ‘(1st ‘𝑧)) “ {𝑛}))
120	62	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → 𝑛 ∈ ℕ)
121		uncom 4111	. . . . . . . . . . . . . . . 16 ⊢ ((1...(𝑛 − 1)) ∪ {𝑛}) = ({𝑛} ∪ (1...(𝑛 − 1)))
122	121	difeq1i 4076	. . . . . . . . . . . . . . 15 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1)))
123		difun2 4441	. . . . . . . . . . . . . . 15 ⊢ (({𝑛} ∪ (1...(𝑛 − 1))) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
124	122, 123	eqtri 2785	. . . . . . . . . . . . . 14 ⊢ (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))) = ({𝑛} ∖ (1...(𝑛 − 1)))
125		nncn 12247	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℂ)
126		npcan1 11645	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℂ → ((𝑛 − 1) + 1) = 𝑛)
127	125, 126	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) = 𝑛)
128		elnnuz 12908	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ≥‘1))
129	128	biimpi 219	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ≥‘1))
130	127, 129	eqeltrd 2862	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ≥‘1))
131	63	nn0zd 12622	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℤ)
132		uzid 12883	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 − 1) ∈ ℤ → (𝑛 − 1) ∈ (ℤ≥‘(𝑛 − 1)))
133	131, 132	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ (ℤ≥‘(𝑛 − 1)))
134		peano2uz 12931	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 − 1) ∈ (ℤ≥‘(𝑛 − 1)) → ((𝑛 − 1) + 1) ∈ (ℤ≥‘(𝑛 − 1)))
135	133, 134	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → ((𝑛 − 1) + 1) ∈ (ℤ≥‘(𝑛 − 1)))
136	127, 135	eqeltrrd 2863	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ (ℤ≥‘(𝑛 − 1)))
137		fzsplit2 13584	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 − 1) + 1) ∈ (ℤ≥‘1) ∧ 𝑛 ∈ (ℤ≥‘(𝑛 − 1))) → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
138	130, 136, 137	syl2anc 595	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)))
139	127	oveq1d 7427	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = (𝑛...𝑛))
140		nnz 12618	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℤ)
141		fzsn 13601	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℤ → (𝑛...𝑛) = {𝑛})
142	140, 141	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (𝑛...𝑛) = {𝑛})
143	139, 142	eqtrd 2797	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℕ → (((𝑛 − 1) + 1)...𝑛) = {𝑛})
144	143	uneq2d 4121	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((1...(𝑛 − 1)) ∪ (((𝑛 − 1) + 1)...𝑛)) = ((1...(𝑛 − 1)) ∪ {𝑛}))
145	138, 144	eqtrd 2797	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (1...𝑛) = ((1...(𝑛 − 1)) ∪ {𝑛}))
146	145	difeq1d 4079	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = (((1...(𝑛 − 1)) ∪ {𝑛}) ∖ (1...(𝑛 − 1))))
147		nnre 12246	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
148		ltm1 12063	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) < 𝑛)
149		peano2rem 11531	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ ℝ → (𝑛 − 1) ∈ ℝ)
150		ltnle 11295	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 − 1) ∈ ℝ ∧ 𝑛 ∈ ℝ) → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
151	149, 150	mpancom 700	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℝ → ((𝑛 − 1) < 𝑛 ↔ ¬ 𝑛 ≤ (𝑛 − 1)))
152	148, 151	mpbid 235	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ≤ (𝑛 − 1))
153		elfzle2 13562	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (1...(𝑛 − 1)) → 𝑛 ≤ (𝑛 − 1))
154	152, 153	nsyl 141	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℝ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
155	147, 154	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → ¬ 𝑛 ∈ (1...(𝑛 − 1)))
156		incom 4161	. . . . . . . . . . . . . . . . 17 ⊢ ((1...(𝑛 − 1)) ∩ {𝑛}) = ({𝑛} ∩ (1...(𝑛 − 1)))
157	156	eqeq1i 2767	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ({𝑛} ∩ (1...(𝑛 − 1))) = ∅)
158		disjsn 4676	. . . . . . . . . . . . . . . 16 ⊢ (((1...(𝑛 − 1)) ∩ {𝑛}) = ∅ ↔ ¬ 𝑛 ∈ (1...(𝑛 − 1)))
159		disj3 4413	. . . . . . . . . . . . . . . 16 ⊢ (({𝑛} ∩ (1...(𝑛 − 1))) = ∅ ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
160	157, 158, 159	3bitr3i 304	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑛 ∈ (1...(𝑛 − 1)) ↔ {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
161	155, 160	sylib 221	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → {𝑛} = ({𝑛} ∖ (1...(𝑛 − 1))))
162	124, 146, 161	3eqtr4a 2823	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
163	120, 162	syl 18	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((1...𝑛) ∖ (1...(𝑛 − 1))) = {𝑛})
164	163	imaeq2d 6061	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = ((2nd ‘(1st ‘𝑧)) “ {𝑛}))
165		dff1o3 6827	. . . . . . . . . . . . . . 15 ⊢ ((2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) ↔ ((2nd ‘(1st ‘𝑧)):(1...𝑁)–onto→(1...𝑁) ∧ Fun ◡(2nd ‘(1st ‘𝑧))))
166	165	simprbi 502	. . . . . . . . . . . . . 14 ⊢ ((2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁) → Fun ◡(2nd ‘(1st ‘𝑧)))
167	22, 166	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑆 → Fun ◡(2nd ‘(1st ‘𝑧)))
168		imadif 6620	. . . . . . . . . . . . 13 ⊢ (Fun ◡(2nd ‘(1st ‘𝑧)) → ((2nd ‘(1st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))))
169	167, 168	syl 18	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑆 → ((2nd ‘(1st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))))
170	169	adantr 485	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧)) “ ((1...𝑛) ∖ (1...(𝑛 − 1)))) = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))))
171	119, 164, 170	3eqtr2d 2803	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))))
172	6, 171	sylan 591	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))))
173		eleq1 2850	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (𝑧 ∈ 𝑆 ↔ 𝑘 ∈ 𝑆))
174	173	anbi1d 642	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) ↔ (𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁))))
175		2fveq3 6886	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑘 → (2nd ‘(1st ‘𝑧)) = (2nd ‘(1st ‘𝑘)))
176	175	fveq1d 6883	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2nd ‘(1st ‘𝑧))‘𝑛) = ((2nd ‘(1st ‘𝑘))‘𝑛))
177	176	sneqd 4600	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → {((2nd ‘(1st ‘𝑧))‘𝑛)} = {((2nd ‘(1st ‘𝑘))‘𝑛)})
178	175	imaeq1d 6060	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) = ((2nd ‘(1st ‘𝑘)) “ (1...𝑛)))
179	175	imaeq1d 6060	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑘 → ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))) = ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))
180	178, 179	difeq12d 4081	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑘 → (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))) = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
181	177, 180	eqeq12d 2778	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑘 → ({((2nd ‘(1st ‘𝑧))‘𝑛)} = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1)))) ↔ {((2nd ‘(1st ‘𝑘))‘𝑛)} = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1))))))
182	174, 181	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑘 → (((𝑧 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = (((2nd ‘(1st ‘𝑧)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑧)) “ (1...(𝑛 − 1))))) ↔ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑘))‘𝑛)} = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))))
183	182, 171	chvarvv 2018	. . . . . . . . . 10 ⊢ ((𝑘 ∈ 𝑆 ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑘))‘𝑛)} = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
184	9, 183	sylan 591	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑘))‘𝑛)} = (((2nd ‘(1st ‘𝑘)) “ (1...𝑛)) ∖ ((2nd ‘(1st ‘𝑘)) “ (1...(𝑛 − 1)))))
185	117, 172, 184	3eqtr4d 2807	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → {((2nd ‘(1st ‘𝑧))‘𝑛)} = {((2nd ‘(1st ‘𝑘))‘𝑛)})
186		fvex 6894	. . . . . . . . 9 ⊢ ((2nd ‘(1st ‘𝑧))‘𝑛) ∈ V
187	186	sneqr 4804	. . . . . . . 8 ⊢ ({((2nd ‘(1st ‘𝑧))‘𝑛)} = {((2nd ‘(1st ‘𝑘))‘𝑛)} → ((2nd ‘(1st ‘𝑧))‘𝑛) = ((2nd ‘(1st ‘𝑘))‘𝑛))
188	185, 187	syl 18	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) ∧ 𝑛 ∈ (1...𝑁)) → ((2nd ‘(1st ‘𝑧))‘𝑛) = ((2nd ‘(1st ‘𝑘))‘𝑛))
189	26, 40, 188	eqfnfvd 7028	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘(1st ‘𝑧)) = (2nd ‘(1st ‘𝑘)))
190		xpopth 8025	. . . . . . . 8 ⊢ (((1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) ∧ (1st ‘𝑘) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})) → (((1st ‘(1st ‘𝑧)) = (1st ‘(1st ‘𝑘)) ∧ (2nd ‘(1st ‘𝑧)) = (2nd ‘(1st ‘𝑘))) ↔ (1st ‘𝑧) = (1st ‘𝑘)))
191	16, 30, 190	syl2an 607	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1st ‘(1st ‘𝑧)) = (1st ‘(1st ‘𝑘)) ∧ (2nd ‘(1st ‘𝑧)) = (2nd ‘(1st ‘𝑘))) ↔ (1st ‘𝑧) = (1st ‘𝑘)))
192	191	ad2antlr 739	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (((1st ‘(1st ‘𝑧)) = (1st ‘(1st ‘𝑘)) ∧ (2nd ‘(1st ‘𝑧)) = (2nd ‘(1st ‘𝑘))) ↔ (1st ‘𝑧) = (1st ‘𝑘)))
193	12, 189, 192	mpbi2and 724	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (1st ‘𝑧) = (1st ‘𝑘))
194		eqtr3 2784	. . . . . 6 ⊢ (((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0) → (2nd ‘𝑧) = (2nd ‘𝑘))
195	194	adantl 486	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (2nd ‘𝑧) = (2nd ‘𝑘))
196		xpopth 8025	. . . . . . 7 ⊢ ((𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∧ 𝑘 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁))) → (((1st ‘𝑧) = (1st ‘𝑘) ∧ (2nd ‘𝑧) = (2nd ‘𝑘)) ↔ 𝑧 = 𝑘))
197	14, 28, 196	syl2an 607	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) → (((1st ‘𝑧) = (1st ‘𝑘) ∧ (2nd ‘𝑧) = (2nd ‘𝑘)) ↔ 𝑧 = 𝑘))
198	197	ad2antlr 739	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → (((1st ‘𝑧) = (1st ‘𝑘) ∧ (2nd ‘𝑧) = (2nd ‘𝑘)) ↔ 𝑧 = 𝑘))
199	193, 195, 198	mpbi2and 724	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) ∧ ((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0)) → 𝑧 = 𝑘)
200	199	ex 417	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆)) → (((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0) → 𝑧 = 𝑘))
201	200	ralrimivva 3207	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0) → 𝑧 = 𝑘))
202		fveqeq2 6890	. . 3 ⊢ (𝑧 = 𝑘 → ((2nd ‘𝑧) = 0 ↔ (2nd ‘𝑘) = 0))
203	202	rmo4 3692	. 2 ⊢ (∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 0 ↔ ∀𝑧 ∈ 𝑆 ∀𝑘 ∈ 𝑆 (((2nd ‘𝑧) = 0 ∧ (2nd ‘𝑘) = 0) → 𝑧 = 𝑘))
204	201, 203	sylibr 237	1 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 0)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃*wrmo 3367  {crab 3415  ⦋csb 3852   ∖ cdif 3901   ∪ cun 3902   ∩ cin 3903  ∅c0 4285  ifcif 4486  {csn 4588   class class class wbr 5108   ↦ cmpt 5191   × cxp 5658  ^◡ccnv 5659   “ cima 5663  Fun wfun 6530   Fn wfn 6531  ⟶wf 6532  –onto→wfo 6534  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7412   ∘_f cof 7674  1^st c1st 7982  2^nd c2nd 7983   ↑_m cmap 8822  ℂcc 11104  ℝcr 11105  0cc0 11106  1c1 11107   + caddc 11109   < clt 11249   ≤ cle 11250   − cmin 11447  ℕcn 12239  ℕ₀cn0 12510  ℤcz 12597  ℤ_≥cuz 12868  ...cfz 13541  ..^cfzo 13689

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7676  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-er 8692  df-map 8824  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255  df-sub 11449  df-neg 11450  df-nn 12240  df-n0 12511  df-z 12598  df-uz 12869  df-fz 13542  df-fzo 13690

This theorem is used by:  poimirlem18  38317  poimirlem21  38320