Theorem poimirlem21 38145

Description: Lemma for poimir 38157 stating that, given a face not on a back face of the cube and a simplex in which it's opposite the final point of 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(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
poimirlem22.1	⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
poimirlem22.2	⊢ (𝜑 → 𝑇 ∈ 𝑆)
poimirlem22.3	⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 0)
poimirlem21.4	⊢ (𝜑 → (2nd ‘𝑇) = 𝑁)

Assertion

Ref	Expression
poimirlem21	⊢ (𝜑 → ∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

Distinct variable groups:   𝑓,𝑗,𝑛,𝑝,𝑡,𝑦,𝑧   𝜑,𝑗,𝑛,𝑦   𝑗,𝐹,𝑛,𝑦   𝑗,𝑁,𝑛,𝑦   𝑇,𝑗,𝑛,𝑦   𝜑,𝑝,𝑡   𝑓,𝐾,𝑗,𝑛,𝑝,𝑡   𝑓,𝑁,𝑝,𝑡   𝑇,𝑓,𝑝   𝜑,𝑧   𝑓,𝐹,𝑝,𝑡,𝑧   𝑧,𝐾   𝑧,𝑁   𝑡,𝑇,𝑧   𝑆,𝑗,𝑛,𝑝,𝑡,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑓)   𝑆(𝑓)   𝐾(𝑦)

