4sqlem11 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 4sqlem11		Structured version Visualization version GIF version

Theorem 4sqlem11 17002

Description: Lemma for 4sq 17011. Use the pigeonhole principle to show that the sets {𝑚↑2 ∣ 𝑚 ∈ (0...𝑁)} and {-1 − 𝑛↑2 ∣ 𝑛 ∈ (0...𝑁)} have a common element, mod 𝑃. (Contributed by Mario Carneiro, 15-Jul-2014.)

**Hypotheses**
Ref	Expression
4sq.1	⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ ∃𝑧 ∈ ℤ ∃𝑤 ∈ ℤ 𝑛 = (((𝑥↑2) + (𝑦↑2)) + ((𝑧↑2) + (𝑤↑2)))}
4sq.2	⊢ (𝜑 → 𝑁 ∈ ℕ)
4sq.3	⊢ (𝜑 → 𝑃 = ((2 · 𝑁) + 1))
4sq.4	⊢ (𝜑 → 𝑃 ∈ ℙ)
4sqlem11.5	⊢ 𝐴 = {𝑢 ∣ ∃𝑚 ∈ (0...𝑁)𝑢 = ((𝑚↑2) mod 𝑃)}
4sqlem11.6	⊢ 𝐹 = (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣))

**Assertion**
Ref	Expression
4sqlem11	⊢ (𝜑 → (𝐴 ∩ ran 𝐹) ≠ ∅)

