poimirlem18 - Mathbox for Brendan Leahy

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

Theorem poimirlem18 36598

Description: Lemma for poimir 36613 stating that, given a face not on a front face of the main cube and a simplex in which it's opposite the first vertex on the walk, there exists exactly one other simplex containing it. (Contributed by Brendan Leahy, 21-Aug-2020.)

**Hypotheses**
Ref	Expression
poimir.0	⊢ (𝜑 → 𝑁 ∈ ℕ)
poimirlem22.s	⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem22.1	⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
poimirlem22.2	⊢ (𝜑 → 𝑇 ∈ 𝑆)
poimirlem18.3	⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾)
poimirlem18.4	⊢ (𝜑 → (2^nd ‘𝑇) = 0)

**Assertion**
Ref	Expression
poimirlem18	⊢ (𝜑 → ∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

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

Proof of Theorem poimirlem18 Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		poimir.0	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ)
2		poimirlem22.s	. . 3 ⊢ 𝑆 = {𝑡 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) ∣ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
3		poimirlem22.1	. . 3 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑_m (1...𝑁)))
4		poimirlem22.2	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
5		poimirlem18.3	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 𝐾)
6		poimirlem18.4	. . 3 ⊢ (𝜑 → (2^nd ‘𝑇) = 0)
7	1, 2, 3, 4, 5, 6	poimirlem17 36597	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)
8	6	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (2^nd ‘𝑇) = 0)
9		0nnn 12250	. . . . . . . . . . . . 13 ⊢ ¬ 0 ∈ ℕ
10		elfznn 13532	. . . . . . . . . . . . 13 ⊢ (0 ∈ (1...(𝑁 − 1)) → 0 ∈ ℕ)
11	9, 10	mto 196	. . . . . . . . . . . 12 ⊢ ¬ 0 ∈ (1...(𝑁 − 1))
12		eleq1 2821	. . . . . . . . . . . 12 ⊢ ((2^nd ‘𝑧) = 0 → ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ↔ 0 ∈ (1...(𝑁 − 1))))
13	11, 12	mtbiri 326	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝑧) = 0 → ¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)))
14	13	necon2ai 2970	. . . . . . . . . 10 ⊢ ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) → (2^nd ‘𝑧) ≠ 0)
15	1	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℕ)
16		fveq2 6891	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (2^nd ‘𝑡) = (2^nd ‘𝑧))
17	16	breq2d 5160	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → (𝑦 < (2^nd ‘𝑡) ↔ 𝑦 < (2^nd ‘𝑧)))
18	17	ifbid 4551	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑧 → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)))
19	18	csbeq1d 3897	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
20		2fveq3 6896	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘𝑧)))
21		2fveq3 6896	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑧 → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘(1^st ‘𝑧)))
22	21	imaeq1d 6058	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑧 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)))
23	22	xpeq1d 5705	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}))
24	21	imaeq1d 6058	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑧 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)))
25	24	xpeq1d 5705	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))
26	23, 25	uneq12d 4164	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))
27	20, 26	oveq12d 7429	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑧 → ((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
28	27	csbeq2dv 3900	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
29	19, 28	eqtrd 2772	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
30	29	mpteq2dv 5250	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑡 = 𝑧 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
31	30	eqeq2d 2743	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑧 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
32	31, 2	elrab2 3686	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 ↔ (𝑧 ∈ ((((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}))))))
33	32	simprbi 497	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
34	33	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑧)) ∘_f + ((((2^nd ‘(1^st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
35		elrabi 3677	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 ∈ {𝑡 ∈ ((((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...𝑁)))
36	35, 2	eleq2s 2851	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
37		xp1st 8009	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
38	36, 37	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
39		xp1st 8009	. . . . . . . . . . . . . . . . . 18 ⊢ ((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1^st ‘(1^st ‘𝑧)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
40	38, 39	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘(1^st ‘𝑧)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
41		elmapi 8845	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘(1^st ‘𝑧)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶(0..^𝐾))
42	40, 41	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶(0..^𝐾))
43		elfzoelz 13634	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (0..^𝐾) → 𝑛 ∈ ℤ)
44	43	ssriv 3986	. . . . . . . . . . . . . . . 16 ⊢ (0..^𝐾) ⊆ ℤ
45		fss 6734	. . . . . . . . . . . . . . . 16 ⊢ (((1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶(0..^𝐾) ∧ (0..^𝐾) ⊆ ℤ) → (1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶ℤ)
46	42, 44, 45	sylancl 586	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶ℤ)
47	46	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (1^st ‘(1^st ‘𝑧)):(1...𝑁)⟶ℤ)
48		xp2nd 8010	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘𝑧) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
49	38, 48	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
50		fvex 6904	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘(1^st ‘𝑧)) ∈ V
51		f1oeq1 6821	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
52	50, 51	elab 3668	. . . . . . . . . . . . . . . 16 ⊢ ((2^nd ‘(1^st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
53	49, 52	sylib 217	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
54	53	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2^nd ‘(1^st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
55		simpr 485	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)))
56	15, 34, 47, 54, 55	poimirlem1 36581	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2^nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2^nd ‘𝑧))‘𝑛))
57	1	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → 𝑁 ∈ ℕ)
58		fveq2 6891	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (2^nd ‘𝑡) = (2^nd ‘𝑇))
59	58	breq2d 5160	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → (𝑦 < (2^nd ‘𝑡) ↔ 𝑦 < (2^nd ‘𝑇)))
60	59	ifbid 4551	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑇 → if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)))
61	60	csbeq1d 3897	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
62		2fveq3 6896	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → (1^st ‘(1^st ‘𝑡)) = (1^st ‘(1^st ‘𝑇)))
63		2fveq3 6896	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑡 = 𝑇 → (2^nd ‘(1^st ‘𝑡)) = (2^nd ‘(1^st ‘𝑇)))
64	63	imaeq1d 6058	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) = ((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)))
65	64	xpeq1d 5705	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}))
66	63	imaeq1d 6058	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑡 = 𝑇 → ((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
67	66	xpeq1d 5705	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
68	65, 67	uneq12d 4164	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
69	62, 68	oveq12d 7429	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑇 → ((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
70	69	csbeq2dv 3900	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
71	61, 70	eqtrd 2772	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
72	71	mpteq2dv 5250	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑇 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
73	72	eqeq2d 2743	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑡)) ∘_f + ((((2^nd ‘(1^st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
74	73, 2	elrab2 3686	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((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}))))))
75	74	simprbi 497	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
76	4, 75	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
77	76	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2^nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1^st ‘(1^st ‘𝑇)) ∘_f + ((((2^nd ‘(1^st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2^nd ‘(1^st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
78		elrabi 3677	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑇 ∈ {𝑡 ∈ ((((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...𝑁)))
79	78, 2	eleq2s 2851	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
80	4, 79	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
81		xp1st 8009	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
82	80, 81	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
83		xp1st 8009	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
84	82, 83	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)))
85		elmapi 8845	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1^st ‘(1^st ‘𝑇)) ∈ ((0..^𝐾) ↑_m (1...𝑁)) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
86	84, 85	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
87		fss 6734	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶(0..^𝐾) ∧ (0..^𝐾) ⊆ ℤ) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶ℤ)
88	86, 44, 87	sylancl 586	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶ℤ)
89	88	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → (1^st ‘(1^st ‘𝑇)):(1...𝑁)⟶ℤ)
90		xp2nd 8010	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1^st ‘𝑇) ∈ (((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
91	82, 90	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
92		fvex 6904	. . . . . . . . . . . . . . . . . . . 20 ⊢ (2^nd ‘(1^st ‘𝑇)) ∈ V
93		f1oeq1 6821	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = (2^nd ‘(1^st ‘𝑇)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁)))
94	92, 93	elab 3668	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2^nd ‘(1^st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
95	91, 94	sylib 217	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
96	95	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → (2^nd ‘(1^st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
97		simplr 767	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)))
98		xp2nd 8010	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (2^nd ‘𝑇) ∈ (0...𝑁))
99	80, 98	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2^nd ‘𝑇) ∈ (0...𝑁))
100	99	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2^nd ‘𝑇) ∈ (0...𝑁))
101		eldifsn 4790	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2^nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2^nd ‘𝑧)}) ↔ ((2^nd ‘𝑇) ∈ (0...𝑁) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)))
102	101	biimpri 227	. . . . . . . . . . . . . . . . . 18 ⊢ (((2^nd ‘𝑇) ∈ (0...𝑁) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → (2^nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2^nd ‘𝑧)}))
103	100, 102	sylan 580	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → (2^nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2^nd ‘𝑧)}))
104	57, 77, 89, 96, 97, 103	poimirlem2 36582	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2^nd ‘𝑇) ≠ (2^nd ‘𝑧)) → ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2^nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2^nd ‘𝑧))‘𝑛))
105	104	ex 413	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ((2^nd ‘𝑇) ≠ (2^nd ‘𝑧) → ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2^nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2^nd ‘𝑧))‘𝑛)))
106	105	necon1bd 2958	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2^nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2^nd ‘𝑧))‘𝑛) → (2^nd ‘𝑇) = (2^nd ‘𝑧)))
107	106	adantlr 713	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2^nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2^nd ‘𝑧))‘𝑛) → (2^nd ‘𝑇) = (2^nd ‘𝑧)))
108	56, 107	mpd 15	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2^nd ‘𝑇) = (2^nd ‘𝑧))
109	108	neeq1d 3000	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ((2^nd ‘𝑇) ≠ 0 ↔ (2^nd ‘𝑧) ≠ 0))
110	109	exbiri 809	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) → ((2^nd ‘𝑧) ≠ 0 → (2^nd ‘𝑇) ≠ 0)))
111	14, 110	mpdi 45	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) → (2^nd ‘𝑇) ≠ 0))
112	111	necon2bd 2956	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2^nd ‘𝑇) = 0 → ¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1))))
113	8, 112	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)))
114		xp2nd 8010	. . . . . . . . 9 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑_m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (2^nd ‘𝑧) ∈ (0...𝑁))
115	36, 114	syl 17	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑆 → (2^nd ‘𝑧) ∈ (0...𝑁))
116	1	nncnd 12230	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑁 ∈ ℂ)
117		npcan1 11641	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
118	116, 117	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
119		nnuz 12867	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ = (ℤ_≥‘1)
120	1, 119	eleqtrdi 2843	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
121	118, 120	eqeltrd 2833	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘1))
122	1	nnzd 12587	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑁 ∈ ℤ)
123		peano2zm 12607	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
124	122, 123	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
125		uzid 12839	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 − 1) ∈ ℤ → (𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)))
126		peano2uz 12887	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
127	124, 125, 126	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ_≥‘(𝑁 − 1)))
128	118, 127	eqeltrrd 2834	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘(𝑁 − 1)))
129		fzsplit2 13528	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ_≥‘1) ∧ 𝑁 ∈ (ℤ_≥‘(𝑁 − 1))) → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
130	121, 128, 129	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
131	118	oveq1d 7426	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = (𝑁...𝑁))
132		fzsn 13545	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℤ → (𝑁...𝑁) = {𝑁})
133	122, 132	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝑁...𝑁) = {𝑁})
134	131, 133	eqtrd 2772	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = {𝑁})
135	134	uneq2d 4163	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((1...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = ((1...(𝑁 − 1)) ∪ {𝑁}))
136	130, 135	eqtrd 2772	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1...𝑁) = ((1...(𝑁 − 1)) ∪ {𝑁}))
137	136	eleq2d 2819	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((2^nd ‘𝑧) ∈ (1...𝑁) ↔ (2^nd ‘𝑧) ∈ ((1...(𝑁 − 1)) ∪ {𝑁})))
138	137	notbid 317	. . . . . . . . . . . . 13 ⊢ (𝜑 → (¬ (2^nd ‘𝑧) ∈ (1...𝑁) ↔ ¬ (2^nd ‘𝑧) ∈ ((1...(𝑁 − 1)) ∪ {𝑁})))
139		ioran 982	. . . . . . . . . . . . . 14 ⊢ (¬ ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∨ (2^nd ‘𝑧) = 𝑁) ↔ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁))
140		elun 4148	. . . . . . . . . . . . . . 15 ⊢ ((2^nd ‘𝑧) ∈ ((1...(𝑁 − 1)) ∪ {𝑁}) ↔ ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∨ (2^nd ‘𝑧) ∈ {𝑁}))
141		fvex 6904	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘𝑧) ∈ V
142	141	elsn 4643	. . . . . . . . . . . . . . . 16 ⊢ ((2^nd ‘𝑧) ∈ {𝑁} ↔ (2^nd ‘𝑧) = 𝑁)
143	142	orbi2i 911	. . . . . . . . . . . . . . 15 ⊢ (((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∨ (2^nd ‘𝑧) ∈ {𝑁}) ↔ ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∨ (2^nd ‘𝑧) = 𝑁))
144	140, 143	bitri 274	. . . . . . . . . . . . . 14 ⊢ ((2^nd ‘𝑧) ∈ ((1...(𝑁 − 1)) ∪ {𝑁}) ↔ ((2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∨ (2^nd ‘𝑧) = 𝑁))
145	139, 144	xchnxbir 332	. . . . . . . . . . . . 13 ⊢ (¬ (2^nd ‘𝑧) ∈ ((1...(𝑁 − 1)) ∪ {𝑁}) ↔ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁))
146	138, 145	bitrdi 286	. . . . . . . . . . . 12 ⊢ (𝜑 → (¬ (2^nd ‘𝑧) ∈ (1...𝑁) ↔ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁)))
147	146	anbi2d 629	. . . . . . . . . . 11 ⊢ (𝜑 → (((2^nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2^nd ‘𝑧) ∈ (1...𝑁)) ↔ ((2^nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁))))
148	1	nnnn0d 12534	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
149		nn0uz 12866	. . . . . . . . . . . . . . . . 17 ⊢ ℕ₀ = (ℤ_≥‘0)
150	148, 149	eleqtrdi 2843	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘0))
151		fzpred 13551	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ (ℤ_≥‘0) → (0...𝑁) = ({0} ∪ ((0 + 1)...𝑁)))
152	150, 151	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0...𝑁) = ({0} ∪ ((0 + 1)...𝑁)))
153	152	difeq1d 4121	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((0...𝑁) ∖ (1...𝑁)) = (({0} ∪ ((0 + 1)...𝑁)) ∖ (1...𝑁)))
154		difun2 4480	. . . . . . . . . . . . . . 15 ⊢ (({0} ∪ (1...𝑁)) ∖ (1...𝑁)) = ({0} ∖ (1...𝑁))
155		0p1e1 12336	. . . . . . . . . . . . . . . . . 18 ⊢ (0 + 1) = 1
156	155	oveq1i 7421	. . . . . . . . . . . . . . . . 17 ⊢ ((0 + 1)...𝑁) = (1...𝑁)
157	156	uneq2i 4160	. . . . . . . . . . . . . . . 16 ⊢ ({0} ∪ ((0 + 1)...𝑁)) = ({0} ∪ (1...𝑁))
158	157	difeq1i 4118	. . . . . . . . . . . . . . 15 ⊢ (({0} ∪ ((0 + 1)...𝑁)) ∖ (1...𝑁)) = (({0} ∪ (1...𝑁)) ∖ (1...𝑁))
159		incom 4201	. . . . . . . . . . . . . . . . 17 ⊢ ({0} ∩ (1...𝑁)) = ((1...𝑁) ∩ {0})
160		elfznn 13532	. . . . . . . . . . . . . . . . . . 19 ⊢ (0 ∈ (1...𝑁) → 0 ∈ ℕ)
161	9, 160	mto 196	. . . . . . . . . . . . . . . . . 18 ⊢ ¬ 0 ∈ (1...𝑁)
162		disjsn 4715	. . . . . . . . . . . . . . . . . 18 ⊢ (((1...𝑁) ∩ {0}) = ∅ ↔ ¬ 0 ∈ (1...𝑁))
163	161, 162	mpbir 230	. . . . . . . . . . . . . . . . 17 ⊢ ((1...𝑁) ∩ {0}) = ∅
164	159, 163	eqtri 2760	. . . . . . . . . . . . . . . 16 ⊢ ({0} ∩ (1...𝑁)) = ∅
165		disj3 4453	. . . . . . . . . . . . . . . 16 ⊢ (({0} ∩ (1...𝑁)) = ∅ ↔ {0} = ({0} ∖ (1...𝑁)))
166	164, 165	mpbi 229	. . . . . . . . . . . . . . 15 ⊢ {0} = ({0} ∖ (1...𝑁))
167	154, 158, 166	3eqtr4i 2770	. . . . . . . . . . . . . 14 ⊢ (({0} ∪ ((0 + 1)...𝑁)) ∖ (1...𝑁)) = {0}
168	153, 167	eqtrdi 2788	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((0...𝑁) ∖ (1...𝑁)) = {0})
169	168	eleq2d 2819	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2^nd ‘𝑧) ∈ ((0...𝑁) ∖ (1...𝑁)) ↔ (2^nd ‘𝑧) ∈ {0}))
170		eldif 3958	. . . . . . . . . . . 12 ⊢ ((2^nd ‘𝑧) ∈ ((0...𝑁) ∖ (1...𝑁)) ↔ ((2^nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2^nd ‘𝑧) ∈ (1...𝑁)))
171	141	elsn 4643	. . . . . . . . . . . 12 ⊢ ((2^nd ‘𝑧) ∈ {0} ↔ (2^nd ‘𝑧) = 0)
172	169, 170, 171	3bitr3g 312	. . . . . . . . . . 11 ⊢ (𝜑 → (((2^nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2^nd ‘𝑧) ∈ (1...𝑁)) ↔ (2^nd ‘𝑧) = 0))
173	147, 172	bitr3d 280	. . . . . . . . . 10 ⊢ (𝜑 → (((2^nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁)) ↔ (2^nd ‘𝑧) = 0))
174	173	biimpd 228	. . . . . . . . 9 ⊢ (𝜑 → (((2^nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁)) → (2^nd ‘𝑧) = 0))
175	174	expdimp 453	. . . . . . . 8 ⊢ ((𝜑 ∧ (2^nd ‘𝑧) ∈ (0...𝑁)) → ((¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁) → (2^nd ‘𝑧) = 0))
176	115, 175	sylan2 593	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((¬ (2^nd ‘𝑧) ∈ (1...(𝑁 − 1)) ∧ ¬ (2^nd ‘𝑧) = 𝑁) → (2^nd ‘𝑧) = 0))
177	113, 176	mpand 693	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (¬ (2^nd ‘𝑧) = 𝑁 → (2^nd ‘𝑧) = 0))
178	1, 2, 3	poimirlem13 36593	. . . . . . . . . 10 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0)
179		fveqeq2 6900	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑠 → ((2^nd ‘𝑧) = 0 ↔ (2^nd ‘𝑠) = 0))
180	179	rmo4 3726	. . . . . . . . . 10 ⊢ (∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 0 ↔ ∀𝑧 ∈ 𝑆 ∀𝑠 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) → 𝑧 = 𝑠))
181	178, 180	sylib 217	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑠 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) → 𝑧 = 𝑠))
182	181	r19.21bi 3248	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ∀𝑠 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) → 𝑧 = 𝑠))
183	4	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑇 ∈ 𝑆)
184		fveqeq2 6900	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑇 → ((2^nd ‘𝑠) = 0 ↔ (2^nd ‘𝑇) = 0))
185	184	anbi2d 629	. . . . . . . . . 10 ⊢ (𝑠 = 𝑇 → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) ↔ ((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑇) = 0)))
186		eqeq2 2744	. . . . . . . . . 10 ⊢ (𝑠 = 𝑇 → (𝑧 = 𝑠 ↔ 𝑧 = 𝑇))
187	185, 186	imbi12d 344	. . . . . . . . 9 ⊢ (𝑠 = 𝑇 → ((((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) → 𝑧 = 𝑠) ↔ (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑇) = 0) → 𝑧 = 𝑇)))
188	187	rspccv 3609	. . . . . . . 8 ⊢ (∀𝑠 ∈ 𝑆 (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑠) = 0) → 𝑧 = 𝑠) → (𝑇 ∈ 𝑆 → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑇) = 0) → 𝑧 = 𝑇)))
189	182, 183, 188	sylc 65	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (((2^nd ‘𝑧) = 0 ∧ (2^nd ‘𝑇) = 0) → 𝑧 = 𝑇))
190	8, 189	mpan2d 692	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2^nd ‘𝑧) = 0 → 𝑧 = 𝑇))
191	177, 190	syld 47	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (¬ (2^nd ‘𝑧) = 𝑁 → 𝑧 = 𝑇))
192	191	necon1ad 2957	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (𝑧 ≠ 𝑇 → (2^nd ‘𝑧) = 𝑁))
193	192	ralrimiva 3146	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝑧 ≠ 𝑇 → (2^nd ‘𝑧) = 𝑁))
194	1, 2, 3	poimirlem14 36594	. . 3 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 𝑁)
195		rmoim 3736	. . 3 ⊢ (∀𝑧 ∈ 𝑆 (𝑧 ≠ 𝑇 → (2^nd ‘𝑧) = 𝑁) → (∃𝑧 ∈ 𝑆 (2^nd ‘𝑧) = 𝑁 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇))
196	193, 194, 195	sylc 65	. 2 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)
197		reu5 3378	. 2 ⊢ (∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇 ↔ (∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇 ∧ ∃*𝑧 ∈ 𝑆 𝑧 ≠ 𝑇))
198	7, 196, 197	sylanbrc 583	1 ⊢ (𝜑 → ∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 {cab 2709 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ∃!wreu 3374 ∃*wrmo 3375 {crab 3432 ⦋csb 3893 ∖ cdif 3945 ∪ cun 3946 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 ifcif 4528 {csn 4628 class class class wbr 5148 ↦ cmpt 5231 × cxp 5674 ran crn 5677 “ cima 5679 ⟶wf 6539 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7411 ∘_f cof 7670 1^st c1st 7975 2^nd c2nd 7976 ↑_m cmap 8822 ℂcc 11110 0cc0 11112 1c1 11113 + caddc 11115 < clt 11250 − cmin 11446 ℕcn 12214 ℕ₀cn0 12474 ℤcz 12560 ℤ_≥cuz 12824 ...cfz 13486 ..^cfzo 13629

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7672 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-n0 12475 df-z 12561 df-uz 12825 df-fz 13487 df-fzo 13630

This theorem is referenced by: poimirlem22 36602

W3C validator