Proof of Theorem poimirlem21

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(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))}
3		poimirlem22.1	. . 3 ⊢ (𝜑 → 𝐹:(0...(𝑁 − 1))⟶((0...𝐾) ↑m (1...𝑁)))
4		poimirlem22.2	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑆)
5		poimirlem22.3	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...𝑁)) → ∃𝑝 ∈ ran 𝐹(𝑝‘𝑛) ≠ 0)
6		poimirlem21.4	. . 3 ⊢ (𝜑 → (2nd ‘𝑇) = 𝑁)
7	1, 2, 3, 4, 5, 6	poimirlem20 38144	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)
8	6	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (2nd ‘𝑇) = 𝑁)
9	1	nnred 12227	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ ℝ)
10	9	ltm1d 12126	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑁 − 1) < 𝑁)
11		nnm1nn0 12524	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0)
12	1, 11	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑁 − 1) ∈ ℕ0)
13	12	nn0red 12545	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ)
14	13, 9	ltnled 11332	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((𝑁 − 1) < 𝑁 ↔ ¬ 𝑁 ≤ (𝑁 − 1)))
15	10, 14	mpbid 234	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ¬ 𝑁 ≤ (𝑁 − 1))
16		elfzle2 13535	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ (1...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
17	15, 16	nsyl 140	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ 𝑁 ∈ (1...(𝑁 − 1)))
18		eleq1 2852	. . . . . . . . . . . . . 14 ⊢ ((2nd ‘𝑧) = 𝑁 → ((2nd ‘𝑧) ∈ (1...(𝑁 − 1)) ↔ 𝑁 ∈ (1...(𝑁 − 1))))
19	18	notbid 320	. . . . . . . . . . . . 13 ⊢ ((2nd ‘𝑧) = 𝑁 → (¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1)) ↔ ¬ 𝑁 ∈ (1...(𝑁 − 1))))
20	17, 19	syl5ibrcom 249	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2nd ‘𝑧) = 𝑁 → ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
21	20	necon2ad 2974	. . . . . . . . . . 11 ⊢ (𝜑 → ((2nd ‘𝑧) ∈ (1...(𝑁 − 1)) → (2nd ‘𝑧) ≠ 𝑁))
22	21	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2nd ‘𝑧) ∈ (1...(𝑁 − 1)) → (2nd ‘𝑧) ≠ 𝑁))
23	1	ad2antrr 736	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → 𝑁 ∈ ℕ)
24		fveq2 6869	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (2nd ‘𝑡) = (2nd ‘𝑧))
25	24	breq2d 5114	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → (𝑦 < (2nd ‘𝑡) ↔ 𝑦 < (2nd ‘𝑧)))
26	25	ifbid 4506	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑧 → if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)))
27	26	csbeq1d 3858	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
28		2fveq3 6874	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → (1st ‘(1st ‘𝑡)) = (1st ‘(1st ‘𝑧)))
29		2fveq3 6874	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑧 → (2nd ‘(1st ‘𝑡)) = (2nd ‘(1st ‘𝑧)))
30	29	imaeq1d 6050	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑧 → ((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑧)) “ (1...𝑗)))
31	30	xpeq1d 5678	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}))
32	29	imaeq1d 6050	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑧 → ((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)))
33	32	xpeq1d 5678	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑧 → (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))
34	31, 33	uneq12d 4124	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑧 → ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))
35	28, 34	oveq12d 7416	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑧 → ((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
36	35	csbeq2dv 3861	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
37	27, 36	eqtrd 2799	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 = 𝑧 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))
38	37	mpteq2dv 5196	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑡 = 𝑧 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
39	38	eqeq2d 2775	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑧 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
40	39, 2	elrab2 3656	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 ↔ (𝑧 ∈ ((((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}))))))
41	40	simprbi 501	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
42	41	ad2antlr 737	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑧), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑧)) ∘f + ((((2nd ‘(1st ‘𝑧)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑧)) “ ((𝑗 + 1)...𝑁)) × {0})))))
43		elrabi 3648	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 ∈ {𝑡 ∈ ((((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...𝑁)))
44	43, 2	eleq2s 2882	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
45		xp1st 8004	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
46	44, 45	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 ∈ 𝑆 → (1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
47		xp1st 8004	. . . . . . . . . . . . . . . . . 18 ⊢ ((1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1st ‘(1st ‘𝑧)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
48	46, 47	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 ∈ 𝑆 → (1st ‘(1st ‘𝑧)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
49		elmapi 8832	. . . . . . . . . . . . . . . . 17 ⊢ ((1st ‘(1st ‘𝑧)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑧)):(1...𝑁)⟶(0..^𝐾))
50	48, 49	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → (1st ‘(1st ‘𝑧)):(1...𝑁)⟶(0..^𝐾))
51		elfzoelz 13666	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (0..^𝐾) → 𝑛 ∈ ℤ)
52	51	ssriv 3942	. . . . . . . . . . . . . . . 16 ⊢ (0..^𝐾) ⊆ ℤ
53		fss 6710	. . . . . . . . . . . . . . . 16 ⊢ (((1st ‘(1st ‘𝑧)):(1...𝑁)⟶(0..^𝐾) ∧ (0..^𝐾) ⊆ ℤ) → (1st ‘(1st ‘𝑧)):(1...𝑁)⟶ℤ)
54	50, 52, 53	sylancl 595	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (1st ‘(1st ‘𝑧)):(1...𝑁)⟶ℤ)
55	54	ad2antlr 737	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (1st ‘(1st ‘𝑧)):(1...𝑁)⟶ℤ)
56		xp2nd 8005	. . . . . . . . . . . . . . . . 17 ⊢ ((1st ‘𝑧) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
57	46, 56	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
58		fvex 6882	. . . . . . . . . . . . . . . . 17 ⊢ (2nd ‘(1st ‘𝑧)) ∈ V
59		f1oeq1 6796	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = (2nd ‘(1st ‘𝑧)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁)))
60	58, 59	elab 3640	. . . . . . . . . . . . . . . 16 ⊢ ((2nd ‘(1st ‘𝑧)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
61	57, 60	sylib 220	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
62	61	ad2antlr 737	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘(1st ‘𝑧)):(1...𝑁)–1-1-onto→(1...𝑁))
63		simpr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))
64	23, 42, 55, 62, 63	poimirlem1 38125	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2nd ‘𝑧))‘𝑛))
65	1	ad2antrr 736	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → 𝑁 ∈ ℕ)
66		fveq2 6869	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (2nd ‘𝑡) = (2nd ‘𝑇))
67	66	breq2d 5114	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → (𝑦 < (2nd ‘𝑡) ↔ 𝑦 < (2nd ‘𝑇)))
68	67	ifbid 4506	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑇 → if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) = if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)))
69	68	csbeq1d 3858	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))))
70		2fveq3 6874	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → (1st ‘(1st ‘𝑡)) = (1st ‘(1st ‘𝑇)))
71		2fveq3 6874	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑡 = 𝑇 → (2nd ‘(1st ‘𝑡)) = (2nd ‘(1st ‘𝑇)))
72	71	imaeq1d 6050	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) = ((2nd ‘(1st ‘𝑇)) “ (1...𝑗)))
73	72	xpeq1d 5678	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) = (((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}))
74	71	imaeq1d 6050	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑡 = 𝑇 → ((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) = ((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)))
75	74	xpeq1d 5678	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑡 = 𝑇 → (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}) = (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))
76	73, 75	uneq12d 4124	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = 𝑇 → ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})) = ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))
77	70, 76	oveq12d 7416	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑡 = 𝑇 → ((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
78	77	csbeq2dv 3861	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
79	69, 78	eqtrd 2799	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑡 = 𝑇 → ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0}))) = ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))
80	79	mpteq2dv 5196	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = 𝑇 → (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
81	80	eqeq2d 2775	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = 𝑇 → (𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑡), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑡)) ∘f + ((((2nd ‘(1st ‘𝑡)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑡)) “ ((𝑗 + 1)...𝑁)) × {0})))) ↔ 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0}))))))
82	81, 2	elrab2 3656	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ 𝑆 ↔ (𝑇 ∈ ((((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}))))))
83	82	simprbi 501	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑇 ∈ 𝑆 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
84	4, 83	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
85	84	ad2antrr 736	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → 𝐹 = (𝑦 ∈ (0...(𝑁 − 1)) ↦ ⦋if(𝑦 < (2nd ‘𝑇), 𝑦, (𝑦 + 1)) / 𝑗⦌((1st ‘(1st ‘𝑇)) ∘f + ((((2nd ‘(1st ‘𝑇)) “ (1...𝑗)) × {1}) ∪ (((2nd ‘(1st ‘𝑇)) “ ((𝑗 + 1)...𝑁)) × {0})))))
86		elrabi 3648	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑇 ∈ {𝑡 ∈ ((((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...𝑁)))
87	86, 2	eleq2s 2882	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑇 ∈ 𝑆 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
88	4, 87	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)))
89		xp1st 8004	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
90	88, 89	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}))
91		xp1st 8004	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
92	90, 91	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)))
93		elmapi 8832	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1st ‘(1st ‘𝑇)) ∈ ((0..^𝐾) ↑m (1...𝑁)) → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
94	92, 93	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾))
95		fss 6710	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1st ‘(1st ‘𝑇)):(1...𝑁)⟶(0..^𝐾) ∧ (0..^𝐾) ⊆ ℤ) → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶ℤ)
96	94, 52, 95	sylancl 595	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶ℤ)
97	96	ad2antrr 736	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → (1st ‘(1st ‘𝑇)):(1...𝑁)⟶ℤ)
98		xp2nd 8005	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1st ‘𝑇) ∈ (((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
99	90, 98	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)})
100		fvex 6882	. . . . . . . . . . . . . . . . . . . 20 ⊢ (2nd ‘(1st ‘𝑇)) ∈ V
101		f1oeq1 6796	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = (2nd ‘(1st ‘𝑇)) → (𝑓:(1...𝑁)–1-1-onto→(1...𝑁) ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁)))
102	100, 101	elab 3640	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2nd ‘(1st ‘𝑇)) ∈ {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)} ↔ (2nd ‘(1st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
103	99, 102	sylib 220	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (2nd ‘(1st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
104	103	ad2antrr 736	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → (2nd ‘(1st ‘𝑇)):(1...𝑁)–1-1-onto→(1...𝑁))
105		simplr 778	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))
106		xp2nd 8005	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (2nd ‘𝑇) ∈ (0...𝑁))
107	88, 106	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (2nd ‘𝑇) ∈ (0...𝑁))
108	107	adantr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘𝑇) ∈ (0...𝑁))
109		eldifsn 4748	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2nd ‘𝑧)}) ↔ ((2nd ‘𝑇) ∈ (0...𝑁) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)))
110	109	biimpri 230	. . . . . . . . . . . . . . . . . 18 ⊢ (((2nd ‘𝑇) ∈ (0...𝑁) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → (2nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2nd ‘𝑧)}))
111	108, 110	sylan 589	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → (2nd ‘𝑇) ∈ ((0...𝑁) ∖ {(2nd ‘𝑧)}))
112	65, 85, 97, 104, 105, 111	poimirlem2 38126	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ∧ (2nd ‘𝑇) ≠ (2nd ‘𝑧)) → ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2nd ‘𝑧))‘𝑛))
113	112	ex 416	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ((2nd ‘𝑇) ≠ (2nd ‘𝑧) → ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2nd ‘𝑧))‘𝑛)))
114	113	necon1bd 2977	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2nd ‘𝑧))‘𝑛) → (2nd ‘𝑇) = (2nd ‘𝑧)))
115	114	adantlr 725	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (¬ ∃*𝑛 ∈ (1...𝑁)((𝐹‘((2nd ‘𝑧) − 1))‘𝑛) ≠ ((𝐹‘(2nd ‘𝑧))‘𝑛) → (2nd ‘𝑇) = (2nd ‘𝑧)))
116	64, 115	mpd 15	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘𝑇) = (2nd ‘𝑧))
117	116	neeq1d 3018	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑆) ∧ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → ((2nd ‘𝑇) ≠ 𝑁 ↔ (2nd ‘𝑧) ≠ 𝑁))
118	117	exbiri 820	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2nd ‘𝑧) ∈ (1...(𝑁 − 1)) → ((2nd ‘𝑧) ≠ 𝑁 → (2nd ‘𝑇) ≠ 𝑁)))
119	22, 118	mpdd 43	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2nd ‘𝑧) ∈ (1...(𝑁 − 1)) → (2nd ‘𝑇) ≠ 𝑁))
120	119	necon2bd 2975	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2nd ‘𝑇) = 𝑁 → ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
121	8, 120	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))
122		xp2nd 8005	. . . . . . . . 9 ⊢ (𝑧 ∈ ((((0..^𝐾) ↑m (1...𝑁)) × {𝑓 ∣ 𝑓:(1...𝑁)–1-1-onto→(1...𝑁)}) × (0...𝑁)) → (2nd ‘𝑧) ∈ (0...𝑁))
123	44, 122	syl 17	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑆 → (2nd ‘𝑧) ∈ (0...𝑁))
124		nn0uz 12879	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ0 = (ℤ≥‘0)
125	12, 124	eleqtrdi 2874	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ≥‘0))
126		fzpred 13579	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘0) → (0...(𝑁 − 1)) = ({0} ∪ ((0 + 1)...(𝑁 − 1))))
127	125, 126	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0...(𝑁 − 1)) = ({0} ∪ ((0 + 1)...(𝑁 − 1))))
128		0p1e1 12340	. . . . . . . . . . . . . . . . . 18 ⊢ (0 + 1) = 1
129	128	oveq1i 7408	. . . . . . . . . . . . . . . . 17 ⊢ ((0 + 1)...(𝑁 − 1)) = (1...(𝑁 − 1))
130	129	uneq2i 4120	. . . . . . . . . . . . . . . 16 ⊢ ({0} ∪ ((0 + 1)...(𝑁 − 1))) = ({0} ∪ (1...(𝑁 − 1)))
131	127, 130	eqtrdi 2815	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0...(𝑁 − 1)) = ({0} ∪ (1...(𝑁 − 1))))
132	131	eleq2d 2850	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((2nd ‘𝑧) ∈ (0...(𝑁 − 1)) ↔ (2nd ‘𝑧) ∈ ({0} ∪ (1...(𝑁 − 1)))))
133	132	notbid 320	. . . . . . . . . . . . 13 ⊢ (𝜑 → (¬ (2nd ‘𝑧) ∈ (0...(𝑁 − 1)) ↔ ¬ (2nd ‘𝑧) ∈ ({0} ∪ (1...(𝑁 − 1)))))
134		ioran 997	. . . . . . . . . . . . . 14 ⊢ (¬ ((2nd ‘𝑧) = 0 ∨ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ↔ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
135		elun 4108	. . . . . . . . . . . . . . 15 ⊢ ((2nd ‘𝑧) ∈ ({0} ∪ (1...(𝑁 − 1))) ↔ ((2nd ‘𝑧) ∈ {0} ∨ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
136		fvex 6882	. . . . . . . . . . . . . . . . 17 ⊢ (2nd ‘𝑧) ∈ V
137	136	elsn 4599	. . . . . . . . . . . . . . . 16 ⊢ ((2nd ‘𝑧) ∈ {0} ↔ (2nd ‘𝑧) = 0)
138	137	orbi1i 924	. . . . . . . . . . . . . . 15 ⊢ (((2nd ‘𝑧) ∈ {0} ∨ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) ↔ ((2nd ‘𝑧) = 0 ∨ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
139	135, 138	bitri 277	. . . . . . . . . . . . . 14 ⊢ ((2nd ‘𝑧) ∈ ({0} ∪ (1...(𝑁 − 1))) ↔ ((2nd ‘𝑧) = 0 ∨ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
140	134, 139	xchnxbir 335	. . . . . . . . . . . . 13 ⊢ (¬ (2nd ‘𝑧) ∈ ({0} ∪ (1...(𝑁 − 1))) ↔ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))
141	133, 140	bitrdi 289	. . . . . . . . . . . 12 ⊢ (𝜑 → (¬ (2nd ‘𝑧) ∈ (0...(𝑁 − 1)) ↔ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))))
142	141	anbi2d 639	. . . . . . . . . . 11 ⊢ (𝜑 → (((2nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2nd ‘𝑧) ∈ (0...(𝑁 − 1))) ↔ ((2nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))))))
143		uncom 4113	. . . . . . . . . . . . . . . 16 ⊢ ((0...(𝑁 − 1)) ∪ {𝑁}) = ({𝑁} ∪ (0...(𝑁 − 1)))
144	143	difeq1i 4078	. . . . . . . . . . . . . . 15 ⊢ (((0...(𝑁 − 1)) ∪ {𝑁}) ∖ (0...(𝑁 − 1))) = (({𝑁} ∪ (0...(𝑁 − 1))) ∖ (0...(𝑁 − 1)))
145		difun2 4437	. . . . . . . . . . . . . . 15 ⊢ (({𝑁} ∪ (0...(𝑁 − 1))) ∖ (0...(𝑁 − 1))) = ({𝑁} ∖ (0...(𝑁 − 1)))
146	144, 145	eqtri 2787	. . . . . . . . . . . . . 14 ⊢ (((0...(𝑁 − 1)) ∪ {𝑁}) ∖ (0...(𝑁 − 1))) = ({𝑁} ∖ (0...(𝑁 − 1)))
147	1	nncnd 12228	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑁 ∈ ℂ)
148		npcan1 11614	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) + 1) = 𝑁)
149	147, 148	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((𝑁 − 1) + 1) = 𝑁)
150	1	nnnn0d 12544	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
151	150, 124	eleqtrdi 2874	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0))
152	149, 151	eqeltrd 2864	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ≥‘0))
153	12	nn0zd 12595	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
154		uzid 12856	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 − 1) ∈ ℤ → (𝑁 − 1) ∈ (ℤ≥‘(𝑁 − 1)))
155		peano2uz 12904	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘(𝑁 − 1)) → ((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑁 − 1)))
156	153, 154, 155	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑁 − 1)))
157	149, 156	eqeltrrd 2865	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑁 − 1)))
158		fzsplit2 13556	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑁 − 1) + 1) ∈ (ℤ≥‘0) ∧ 𝑁 ∈ (ℤ≥‘(𝑁 − 1))) → (0...𝑁) = ((0...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
159	152, 157, 158	syl2anc 593	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0...𝑁) = ((0...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)))
160	149	oveq1d 7413	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = (𝑁...𝑁))
161	1	nnzd 12596	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑁 ∈ ℤ)
162		fzsn 13573	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℤ → (𝑁...𝑁) = {𝑁})
163	161, 162	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝑁...𝑁) = {𝑁})
164	160, 163	eqtrd 2799	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (((𝑁 − 1) + 1)...𝑁) = {𝑁})
165	164	uneq2d 4123	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((0...(𝑁 − 1)) ∪ (((𝑁 − 1) + 1)...𝑁)) = ((0...(𝑁 − 1)) ∪ {𝑁}))
166	159, 165	eqtrd 2799	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0...𝑁) = ((0...(𝑁 − 1)) ∪ {𝑁}))
167	166	difeq1d 4081	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((0...𝑁) ∖ (0...(𝑁 − 1))) = (((0...(𝑁 − 1)) ∪ {𝑁}) ∖ (0...(𝑁 − 1))))
168		elfzle2 13535	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ (0...(𝑁 − 1)) → 𝑁 ≤ (𝑁 − 1))
169	15, 168	nsyl 140	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ¬ 𝑁 ∈ (0...(𝑁 − 1)))
170		incom 4163	. . . . . . . . . . . . . . . . 17 ⊢ ((0...(𝑁 − 1)) ∩ {𝑁}) = ({𝑁} ∩ (0...(𝑁 − 1)))
171	170	eqeq1i 2769	. . . . . . . . . . . . . . . 16 ⊢ (((0...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ({𝑁} ∩ (0...(𝑁 − 1))) = ∅)
172		disjsn 4672	. . . . . . . . . . . . . . . 16 ⊢ (((0...(𝑁 − 1)) ∩ {𝑁}) = ∅ ↔ ¬ 𝑁 ∈ (0...(𝑁 − 1)))
173		disj3 4410	. . . . . . . . . . . . . . . 16 ⊢ (({𝑁} ∩ (0...(𝑁 − 1))) = ∅ ↔ {𝑁} = ({𝑁} ∖ (0...(𝑁 − 1))))
174	171, 172, 173	3bitr3i 303	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑁 ∈ (0...(𝑁 − 1)) ↔ {𝑁} = ({𝑁} ∖ (0...(𝑁 − 1))))
175	169, 174	sylib 220	. . . . . . . . . . . . . 14 ⊢ (𝜑 → {𝑁} = ({𝑁} ∖ (0...(𝑁 − 1))))
176	146, 167, 175	3eqtr4a 2825	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((0...𝑁) ∖ (0...(𝑁 − 1))) = {𝑁})
177	176	eleq2d 2850	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2nd ‘𝑧) ∈ ((0...𝑁) ∖ (0...(𝑁 − 1))) ↔ (2nd ‘𝑧) ∈ {𝑁}))
178		eldif 3916	. . . . . . . . . . . 12 ⊢ ((2nd ‘𝑧) ∈ ((0...𝑁) ∖ (0...(𝑁 − 1))) ↔ ((2nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2nd ‘𝑧) ∈ (0...(𝑁 − 1))))
179	136	elsn 4599	. . . . . . . . . . . 12 ⊢ ((2nd ‘𝑧) ∈ {𝑁} ↔ (2nd ‘𝑧) = 𝑁)
180	177, 178, 179	3bitr3g 315	. . . . . . . . . . 11 ⊢ (𝜑 → (((2nd ‘𝑧) ∈ (0...𝑁) ∧ ¬ (2nd ‘𝑧) ∈ (0...(𝑁 − 1))) ↔ (2nd ‘𝑧) = 𝑁))
181	142, 180	bitr3d 283	. . . . . . . . . 10 ⊢ (𝜑 → (((2nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))) ↔ (2nd ‘𝑧) = 𝑁))
182	181	biimpd 231	. . . . . . . . 9 ⊢ (𝜑 → (((2nd ‘𝑧) ∈ (0...𝑁) ∧ (¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1)))) → (2nd ‘𝑧) = 𝑁))
183	182	expdimp 456	. . . . . . . 8 ⊢ ((𝜑 ∧ (2nd ‘𝑧) ∈ (0...𝑁)) → ((¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘𝑧) = 𝑁))
184	123, 183	sylan2 602	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((¬ (2nd ‘𝑧) = 0 ∧ ¬ (2nd ‘𝑧) ∈ (1...(𝑁 − 1))) → (2nd ‘𝑧) = 𝑁))
185	121, 184	mpan2d 704	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (¬ (2nd ‘𝑧) = 0 → (2nd ‘𝑧) = 𝑁))
186	1, 2, 3	poimirlem14 38138	. . . . . . . . . 10 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 𝑁)
187		fveqeq2 6878	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑠 → ((2nd ‘𝑧) = 𝑁 ↔ (2nd ‘𝑠) = 𝑁))
188	187	rmo4 3695	. . . . . . . . . 10 ⊢ (∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 𝑁 ↔ ∀𝑧 ∈ 𝑆 ∀𝑠 ∈ 𝑆 (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) → 𝑧 = 𝑠))
189	186, 188	sylib 220	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 ∀𝑠 ∈ 𝑆 (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) → 𝑧 = 𝑠))
190	189	r19.21bi 3256	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ∀𝑠 ∈ 𝑆 (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) → 𝑧 = 𝑠))
191	4	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑇 ∈ 𝑆)
192		fveqeq2 6878	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑇 → ((2nd ‘𝑠) = 𝑁 ↔ (2nd ‘𝑇) = 𝑁))
193	192	anbi2d 639	. . . . . . . . . 10 ⊢ (𝑠 = 𝑇 → (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) ↔ ((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑇) = 𝑁)))
194		eqeq2 2776	. . . . . . . . . 10 ⊢ (𝑠 = 𝑇 → (𝑧 = 𝑠 ↔ 𝑧 = 𝑇))
195	193, 194	imbi12d 346	. . . . . . . . 9 ⊢ (𝑠 = 𝑇 → ((((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) → 𝑧 = 𝑠) ↔ (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑇) = 𝑁) → 𝑧 = 𝑇)))
196	195	rspccv 3580	. . . . . . . 8 ⊢ (∀𝑠 ∈ 𝑆 (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑠) = 𝑁) → 𝑧 = 𝑠) → (𝑇 ∈ 𝑆 → (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑇) = 𝑁) → 𝑧 = 𝑇)))
197	190, 191, 196	sylc 65	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (((2nd ‘𝑧) = 𝑁 ∧ (2nd ‘𝑇) = 𝑁) → 𝑧 = 𝑇))
198	8, 197	mpan2d 704	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((2nd ‘𝑧) = 𝑁 → 𝑧 = 𝑇))
199	185, 198	syld 47	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (¬ (2nd ‘𝑧) = 0 → 𝑧 = 𝑇))
200	199	necon1ad 2976	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → (𝑧 ≠ 𝑇 → (2nd ‘𝑧) = 0))
201	200	ralrimiva 3156	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝑧 ≠ 𝑇 → (2nd ‘𝑧) = 0))
202	1, 2, 3	poimirlem13 38137	. . 3 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 0)
203		rmoim 3705	. . 3 ⊢ (∀𝑧 ∈ 𝑆 (𝑧 ≠ 𝑇 → (2nd ‘𝑧) = 0) → (∃*𝑧 ∈ 𝑆 (2nd ‘𝑧) = 0 → ∃*𝑧 ∈ 𝑆 𝑧 ≠ 𝑇))
204	201, 202, 203	sylc 65	. 2 ⊢ (𝜑 → ∃*𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)
205		reu5 3371	. 2 ⊢ (∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇 ↔ (∃𝑧 ∈ 𝑆 𝑧 ≠ 𝑇 ∧ ∃*𝑧 ∈ 𝑆 𝑧 ≠ 𝑇))
206	7, 204, 205	sylanbrc 592	1 ⊢ (𝜑 → ∃!𝑧 ∈ 𝑆 𝑧 ≠ 𝑇)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∨ wo 858   = wceq 1562   ∈ wcel 2144  {cab 2742   ≠ wne 2959  ∀wral 3078  ∃wrex 3088  ∃!wreu 3367  ∃*wrmo 3368  {crab 3416  ⦋csb 3854   ∖ cdif 3903   ∪ cun 3904   ∩ cin 3905   ⊆ wss 3906  ∅c0 4287  ifcif 4482  {csn 4584   class class class wbr 5102   ↦ cmpt 5183   × cxp 5647  ran crn 5650   “ cima 5652  ⟶wf 6519  –1-1-onto→wf1o 6522  ‘cfv 6523  (class class class)co 7398   ∘_f cof 7660  1^st c1st 7970  2^nd c2nd 7971   ↑_m cmap 8810  ℂcc 11073  0cc0 11075  1c1 11076   + caddc 11078   < clt 11218   ≤ cle 11219   − cmin 11416  ℕcn 12212  ℕ₀cn0 12483  ℤcz 12570  ℤ_≥cuz 12841  ...cfz 13514  ..^cfzo 13661

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-mpo 7403  df-of 7662  df-om 7849  df-1st 7972  df-2nd 7973  df-frecs 8264  df-wrecs 8295  df-recs 8344  df-rdg 8383  df-1o 8439  df-er 8680  df-map 8812  df-en 8930  df-dom 8931  df-sdom 8932  df-fin 8933  df-pnf 11220  df-mnf 11221  df-xr 11222  df-ltxr 11223  df-le 11224  df-sub 11418  df-neg 11419  df-nn 12213  df-n0 12484  df-z 12571  df-uz 12842  df-fz 13515  df-fzo 13662

This theorem is referenced by:  poimirlem22  38146