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 16495

Description: Lemma for divalg 16497. (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 16489	. . . 4 ⊢ inf(𝑆, ℝ, < ) ∈ 𝑆
7	1, 6	eqeltri 2858	. . 3 ⊢ 𝑅 ∈ 𝑆
8	2, 3, 4, 5, 1	divalglem5 16491	. . . 4 ⊢ (0 ≤ 𝑅 ∧ 𝑅 < (abs‘𝐷))
9	8	simpri 491	. . 3 ⊢ 𝑅 < (abs‘𝐷)
10		breq1 5110	. . . 4 ⊢ (𝑥 = 𝑅 → (𝑥 < (abs‘𝐷) ↔ 𝑅 < (abs‘𝐷)))
11	10	rspcev 3579	. . 3 ⊢ ((𝑅 ∈ 𝑆 ∧ 𝑅 < (abs‘𝐷)) → ∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷))
12	7, 9, 11	mp2an 705	. 2 ⊢ ∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷)
13		oveq2 7424	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑥 → (𝑁 − 𝑟) = (𝑁 − 𝑥))
14	13	breq2d 5119	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑥 → (𝐷 ∥ (𝑁 − 𝑟) ↔ 𝐷 ∥ (𝑁 − 𝑥)))
15	14, 5	elrab2 3652	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ ℕ₀ ∧ 𝐷 ∥ (𝑁 − 𝑥)))
16	15	simplbi 502	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ ℕ₀)
17	16	nn0zd 12643	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ ℤ)
18		oveq2 7424	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑦 → (𝑁 − 𝑟) = (𝑁 − 𝑦))
19	18	breq2d 5119	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑦 → (𝐷 ∥ (𝑁 − 𝑟) ↔ 𝐷 ∥ (𝑁 − 𝑦)))
20	19, 5	elrab2 3652	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑆 ↔ (𝑦 ∈ ℕ₀ ∧ 𝐷 ∥ (𝑁 − 𝑦)))
21	20	simplbi 502	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ℕ₀)
22	21	nn0zd 12643	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ℤ)
23		zsubcl 12663	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑁 − 𝑥) ∈ ℤ)
24	2, 23	mpan 703	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → (𝑁 − 𝑥) ∈ ℤ)
25		zsubcl 12663	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑁 − 𝑦) ∈ ℤ)
26	2, 25	mpan 703	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℤ → (𝑁 − 𝑦) ∈ ℤ)
27	24, 26	anim12i 625	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ))
28	17, 22, 27	syl2an 608	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ))
29	15	simprbi 503	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑆 → 𝐷 ∥ (𝑁 − 𝑥))
30	20	simprbi 503	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑆 → 𝐷 ∥ (𝑁 − 𝑦))
31	29, 30	anim12i 625	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)))
32		dvds2sub 16385	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ ℤ ∧ (𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ) → ((𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦))))
33	3, 32	mp3an1 1477	. . . . . . . . . 10 ⊢ (((𝑁 − 𝑥) ∈ ℤ ∧ (𝑁 − 𝑦) ∈ ℤ) → ((𝐷 ∥ (𝑁 − 𝑥) ∧ 𝐷 ∥ (𝑁 − 𝑦)) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦))))
34	28, 31, 33	sylc 66	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
35		zcn 12623	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ)
36		zcn 12623	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ)
37	2	zrei 12624	. . . . . . . . . . . . . . . . 17 ⊢ 𝑁 ∈ ℝ
38	37	recni 11250	. . . . . . . . . . . . . . . 16 ⊢ 𝑁 ∈ ℂ
39	38	subidi 11556	. . . . . . . . . . . . . . 15 ⊢ (𝑁 − 𝑁) = 0
40	39	oveq1i 7426	. . . . . . . . . . . . . 14 ⊢ ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = (0 − (𝑥 − 𝑦))
41		0cn 11225	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℂ
42		subsub2 11513	. . . . . . . . . . . . . . 15 ⊢ ((0 ∈ ℂ ∧ 𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
43	41, 42	mp3an1 1477	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
44	40, 43	eqtrid 2809	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = (0 + (𝑦 − 𝑥)))
45		sub4 11530	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℂ ∧ 𝑁 ∈ ℂ) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
46	38, 38, 45	mpanl12 715	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑁) − (𝑥 − 𝑦)) = ((𝑁 − 𝑥) − (𝑁 − 𝑦)))
47		subcl 11483	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑦 − 𝑥) ∈ ℂ)
48	47	ancoms 464	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑦 − 𝑥) ∈ ℂ)
49	48	addlidd 11438	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (0 + (𝑦 − 𝑥)) = (𝑦 − 𝑥))
50	44, 46, 49	3eqtr3d 2805	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
51	35, 36, 50	syl2an 608	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
52	17, 22, 51	syl2an 608	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑁 − 𝑥) − (𝑁 − 𝑦)) = (𝑦 − 𝑥))
53	52	breq2d 5119	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ ((𝑁 − 𝑥) − (𝑁 − 𝑦)) ↔ 𝐷 ∥ (𝑦 − 𝑥)))
54	34, 53	mpbid 235	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → 𝐷 ∥ (𝑦 − 𝑥))
55		zsubcl 12663	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (𝑦 − 𝑥) ∈ ℤ)
56	55	ancoms 464	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑦 − 𝑥) ∈ ℤ)
57		absdvdsb 16368	. . . . . . . . . 10 ⊢ ((𝐷 ∈ ℤ ∧ (𝑦 − 𝑥) ∈ ℤ) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
58	3, 56, 57	sylancr 599	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
59	17, 22, 58	syl2an 608	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝐷 ∥ (𝑦 − 𝑥) ↔ (abs‘𝐷) ∥ (𝑦 − 𝑥)))
60	54, 59	mpbid 235	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (abs‘𝐷) ∥ (𝑦 − 𝑥))
61		nnabscl 15415	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ)
62	3, 4, 61	mp2an 705	. . . . . . . . . 10 ⊢ (abs‘𝐷) ∈ ℕ
63	62	nnzi 12645	. . . . . . . . 9 ⊢ (abs‘𝐷) ∈ ℤ
64		divides 16348	. . . . . . . . 9 ⊢ (((abs‘𝐷) ∈ ℤ ∧ (𝑦 − 𝑥) ∈ ℤ) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
65	63, 56, 64	sylancr 599	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
66	17, 22, 65	syl2an 608	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((abs‘𝐷) ∥ (𝑦 − 𝑥) ↔ ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥)))
67	60, 66	mpbid 235	. . . . . 6 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥))
68	67	adantr 486	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → ∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥))
69	2, 3, 4, 5	divalglem8 16494	. . . . . 6 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → (𝑘 ∈ ℤ → ((𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥) → 𝑥 = 𝑦)))
70	69	rexlimdv 3163	. . . . 5 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → (∃𝑘 ∈ ℤ (𝑘 · (abs‘𝐷)) = (𝑦 − 𝑥) → 𝑥 = 𝑦))
71	68, 70	mpd 16	. . . 4 ⊢ (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) ∧ (𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷))) → 𝑥 = 𝑦)
72	71	ex 418	. . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦))
73	72	rgen2 3204	. 2 ⊢ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦)
74		breq1 5110	. . 3 ⊢ (𝑥 = 𝑦 → (𝑥 < (abs‘𝐷) ↔ 𝑦 < (abs‘𝐷)))
75	74	reu4 3692	. 2 ⊢ (∃!𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷) ↔ (∃𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 < (abs‘𝐷) ∧ 𝑦 < (abs‘𝐷)) → 𝑥 = 𝑦)))
76	12, 73, 75	mpbir2an 724	1 ⊢ ∃!𝑥 ∈ 𝑆 𝑥 < (abs‘𝐷)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ∃wrex 3088 ∃!wreu 3365 {crab 3414 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 infcinf 9414 ℂcc 11125 ℝcr 11126 0cc0 11127 + caddc 11130 · cmul 11132 < clt 11270 ≤ cle 11271 − cmin 11468 ℕcn 12260 ℕ₀cn0 12531 ℤcz 12618 abscabs 15323 ∥ cdvds 16346

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13045 df-fz 13564 df-seq 14068 df-exp 14128 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-dvds 16347

This theorem is used by: divalglem10 16496

W3C validator