divalglemeunn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > divalglemeunn		GIF version

Theorem divalglemeunn 11880

Description: Lemma for divalg 11883. Uniqueness for a positive denominator. (Contributed by Jim Kingdon, 4-Dec-2021.)

**Assertion**
Ref	Expression
divalglemeunn	⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))

Distinct variable groups: 𝐷,𝑞,𝑟 𝑁,𝑞,𝑟

Proof of Theorem divalglemeunn Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		divalglemnn 11877	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
2		nfv 1521	. . . . . 6 ⊢ Ⅎ𝑞((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ))
3		nfre1 2513	. . . . . . 7 ⊢ Ⅎ𝑞∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))
4		nfv 1521	. . . . . . 7 ⊢ Ⅎ𝑞 𝑟 = 𝑠
5	3, 4	nfim 1565	. . . . . 6 ⊢ Ⅎ𝑞(∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)
6		oveq1 5860	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑡 → (𝑞 · 𝐷) = (𝑡 · 𝐷))
7	6	oveq1d 5868	. . . . . . . . . . 11 ⊢ (𝑞 = 𝑡 → ((𝑞 · 𝐷) + 𝑠) = ((𝑡 · 𝐷) + 𝑠))
8	7	eqeq2d 2182	. . . . . . . . . 10 ⊢ (𝑞 = 𝑡 → (𝑁 = ((𝑞 · 𝐷) + 𝑠) ↔ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
9	8	3anbi3d 1313	. . . . . . . . 9 ⊢ (𝑞 = 𝑡 → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))))
10	9	cbvrexv 2697	. . . . . . . 8 ⊢ (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ ∃𝑡 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
11		simpr 109	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑞 < 𝑡)
12		simplr 525	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → 𝐷 ∈ ℕ)
13	12	ad4antr 491	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ)
14		simplrl 530	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑟 ∈ ℤ)
15	14	ad3antrrr 489	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 ∈ ℤ)
16		simplrr 531	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑠 ∈ ℤ)
17	16	ad3antrrr 489	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 ∈ ℤ)
18		simpr 109	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑞 ∈ ℤ)
19	18	ad3antrrr 489	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑞 ∈ ℤ)
20		simplr 525	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑡 ∈ ℤ)
21		simpr1 998	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑠)
22		simpr2 999	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑟 < (abs‘𝐷))
23	22	ad2antrr 485	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < (abs‘𝐷))
24	13	nnred 8891	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℝ)
25	13	nnnn0d 9188	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ₀)
26	25	nn0ge0d 9191	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝐷)
27	24, 26	absidd 11131	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (abs‘𝐷) = 𝐷)
28	23, 27	breqtrd 4015	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < 𝐷)
29		simpr3 1000	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
30	29	ad2antrr 485	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
31		simpr3 1000	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑡 · 𝐷) + 𝑠))
32	30, 31	eqtr3d 2205	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑞 · 𝐷) + 𝑟) = ((𝑡 · 𝐷) + 𝑠))
33	13, 15, 17, 19, 20, 21, 28, 32	divalglemnqt 11879	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑞 < 𝑡)
34	33	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → ¬ 𝑞 < 𝑡)
35	11, 34	pm2.21dd 615	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑟 = 𝑠)
36	13	adantr 274	. . . . . . . . . . . . 13 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝐷 ∈ ℕ)
37	36	nnzd 9333	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝐷 ∈ ℤ)
38	15	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑟 ∈ ℤ)
39	17	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑠 ∈ ℤ)
40	19	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑞 ∈ ℤ)
41	20	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑡 ∈ ℤ)
42		simpr 109	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑞 = 𝑡)
43	32	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → ((𝑞 · 𝐷) + 𝑟) = ((𝑡 · 𝐷) + 𝑠))
44	37, 38, 39, 40, 41, 42, 43	divalglemqt 11878	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑟 = 𝑠)
45		simpr 109	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑡 < 𝑞)
46		simpr1 998	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 0 ≤ 𝑟)
47	46	ad2antrr 485	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑟)
48		simpr2 999	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < (abs‘𝐷))
49	48, 27	breqtrd 4015	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < 𝐷)
50	31, 30	eqtr3d 2205	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑡 · 𝐷) + 𝑠) = ((𝑞 · 𝐷) + 𝑟))
51	13, 17, 15, 20, 19, 47, 49, 50	divalglemnqt 11879	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑡 < 𝑞)
52	51	adantr 274	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → ¬ 𝑡 < 𝑞)
53	45, 52	pm2.21dd 615	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑟 = 𝑠)
54		ztri3or 9255	. . . . . . . . . . . 12 ⊢ ((𝑞 ∈ ℤ ∧ 𝑡 ∈ ℤ) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
55	19, 20, 54	syl2anc 409	. . . . . . . . . . 11 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
56	35, 44, 53, 55	mpjao3dan 1302	. . . . . . . . . 10 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 = 𝑠)
57	56	ex 114	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
58	57	rexlimdva 2587	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → (∃𝑡 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
59	10, 58	syl5bi 151	. . . . . . 7 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
60	59	exp31 362	. . . . . 6 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → (𝑞 ∈ ℤ → ((0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))))
61	2, 5, 60	rexlimd 2584	. . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)))
62	61	impd 252	. . . 4 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
63	62	ralrimivva 2552	. . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
64		breq2 3993	. . . . . 6 ⊢ (𝑟 = 𝑠 → (0 ≤ 𝑟 ↔ 0 ≤ 𝑠))
65		breq1 3992	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑟 < (abs‘𝐷) ↔ 𝑠 < (abs‘𝐷)))
66		oveq2 5861	. . . . . . 7 ⊢ (𝑟 = 𝑠 → ((𝑞 · 𝐷) + 𝑟) = ((𝑞 · 𝐷) + 𝑠))
67	66	eqeq2d 2182	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑁 = ((𝑞 · 𝐷) + 𝑟) ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑠)))
68	64, 65, 67	3anbi123d 1307	. . . . 5 ⊢ (𝑟 = 𝑠 → ((0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
69	68	rexbidv 2471	. . . 4 ⊢ (𝑟 = 𝑠 → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
70	69	rmo4 2923	. . 3 ⊢ (∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
71	63, 70	sylibr 133	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
72		reu5 2682	. 2 ⊢ (∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ (∃𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))))
73	1, 71, 72	sylanbrc 415	1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∨ w3o 972 ∧ w3a 973 = wceq 1348 ∈ wcel 2141 ∀wral 2448 ∃wrex 2449 ∃!wreu 2450 ∃*wrmo 2451 class class class wbr 3989 ‘cfv 5198 (class class class)co 5853 0cc0 7774 + caddc 7777 · cmul 7779 < clt 7954 ≤ cle 7955 ℕcn 8878 ℤcz 9212 abscabs 10961

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-iinf 4572 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 ax-pre-mulext 7892 ax-arch 7893

This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-tr 4088 df-id 4278 df-po 4281 df-iso 4282 df-iord 4351 df-on 4353 df-ilim 4354 df-suc 4356 df-iom 4575 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-recs 6284 df-frec 6370 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 df-div 8590 df-inn 8879 df-2 8937 df-n0 9136 df-z 9213 df-uz 9488 df-q 9579 df-rp 9611 df-fl 10226 df-mod 10279 df-seqfrec 10402 df-exp 10476 df-cj 10806 df-re 10807 df-im 10808 df-rsqrt 10962 df-abs 10963

This theorem is referenced by: divalg 11883

W3C validator