divalglem9 - Metamath Proof Explorer

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

Theorem divalglem9 16449

Description: Lemma for divalg 16451. (Contributed by Paul Chapman, 21-Mar-2011.) (Revised by AV, 2-Oct-2020.)

**Hypotheses**
Ref	Expression
divalglem8.1	⊢ 𝑁 ∈ ℤ
divalglem8.2	⊢ 𝐷 ∈ ℤ
divalglem8.3	⊢ 𝐷 ≠ 0
divalglem8.4	⊢ 𝑆 = {𝑟 ∈ ℕ₀ ∣ 𝐷 ∥ (𝑁 − 𝑟)}
divalglem9.5	⊢ 𝑅 = inf(𝑆, ℝ, < )

**Assertion**
Ref	Expression
divalglem9	⊢ ∃!𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷)

Distinct variable groups: 𝐷,𝑟,𝑥 𝑁,𝑟,𝑥 𝑥,𝑆 𝑥,𝑅 Allowed substitution hints: 𝑅(𝑟) 𝑆(𝑟)

Proof of Theorem divalglem9 Dummy variables 𝑘 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		divalglem9.5	. . . 4 ⊢ 𝑅 = inf(𝑆, ℝ, < )
2		divalglem8.1	. . . . 5 ⊢ 𝑁 ∈ ℤ
3		divalglem8.2	. . . . 5 ⊢ 𝐷 ∈ ℤ
4		divalglem8.3	. . . . 5 ⊢ 𝐷 ≠ 0
5		divalglem8.4	. . . . 5 ⊢ 𝑆 = {𝑟 ∈ ℕ₀ ∣ 𝐷 ∥ (𝑁 − 𝑟)}
6	2, 3, 4, 5	divalglem2 16443	. . . 4 ⊢ inf(𝑆, ℝ, < ) ∈ 𝑆
7	1, 6	eqeltri 2840	. . 3 ⊢ 𝑅 ∈ 𝑆
8	2, 3, 4, 5, 1	divalglem5 16445	. . . 4 ⊢ (0 ≤ 𝑅 ∧ 𝑅 < (abs‘𝐷))
9	8	simpri 485	. . 3 ⊢ 𝑅 < (abs‘𝐷)
10		breq1 5169	. . . 4 ⊢ (𝑥 = 𝑅 → (𝑥 < (abs‘𝐷) ↔ 𝑅 < (abs‘𝐷)))
11	10	rspcev 3635	. . 3 ⊢ ((𝑅 ∈ 𝑆 ∧ 𝑅 < (abs‘𝐷)) → ∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷))
12	7, 9, 11	mp2an 691	. 2 ⊢ ∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷)
13		oveq2 7456	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑥 → (𝑁 − 𝑟) = (𝑁 − 𝑥))
14	13	breq2d 5178	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑥 → (𝐷 ∥ (𝑁 − 𝑟) ↔ 𝐷 ∥ (𝑁 − 𝑥)))
15	14, 5	elrab2 3711	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ ℕ₀ ∧ 𝐷 ∥ (𝑁 − 𝑥)))
16	15	simplbi 497	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ ℕ₀)
17	16	nn0zd 12665	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ ℤ)
18		oveq2 7456	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑦 → (𝑁 − 𝑟) = (𝑁 − 𝑦))
19	18	breq2d 5178	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑦 → (𝐷 ∥ (𝑁 − 𝑟) ↔ 𝐷 ∥ (𝑁 − 𝑦)))
20	19, 5	elrab2 3711	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑆 ↔ (𝑦 ∈ ℕ₀ ∧ 𝐷 ∥ (𝑁 − 𝑦)))
21	20	simplbi 497	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ℕ₀)
22	21	nn0zd 12665	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ℤ)
23		zsubcl 12685	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑁 − 𝑥) ∈ ℤ)
24	2, 23	mpan 689	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → (𝑁 − 𝑥) ∈ ℤ)
25		zsubcl 12685	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑁 − 𝑦) ∈ ℤ)
26	2, 25	mpan 689	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℤ → (𝑁 − 𝑦) ∈ ℤ)
27	24, 26	anim12i 612	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ))
28	17, 22, 27	syl2an 595	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ))
29	15	simprbi 496	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑆 → 𝐷 ∥ (𝑁 − 𝑥))
30	20	simprbi 496	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑆 → 𝐷 ∥ (𝑁 − 𝑦))
31	29, 30	anim12i 612	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)))
32		dvds2sub 16339	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ ℤ ∧ (𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ) → ((𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦))))
33	3, 32	mp3an1 1448	. . . . . . . . . 10 ⊢ (((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ) → ((𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦))))
34	28, 31, 33	sylc 65	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
35		zcn 12644	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ)
36		zcn 12644	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ)
37	2	zrei 12645	. . . . . . . . . . . . . . . . 17 ⊢ 𝑁 ∈ ℝ
38	37	recni 11304	. . . . . . . . . . . . . . . 16 ⊢ 𝑁 ∈ ℂ
39	38	subidi 11607	. . . . . . . . . . . . . . 15 ⊢ (𝑁 − 𝑁) = 0
40	39	oveq1i 7458	. . . . . . . . . . . . . 14 ⊢ ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = (0 − (𝑥 − 𝑦))
41		0cn 11282	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℂ
42		subsub2 11564	. . . . . . . . . . . . . . 15 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
43	41, 42	mp3an1 1448	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
44	40, 43	eqtrid 2792	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
45		sub4 11581	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
46	38, 38, 45	mpanl12 701	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
47		subcl 11535	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑦 − 𝑥) ∈ ℂ)
48	47	ancoms 458	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑦 − 𝑥) ∈ ℂ)
49	48	addlidd 11491	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 + (𝑦 − 𝑥)) = (𝑦 − 𝑥))
50	44, 46, 49	3eqtr3d 2788	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
51	35, 36, 50	syl2an 595	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
52	17, 22, 51	syl2an 595	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
53	52	breq2d 5178	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦)) ↔ 𝐷 ∥ (𝑦 − 𝑥)))
54	34, 53	mpbid 232	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐷 ∥ (𝑦 − 𝑥))
55		zsubcl 12685	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑦 − 𝑥) ∈ ℤ)
56	55	ancoms 458	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑦 − 𝑥) ∈ ℤ)
57		absdvdsb 16323	. . . . . . . . . 10 ⊢ ((𝐷 ∈ ℤ ∧ (𝑦 − 𝑥) ∈ ℤ) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
58	3, 56, 57	sylancr 586	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
59	17, 22, 58	syl2an 595	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
60	54, 59	mpbid 232	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (abs‘𝐷) ∥ (𝑦 − 𝑥))
61		nnabscl 15374	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ)
62	3, 4, 61	mp2an 691	. . . . . . . . . 10 ⊢ (abs‘𝐷) ∈ ℕ
63	62	nnzi 12667	. . . . . . . . 9 ⊢ (abs‘𝐷) ∈ ℤ
64		divides 16304	. . . . . . . . 9 ⊢ (((abs‘𝐷) ∈ ℤ ∧ (𝑦 − 𝑥) ∈ ℤ) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
65	63, 56, 64	sylancr 586	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
66	17, 22, 65	syl2an 595	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
67	60, 66	mpbid 232	. . . . . 6 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥))
68	67	adantr 480	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥))
69	2, 3, 4, 5	divalglem8 16448	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → (𝑘 ∈ ℤ → ((𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥) → 𝑥 = 𝑦)))
70	69	rexlimdv 3159	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → (∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥) → 𝑥 = 𝑦))
71	68, 70	mpd 15	. . . 4 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → 𝑥 = 𝑦)
72	71	ex 412	. . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦))
73	72	rgen2 3205	. 2 ⊢ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦)
74		breq1 5169	. . 3 ⊢ (𝑥 = 𝑦 → (𝑥 < (abs‘𝐷) ↔ 𝑦 < (abs‘𝐷)))
75	74	reu4 3753	. 2 ⊢ (∃!𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷) ↔ (∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦)))
76	12, 73, 75	mpbir2an 710	1 ⊢ ∃!𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∀wral 3067 ∃wrex 3076 ∃!wreu 3386 {crab 3443 class class class wbr 5166 ‘cfv 6573 (class class class)co 7448 infcinf 9510 ℂcc 11182 ℝcr 11183 0cc0 11184 + caddc 11187 · cmul 11189 < clt 11324 ≤ cle 11325 − cmin 11520 ℕcn 12293 ℕ₀cn0 12553 ℤcz 12639 abscabs 15283 ∥ cdvds 16302

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-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-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-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-sup 9511 df-inf 9512 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-z 12640 df-uz 12904 df-rp 13058 df-fz 13568 df-seq 14053 df-exp 14113 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-dvds 16303

This theorem is referenced by: divalglem10 16450

W3C validator