Distinct variable groups: 𝑤,𝑛,𝑥,𝑦,𝑧 𝑣,𝑛,𝐴 𝑛,𝐹 𝑢,𝑛,𝑚,𝑣,𝑁 𝑃,𝑚,𝑛,𝑢,𝑣 𝜑,𝑚,𝑛,𝑢,𝑣 𝑆,𝑚,𝑛,𝑢,𝑣 Allowed substitution hints: 𝜑(𝑥,𝑦,𝑧,𝑤) 𝐴(𝑥,𝑦,𝑧,𝑤,𝑢,𝑚) 𝑃(𝑥,𝑦,𝑧,𝑤) 𝑆(𝑥,𝑦,𝑧,𝑤) 𝐹(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑚) 𝑁(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem 4sqlem11 Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fzfid 14024	. . . . . 6 ⊢ (𝜑 → (0...(𝑃 − 1)) ∈ Fin)
2		4sqlem11.5	. . . . . . . 8 ⊢ 𝐴 = {𝑢 ∣ ∃𝑚 ∈ (0...𝑁)𝑢 = ((𝑚↑2) mod 𝑃)}
3		elfzelz 13584	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ (0...𝑁) → 𝑚 ∈ ℤ)
4		zsqcl 14179	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℤ → (𝑚↑2) ∈ ℤ)
5	3, 4	syl 17	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ (0...𝑁) → (𝑚↑2) ∈ ℤ)
6		4sq.4	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ ℙ)
7		prmnn 16721	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
8	6, 7	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℕ)
9		zmodfz 13944	. . . . . . . . . . . 12 ⊢ (((𝑚↑2) ∈ ℤ ∧ 𝑃 ∈ ℕ) → ((𝑚↑2) mod 𝑃) ∈ (0...(𝑃 − 1)))
10	5, 8, 9	syl2anr 596	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...𝑁)) → ((𝑚↑2) mod 𝑃) ∈ (0...(𝑃 − 1)))
11		eleq1a 2839	. . . . . . . . . . 11 ⊢ (((𝑚↑2) mod 𝑃) ∈ (0...(𝑃 − 1)) → (𝑢 = ((𝑚↑2) mod 𝑃) → 𝑢 ∈ (0...(𝑃 − 1))))
12	10, 11	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ (0...𝑁)) → (𝑢 = ((𝑚↑2) mod 𝑃) → 𝑢 ∈ (0...(𝑃 − 1))))
13	12	rexlimdva 3161	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑚 ∈ (0...𝑁)𝑢 = ((𝑚↑2) mod 𝑃) → 𝑢 ∈ (0...(𝑃 − 1))))
14	13	abssdv 4091	. . . . . . . 8 ⊢ (𝜑 → {𝑢 ∣ ∃𝑚 ∈ (0...𝑁)𝑢 = ((𝑚↑2) mod 𝑃)} ⊆ (0...(𝑃 − 1)))
15	2, 14	eqsstrid 4057	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ (0...(𝑃 − 1)))
16		prmz 16722	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
17	6, 16	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 ∈ ℤ)
18		peano2zm 12686	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℤ → (𝑃 − 1) ∈ ℤ)
19	17, 18	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑃 − 1) ∈ ℤ)
20	19	zcnd 12748	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃 − 1) ∈ ℂ)
21	20	addlidd 11491	. . . . . . . . . . . 12 ⊢ (𝜑 → (0 + (𝑃 − 1)) = (𝑃 − 1))
22	21	oveq1d 7463	. . . . . . . . . . 11 ⊢ (𝜑 → ((0 + (𝑃 − 1)) − 𝑣) = ((𝑃 − 1) − 𝑣))
23	22	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((0 + (𝑃 − 1)) − 𝑣) = ((𝑃 − 1) − 𝑣))
24	15	sselda 4008	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → 𝑣 ∈ (0...(𝑃 − 1)))
25		fzrev3i 13651	. . . . . . . . . . 11 ⊢ (𝑣 ∈ (0...(𝑃 − 1)) → ((0 + (𝑃 − 1)) − 𝑣) ∈ (0...(𝑃 − 1)))
26	24, 25	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((0 + (𝑃 − 1)) − 𝑣) ∈ (0...(𝑃 − 1)))
27	23, 26	eqeltrrd 2845	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → ((𝑃 − 1) − 𝑣) ∈ (0...(𝑃 − 1)))
28		4sqlem11.6	. . . . . . . . 9 ⊢ 𝐹 = (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣))
29	27, 28	fmptd 7148	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶(0...(𝑃 − 1)))
30	29	frnd 6755	. . . . . . 7 ⊢ (𝜑 → ran 𝐹 ⊆ (0...(𝑃 − 1)))
31	15, 30	unssd 4215	. . . . . 6 ⊢ (𝜑 → (𝐴 ∪ ran 𝐹) ⊆ (0...(𝑃 − 1)))
32	1, 31	ssfid 9329	. . . . 5 ⊢ (𝜑 → (𝐴 ∪ ran 𝐹) ∈ Fin)
33		hashcl 14405	. . . . 5 ⊢ ((𝐴 ∪ ran 𝐹) ∈ Fin → (♯‘(𝐴 ∪ ran 𝐹)) ∈ ℕ₀)
34	32, 33	syl 17	. . . 4 ⊢ (𝜑 → (♯‘(𝐴 ∪ ran 𝐹)) ∈ ℕ₀)
35	34	nn0red 12614	. . 3 ⊢ (𝜑 → (♯‘(𝐴 ∪ ran 𝐹)) ∈ ℝ)
36	17	zred 12747	. . 3 ⊢ (𝜑 → 𝑃 ∈ ℝ)
37		ssdomg 9060	. . . . . 6 ⊢ ((0...(𝑃 − 1)) ∈ Fin → ((𝐴 ∪ ran 𝐹) ⊆ (0...(𝑃 − 1)) → (𝐴 ∪ ran 𝐹) ≼ (0...(𝑃 − 1))))
38	1, 31, 37	sylc 65	. . . . 5 ⊢ (𝜑 → (𝐴 ∪ ran 𝐹) ≼ (0...(𝑃 − 1)))
39		hashdom 14428	. . . . . 6 ⊢ (((𝐴 ∪ ran 𝐹) ∈ Fin ∧ (0...(𝑃 − 1)) ∈ Fin) → ((♯‘(𝐴 ∪ ran 𝐹)) ≤ (♯‘(0...(𝑃 − 1))) ↔ (𝐴 ∪ ran 𝐹) ≼ (0...(𝑃 − 1))))
40	32, 1, 39	syl2anc 583	. . . . 5 ⊢ (𝜑 → ((♯‘(𝐴 ∪ ran 𝐹)) ≤ (♯‘(0...(𝑃 − 1))) ↔ (𝐴 ∪ ran 𝐹) ≼ (0...(𝑃 − 1))))
41	38, 40	mpbird 257	. . . 4 ⊢ (𝜑 → (♯‘(𝐴 ∪ ran 𝐹)) ≤ (♯‘(0...(𝑃 − 1))))
42		fz01en 13612	. . . . . . 7 ⊢ (𝑃 ∈ ℤ → (0...(𝑃 − 1)) ≈ (1...𝑃))
43	17, 42	syl 17	. . . . . 6 ⊢ (𝜑 → (0...(𝑃 − 1)) ≈ (1...𝑃))
44		fzfid 14024	. . . . . . 7 ⊢ (𝜑 → (1...𝑃) ∈ Fin)
45		hashen 14396	. . . . . . 7 ⊢ (((0...(𝑃 − 1)) ∈ Fin ∧ (1...𝑃) ∈ Fin) → ((♯‘(0...(𝑃 − 1))) = (♯‘(1...𝑃)) ↔ (0...(𝑃 − 1)) ≈ (1...𝑃)))
46	1, 44, 45	syl2anc 583	. . . . . 6 ⊢ (𝜑 → ((♯‘(0...(𝑃 − 1))) = (♯‘(1...𝑃)) ↔ (0...(𝑃 − 1)) ≈ (1...𝑃)))
47	43, 46	mpbird 257	. . . . 5 ⊢ (𝜑 → (♯‘(0...(𝑃 − 1))) = (♯‘(1...𝑃)))
48	8	nnnn0d 12613	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
49		hashfz1 14395	. . . . . 6 ⊢ (𝑃 ∈ ℕ₀ → (♯‘(1...𝑃)) = 𝑃)
50	48, 49	syl 17	. . . . 5 ⊢ (𝜑 → (♯‘(1...𝑃)) = 𝑃)
51	47, 50	eqtrd 2780	. . . 4 ⊢ (𝜑 → (♯‘(0...(𝑃 − 1))) = 𝑃)
52	41, 51	breqtrd 5192	. . 3 ⊢ (𝜑 → (♯‘(𝐴 ∪ ran 𝐹)) ≤ 𝑃)
53	35, 36, 52	lensymd 11441	. 2 ⊢ (𝜑 → ¬ 𝑃 < (♯‘(𝐴 ∪ ran 𝐹)))
54	36	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → 𝑃 ∈ ℝ)
55	54	ltp1d 12225	. . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → 𝑃 < (𝑃 + 1))
56		4sq.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
57	56	nncnd 12309	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℂ)
58		1cnd 11285	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
59	57, 57, 58, 58	add4d 11518	. . . . . . . 8 ⊢ (𝜑 → ((𝑁 + 𝑁) + (1 + 1)) = ((𝑁 + 1) + (𝑁 + 1)))
60		4sq.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 = ((2 · 𝑁) + 1))
61	60	oveq1d 7463	. . . . . . . . 9 ⊢ (𝜑 → (𝑃 + 1) = (((2 · 𝑁) + 1) + 1))
62		2cn 12368	. . . . . . . . . . 11 ⊢ 2 ∈ ℂ
63		mulcl 11268	. . . . . . . . . . 11 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (2 · 𝑁) ∈ ℂ)
64	62, 57, 63	sylancr 586	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑁) ∈ ℂ)
65	64, 58, 58	addassd 11312	. . . . . . . . 9 ⊢ (𝜑 → (((2 · 𝑁) + 1) + 1) = ((2 · 𝑁) + (1 + 1)))
66	57	2timesd 12536	. . . . . . . . . 10 ⊢ (𝜑 → (2 · 𝑁) = (𝑁 + 𝑁))
67	66	oveq1d 7463	. . . . . . . . 9 ⊢ (𝜑 → ((2 · 𝑁) + (1 + 1)) = ((𝑁 + 𝑁) + (1 + 1)))
68	61, 65, 67	3eqtrd 2784	. . . . . . . 8 ⊢ (𝜑 → (𝑃 + 1) = ((𝑁 + 𝑁) + (1 + 1)))
69	10	ex 412	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝑚 ∈ (0...𝑁) → ((𝑚↑2) mod 𝑃) ∈ (0...(𝑃 − 1))))
70	8	adantr 480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑃 ∈ ℕ)
71	3	ad2antrl 727	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑚 ∈ ℤ)
72	71, 4	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚↑2) ∈ ℤ)
73		elfzelz 13584	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑢 ∈ (0...𝑁) → 𝑢 ∈ ℤ)
74	73	ad2antll 728	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑢 ∈ ℤ)
75		zsqcl 14179	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑢 ∈ ℤ → (𝑢↑2) ∈ ℤ)
76	74, 75	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑢↑2) ∈ ℤ)
77		moddvds 16313	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑃 ∈ ℕ ∧ (𝑚↑2) ∈ ℤ ∧ (𝑢↑2) ∈ ℤ) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) ↔ 𝑃 ∥ ((𝑚↑2) − (𝑢↑2))))
78	70, 72, 76, 77	syl3anc 1371	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) ↔ 𝑃 ∥ ((𝑚↑2) − (𝑢↑2))))
79	71	zcnd 12748	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑚 ∈ ℂ)
80	74	zcnd 12748	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑢 ∈ ℂ)
81		subsq 14259	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑚 ∈ ℂ ∧ 𝑢 ∈ ℂ) → ((𝑚↑2) − (𝑢↑2)) = ((𝑚 + 𝑢) · (𝑚 − 𝑢)))
82	79, 80, 81	syl2anc 583	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑚↑2) − (𝑢↑2)) = ((𝑚 + 𝑢) · (𝑚 − 𝑢)))
83	82	breq2d 5178	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ ((𝑚↑2) − (𝑢↑2)) ↔ 𝑃 ∥ ((𝑚 + 𝑢) · (𝑚 − 𝑢))))
84	6	adantr 480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑃 ∈ ℙ)
85	71, 74	zaddcld 12751	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 + 𝑢) ∈ ℤ)
86	71, 74	zsubcld 12752	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 − 𝑢) ∈ ℤ)
87		euclemma 16760	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑃 ∈ ℙ ∧ (𝑚 + 𝑢) ∈ ℤ ∧ (𝑚 − 𝑢) ∈ ℤ) → (𝑃 ∥ ((𝑚 + 𝑢) · (𝑚 − 𝑢)) ↔ (𝑃 ∥ (𝑚 + 𝑢) ∨ 𝑃 ∥ (𝑚 − 𝑢))))
88	84, 85, 86, 87	syl3anc 1371	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ ((𝑚 + 𝑢) · (𝑚 − 𝑢)) ↔ (𝑃 ∥ (𝑚 + 𝑢) ∨ 𝑃 ∥ (𝑚 − 𝑢))))
89	78, 83, 88	3bitrd 305	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) ↔ (𝑃 ∥ (𝑚 + 𝑢) ∨ 𝑃 ∥ (𝑚 − 𝑢))))
90	85	zred 12747	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 + 𝑢) ∈ ℝ)
91		2re 12367	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ 2 ∈ ℝ
92	56	nnred 12308	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → 𝑁 ∈ ℝ)
93		remulcl 11269	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (2 · 𝑁) ∈ ℝ)
94	91, 92, 93	sylancr 586	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → (2 · 𝑁) ∈ ℝ)
95	94	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (2 · 𝑁) ∈ ℝ)
96	84, 16	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑃 ∈ ℤ)
97	96	zred 12747	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑃 ∈ ℝ)
98	71	zred 12747	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑚 ∈ ℝ)
99	74	zred 12747	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑢 ∈ ℝ)
100	92	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑁 ∈ ℝ)
101		elfzle2 13588	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑚 ∈ (0...𝑁) → 𝑚 ≤ 𝑁)
102	101	ad2antrl 727	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑚 ≤ 𝑁)
103		elfzle2 13588	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑢 ∈ (0...𝑁) → 𝑢 ≤ 𝑁)
104	103	ad2antll 728	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑢 ≤ 𝑁)
105	98, 99, 100, 100, 102, 104	le2addd 11909	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 + 𝑢) ≤ (𝑁 + 𝑁))
106	57	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 𝑁 ∈ ℂ)
107	106	2timesd 12536	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (2 · 𝑁) = (𝑁 + 𝑁))
108	105, 107	breqtrrd 5194	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 + 𝑢) ≤ (2 · 𝑁))
109	94	ltp1d 12225	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → (2 · 𝑁) < ((2 · 𝑁) + 1))
110	109, 60	breqtrrd 5194	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝜑 → (2 · 𝑁) < 𝑃)
111	110	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (2 · 𝑁) < 𝑃)
112	90, 95, 97, 108, 111	lelttrd 11448	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 + 𝑢) < 𝑃)
113	90, 97	ltnled 11437	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑚 + 𝑢) < 𝑃 ↔ ¬ 𝑃 ≤ (𝑚 + 𝑢)))
114	112, 113	mpbid 232	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ¬ 𝑃 ≤ (𝑚 + 𝑢))
115	114	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → ¬ 𝑃 ≤ (𝑚 + 𝑢))
116	17	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 𝑃 ∈ ℤ)
117	85	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑚 + 𝑢) ∈ ℤ)
118		1red 11291	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 1 ∈ ℝ)
119		nn0abscl 15361	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑚 − 𝑢) ∈ ℤ → (abs‘(𝑚 − 𝑢)) ∈ ℕ₀)
120	86, 119	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 𝑢)) ∈ ℕ₀)
121	120	nn0red 12614	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 𝑢)) ∈ ℝ)
122	121	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ∈ ℝ)
123	117	zred 12747	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑚 + 𝑢) ∈ ℝ)
124	120	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ∈ ℕ₀)
125	124	nn0zd 12665	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ∈ ℤ)
126	86	zcnd 12748	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 − 𝑢) ∈ ℂ)
127	126	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑚 − 𝑢) ∈ ℂ)
128	79, 80	subeq0ad 11657	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑚 − 𝑢) = 0 ↔ 𝑚 = 𝑢))
129	128	necon3bid 2991	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑚 − 𝑢) ≠ 0 ↔ 𝑚 ≠ 𝑢))
130	129	biimpar 477	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑚 − 𝑢) ≠ 0)
131	127, 130	absrpcld 15497	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ∈ ℝ⁺)
132	131	rpgt0d 13102	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 0 < (abs‘(𝑚 − 𝑢)))
133		elnnz 12649	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((abs‘(𝑚 − 𝑢)) ∈ ℕ ↔ ((abs‘(𝑚 − 𝑢)) ∈ ℤ ∧ 0 < (abs‘(𝑚 − 𝑢))))
134	125, 132, 133	sylanbrc 582	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ∈ ℕ)
135	134	nnge1d 12341	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 1 ≤ (abs‘(𝑚 − 𝑢)))
136		0cnd 11283	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 0 ∈ ℂ)
137	79, 80, 136	abs3difd 15509	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 𝑢)) ≤ ((abs‘(𝑚 − 0)) + (abs‘(0 − 𝑢))))
138	79	subid1d 11636	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 − 0) = 𝑚)
139	138	fveq2d 6924	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 0)) = (abs‘𝑚))
140		elfzle1 13587	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑚 ∈ (0...𝑁) → 0 ≤ 𝑚)
141	140	ad2antrl 727	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 0 ≤ 𝑚)
142	98, 141	absidd 15471	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘𝑚) = 𝑚)
143	139, 142	eqtrd 2780	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 0)) = 𝑚)
144		0cn 11282	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ 0 ∈ ℂ
145		abssub 15375	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((0 ∈ ℂ ∧ 𝑢 ∈ ℂ) → (abs‘(0 − 𝑢)) = (abs‘(𝑢 − 0)))
146	144, 80, 145	sylancr 586	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(0 − 𝑢)) = (abs‘(𝑢 − 0)))
147	80	subid1d 11636	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑢 − 0) = 𝑢)
148	147	fveq2d 6924	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑢 − 0)) = (abs‘𝑢))
149		elfzle1 13587	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ (𝑢 ∈ (0...𝑁) → 0 ≤ 𝑢)
150	149	ad2antll 728	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → 0 ≤ 𝑢)
151	99, 150	absidd 15471	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘𝑢) = 𝑢)
152	146, 148, 151	3eqtrd 2784	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(0 − 𝑢)) = 𝑢)
153	143, 152	oveq12d 7466	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((abs‘(𝑚 − 0)) + (abs‘(0 − 𝑢))) = (𝑚 + 𝑢))
154	137, 153	breqtrd 5192	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (abs‘(𝑚 − 𝑢)) ≤ (𝑚 + 𝑢))
155	154	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (abs‘(𝑚 − 𝑢)) ≤ (𝑚 + 𝑢))
156	118, 122, 123, 135, 155	letrd 11447	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 1 ≤ (𝑚 + 𝑢))
157		elnnz1 12669	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑚 + 𝑢) ∈ ℕ ↔ ((𝑚 + 𝑢) ∈ ℤ ∧ 1 ≤ (𝑚 + 𝑢)))
158	117, 156, 157	sylanbrc 582	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑚 + 𝑢) ∈ ℕ)
159		dvdsle 16358	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑃 ∈ ℤ ∧ (𝑚 + 𝑢) ∈ ℕ) → (𝑃 ∥ (𝑚 + 𝑢) → 𝑃 ≤ (𝑚 + 𝑢)))
160	116, 158, 159	syl2anc 583	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑃 ∥ (𝑚 + 𝑢) → 𝑃 ≤ (𝑚 + 𝑢)))
161	115, 160	mtod 198	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → ¬ 𝑃 ∥ (𝑚 + 𝑢))
162	161	ex 412	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 ≠ 𝑢 → ¬ 𝑃 ∥ (𝑚 + 𝑢)))
163	162	necon4ad 2965	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ (𝑚 + 𝑢) → 𝑚 = 𝑢))
164		dvdsabsb 16324	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑃 ∈ ℤ ∧ (𝑚 − 𝑢) ∈ ℤ) → (𝑃 ∥ (𝑚 − 𝑢) ↔ 𝑃 ∥ (abs‘(𝑚 − 𝑢))))
165	96, 86, 164	syl2anc 583	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ (𝑚 − 𝑢) ↔ 𝑃 ∥ (abs‘(𝑚 − 𝑢))))
166		letr 11384	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑃 ∈ ℝ ∧ (abs‘(𝑚 − 𝑢)) ∈ ℝ ∧ (𝑚 + 𝑢) ∈ ℝ) → ((𝑃 ≤ (abs‘(𝑚 − 𝑢)) ∧ (abs‘(𝑚 − 𝑢)) ≤ (𝑚 + 𝑢)) → 𝑃 ≤ (𝑚 + 𝑢)))
167	97, 121, 90, 166	syl3anc 1371	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑃 ≤ (abs‘(𝑚 − 𝑢)) ∧ (abs‘(𝑚 − 𝑢)) ≤ (𝑚 + 𝑢)) → 𝑃 ≤ (𝑚 + 𝑢)))
168	154, 167	mpan2d 693	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ≤ (abs‘(𝑚 − 𝑢)) → 𝑃 ≤ (𝑚 + 𝑢)))
169	114, 168	mtod 198	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ¬ 𝑃 ≤ (abs‘(𝑚 − 𝑢)))
170	169	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → ¬ 𝑃 ≤ (abs‘(𝑚 − 𝑢)))
171	96	adantr 480	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → 𝑃 ∈ ℤ)
172		dvdsle 16358	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑃 ∈ ℤ ∧ (abs‘(𝑚 − 𝑢)) ∈ ℕ) → (𝑃 ∥ (abs‘(𝑚 − 𝑢)) → 𝑃 ≤ (abs‘(𝑚 − 𝑢))))
173	171, 134, 172	syl2anc 583	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → (𝑃 ∥ (abs‘(𝑚 − 𝑢)) → 𝑃 ≤ (abs‘(𝑚 − 𝑢))))
174	170, 173	mtod 198	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) ∧ 𝑚 ≠ 𝑢) → ¬ 𝑃 ∥ (abs‘(𝑚 − 𝑢)))
175	174	ex 412	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑚 ≠ 𝑢 → ¬ 𝑃 ∥ (abs‘(𝑚 − 𝑢))))
176	175	necon4ad 2965	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ (abs‘(𝑚 − 𝑢)) → 𝑚 = 𝑢))
177	165, 176	sylbid 240	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (𝑃 ∥ (𝑚 − 𝑢) → 𝑚 = 𝑢))
178	163, 177	jaod 858	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → ((𝑃 ∥ (𝑚 + 𝑢) ∨ 𝑃 ∥ (𝑚 − 𝑢)) → 𝑚 = 𝑢))
179	89, 178	sylbid 240	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) → 𝑚 = 𝑢))
180		oveq1 7455	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 = 𝑢 → (𝑚↑2) = (𝑢↑2))
181	180	oveq1d 7463	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑚 = 𝑢 → ((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃))
182	179, 181	impbid1 225	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁))) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) ↔ 𝑚 = 𝑢))
183	182	ex 412	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑚 ∈ (0...𝑁) ∧ 𝑢 ∈ (0...𝑁)) → (((𝑚↑2) mod 𝑃) = ((𝑢↑2) mod 𝑃) ↔ 𝑚 = 𝑢)))
184	69, 183	dom2lem 9052	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1→(0...(𝑃 − 1)))
185		f1f1orn 6873	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1→(0...(𝑃 − 1)) → (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)))
186	184, 185	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)))
187		eqid 2740	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)) = (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃))
188	187	rnmpt 5980	. . . . . . . . . . . . . . . . 17 ⊢ ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)) = {𝑢 ∣ ∃𝑚 ∈ (0...𝑁)𝑢 = ((𝑚↑2) mod 𝑃)}
189	2, 188	eqtr4i 2771	. . . . . . . . . . . . . . . 16 ⊢ 𝐴 = ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃))
190		f1oeq3 6852	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 = ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)) → ((𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→𝐴 ↔ (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃))))
191	189, 190	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→𝐴 ↔ (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→ran (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)))
192	186, 191	sylibr 234	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→𝐴)
193		ovex 7481	. . . . . . . . . . . . . . 15 ⊢ (0...𝑁) ∈ V
194	193	f1oen 9033	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ∈ (0...𝑁) ↦ ((𝑚↑2) mod 𝑃)):(0...𝑁)–1-1-onto→𝐴 → (0...𝑁) ≈ 𝐴)
195	192, 194	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0...𝑁) ≈ 𝐴)
196	195	ensymd 9065	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ≈ (0...𝑁))
197		ax-1cn 11242	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ ℂ
198		pncan 11542	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁)
199	57, 197, 198	sylancl 585	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
200	199	oveq2d 7464	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁))
201	56	nnnn0d 12613	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
202		peano2nn0 12593	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ₀)
203	201, 202	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ₀)
204	203	nn0zd 12665	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ)
205		fz01en 13612	. . . . . . . . . . . . . 14 ⊢ ((𝑁 + 1) ∈ ℤ → (0...((𝑁 + 1) − 1)) ≈ (1...(𝑁 + 1)))
206	204, 205	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) ≈ (1...(𝑁 + 1)))
207	200, 206	eqbrtrrd 5190	. . . . . . . . . . . 12 ⊢ (𝜑 → (0...𝑁) ≈ (1...(𝑁 + 1)))
208		entr 9066	. . . . . . . . . . . 12 ⊢ ((𝐴 ≈ (0...𝑁) ∧ (0...𝑁) ≈ (1...(𝑁 + 1))) → 𝐴 ≈ (1...(𝑁 + 1)))
209	196, 207, 208	syl2anc 583	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ≈ (1...(𝑁 + 1)))
210	1, 15	ssfid 9329	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ Fin)
211		fzfid 14024	. . . . . . . . . . . 12 ⊢ (𝜑 → (1...(𝑁 + 1)) ∈ Fin)
212		hashen 14396	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ (1...(𝑁 + 1)) ∈ Fin) → ((♯‘𝐴) = (♯‘(1...(𝑁 + 1))) ↔ 𝐴 ≈ (1...(𝑁 + 1))))
213	210, 211, 212	syl2anc 583	. . . . . . . . . . 11 ⊢ (𝜑 → ((♯‘𝐴) = (♯‘(1...(𝑁 + 1))) ↔ 𝐴 ≈ (1...(𝑁 + 1))))
214	209, 213	mpbird 257	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐴) = (♯‘(1...(𝑁 + 1))))
215		hashfz1 14395	. . . . . . . . . . 11 ⊢ ((𝑁 + 1) ∈ ℕ₀ → (♯‘(1...(𝑁 + 1))) = (𝑁 + 1))
216	203, 215	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘(1...(𝑁 + 1))) = (𝑁 + 1))
217	214, 216	eqtrd 2780	. . . . . . . . 9 ⊢ (𝜑 → (♯‘𝐴) = (𝑁 + 1))
218	27	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑣 ∈ 𝐴 → ((𝑃 − 1) − 𝑣) ∈ (0...(𝑃 − 1))))
219	20	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑘 ∈ 𝐴)) → (𝑃 − 1) ∈ ℂ)
220		fzssuz 13625	. . . . . . . . . . . . . . . . . . . 20 ⊢ (0...(𝑃 − 1)) ⊆ (ℤ_≥‘0)
221		uzssz 12924	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (ℤ_≥‘0) ⊆ ℤ
222		zsscn 12647	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ℤ ⊆ ℂ
223	221, 222	sstri 4018	. . . . . . . . . . . . . . . . . . . 20 ⊢ (ℤ_≥‘0) ⊆ ℂ
224	220, 223	sstri 4018	. . . . . . . . . . . . . . . . . . 19 ⊢ (0...(𝑃 − 1)) ⊆ ℂ
225	15, 224	sstrdi 4021	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
226	225	sselda 4008	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → 𝑣 ∈ ℂ)
227	226	adantrr 716	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑘 ∈ 𝐴)) → 𝑣 ∈ ℂ)
228	225	sselda 4008	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℂ)
229	228	adantrl 715	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑘 ∈ 𝐴)) → 𝑘 ∈ ℂ)
230	219, 227, 229	subcanad 11690	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐴 ∧ 𝑘 ∈ 𝐴)) → (((𝑃 − 1) − 𝑣) = ((𝑃 − 1) − 𝑘) ↔ 𝑣 = 𝑘))
231	230	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑣 ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → (((𝑃 − 1) − 𝑣) = ((𝑃 − 1) − 𝑘) ↔ 𝑣 = 𝑘)))
232	218, 231	dom2lem 9052	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣)):𝐴–1-1→(0...(𝑃 − 1)))
233		f1eq1 6812	. . . . . . . . . . . . . 14 ⊢ (𝐹 = (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣)) → (𝐹:𝐴–1-1→(0...(𝑃 − 1)) ↔ (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣)):𝐴–1-1→(0...(𝑃 − 1))))
234	28, 233	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (𝐹:𝐴–1-1→(0...(𝑃 − 1)) ↔ (𝑣 ∈ 𝐴 ↦ ((𝑃 − 1) − 𝑣)):𝐴–1-1→(0...(𝑃 − 1)))
235	232, 234	sylibr 234	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝐴–1-1→(0...(𝑃 − 1)))
236		f1f1orn 6873	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴–1-1→(0...(𝑃 − 1)) → 𝐹:𝐴–1-1-onto→ran 𝐹)
237	235, 236	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→ran 𝐹)
238	210, 237	hasheqf1od 14402	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐴) = (♯‘ran 𝐹))
239	238, 217	eqtr3d 2782	. . . . . . . . 9 ⊢ (𝜑 → (♯‘ran 𝐹) = (𝑁 + 1))
240	217, 239	oveq12d 7466	. . . . . . . 8 ⊢ (𝜑 → ((♯‘𝐴) + (♯‘ran 𝐹)) = ((𝑁 + 1) + (𝑁 + 1)))
241	59, 68, 240	3eqtr4d 2790	. . . . . . 7 ⊢ (𝜑 → (𝑃 + 1) = ((♯‘𝐴) + (♯‘ran 𝐹)))
242	241	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → (𝑃 + 1) = ((♯‘𝐴) + (♯‘ran 𝐹)))
243	210	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → 𝐴 ∈ Fin)
244	1, 30	ssfid 9329	. . . . . . . 8 ⊢ (𝜑 → ran 𝐹 ∈ Fin)
245	244	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → ran 𝐹 ∈ Fin)
246		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → (𝐴 ∩ ran 𝐹) = ∅)
247		hashun 14431	. . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ ran 𝐹 ∈ Fin ∧ (𝐴 ∩ ran 𝐹) = ∅) → (♯‘(𝐴 ∪ ran 𝐹)) = ((♯‘𝐴) + (♯‘ran 𝐹)))
248	243, 245, 246, 247	syl3anc 1371	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → (♯‘(𝐴 ∪ ran 𝐹)) = ((♯‘𝐴) + (♯‘ran 𝐹)))
249	242, 248	eqtr4d 2783	. . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → (𝑃 + 1) = (♯‘(𝐴 ∪ ran 𝐹)))
250	55, 249	breqtrd 5192	. . . 4 ⊢ ((𝜑 ∧ (𝐴 ∩ ran 𝐹) = ∅) → 𝑃 < (♯‘(𝐴 ∪ ran 𝐹)))
251	250	ex 412	. . 3 ⊢ (𝜑 → ((𝐴 ∩ ran 𝐹) = ∅ → 𝑃 < (♯‘(𝐴 ∪ ran 𝐹))))
252	251	necon3bd 2960	. 2 ⊢ (𝜑 → (¬ 𝑃 < (♯‘(𝐴 ∪ ran 𝐹)) → (𝐴 ∩ ran 𝐹) ≠ ∅))
253	53, 252	mpd 15	1 ⊢ (𝜑 → (𝐴 ∩ ran 𝐹) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 846 = wceq 1537 ∈ wcel 2108 {cab 2717 ≠ wne 2946 ∃wrex 3076 ∪ cun 3974 ∩ cin 3975 ⊆ wss 3976 ∅c0 4352 class class class wbr 5166 ↦ cmpt 5249 ran crn 5701 –1-1→wf1 6570 –1-1-onto→wf1o 6572 ‘cfv 6573 (class class class)co 7448 ≈ cen 9000 ≼ cdom 9001 Fincfn 9003 ℂcc 11182 ℝcr 11183 0cc0 11184 1c1 11185 + caddc 11187 · cmul 11189 < clt 11324 ≤ cle 11325 − cmin 11520 ℕcn 12293 2c2 12348 ℕ₀cn0 12553 ℤcz 12639 ℤ_≥cuz 12903 ...cfz 13567 mod cmo 13920 ↑cexp 14112 ♯chash 14379 abscabs 15283 ∥ cdvds 16302 ℙcprime 16718

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-oadd 8526 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-inf 9512 df-dju 9970 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-n0 12554 df-xnn0 12626 df-z 12640 df-uz 12904 df-rp 13058 df-fz 13568 df-fl 13843 df-mod 13921 df-seq 14053 df-exp 14113 df-hash 14380 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-dvds 16303 df-gcd 16541 df-prm 16719

This theorem is referenced by: 4sqlem12 17003

W3C validator