divalglemeunn - Intuitionistic Logic Explorer

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

Theorem divalglemeunn 11926

Description: Lemma for divalg 11929. 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 11923	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
2		nfv 1528	. . . . . 6 ⊢ Ⅎ𝑞((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ))
3		nfre1 2520	. . . . . . 7 ⊢ Ⅎ𝑞∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))
4		nfv 1528	. . . . . . 7 ⊢ Ⅎ𝑞 𝑟 = 𝑠
5	3, 4	nfim 1572	. . . . . 6 ⊢ Ⅎ𝑞(∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)
6		oveq1 5882	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑡 → (𝑞 · 𝐷) = (𝑡 · 𝐷))
7	6	oveq1d 5890	. . . . . . . . . . 11 ⊢ (𝑞 = 𝑡 → ((𝑞 · 𝐷) + 𝑠) = ((𝑡 · 𝐷) + 𝑠))
8	7	eqeq2d 2189	. . . . . . . . . 10 ⊢ (𝑞 = 𝑡 → (𝑁 = ((𝑞 · 𝐷) + 𝑠) ↔ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
9	8	3anbi3d 1318	. . . . . . . . 9 ⊢ (𝑞 = 𝑡 → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))))
10	9	cbvrexv 2705	. . . . . . . 8 ⊢ (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ ∃𝑡 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
11		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑞 < 𝑡)
12		simplr 528	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → 𝐷 ∈ ℕ)
13	12	ad4antr 494	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ)
14		simplrl 535	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑟 ∈ ℤ)
15	14	ad3antrrr 492	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 ∈ ℤ)
16		simplrr 536	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑠 ∈ ℤ)
17	16	ad3antrrr 492	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 ∈ ℤ)
18		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑞 ∈ ℤ)
19	18	ad3antrrr 492	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑞 ∈ ℤ)
20		simplr 528	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑡 ∈ ℤ)
21		simpr1 1003	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑠)
22		simpr2 1004	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑟 < (abs‘𝐷))
23	22	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < (abs‘𝐷))
24	13	nnred 8932	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℝ)
25	13	nnnn0d 9229	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ₀)
26	25	nn0ge0d 9232	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝐷)
27	24, 26	absidd 11176	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (abs‘𝐷) = 𝐷)
28	23, 27	breqtrd 4030	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < 𝐷)
29		simpr3 1005	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
30	29	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
31		simpr3 1005	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑡 · 𝐷) + 𝑠))
32	30, 31	eqtr3d 2212	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑞 · 𝐷) + 𝑟) = ((𝑡 · 𝐷) + 𝑠))
33	13, 15, 17, 19, 20, 21, 28, 32	divalglemnqt 11925	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑞 < 𝑡)
34	33	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → ¬ 𝑞 < 𝑡)
35	11, 34	pm2.21dd 620	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑟 = 𝑠)
36	13	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝐷 ∈ ℕ)
37	36	nnzd 9374	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝐷 ∈ ℤ)
38	15	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑟 ∈ ℤ)
39	17	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑠 ∈ ℤ)
40	19	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑞 ∈ ℤ)
41	20	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑡 ∈ ℤ)
42		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑞 = 𝑡)
43	32	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → ((𝑞 · 𝐷) + 𝑟) = ((𝑡 · 𝐷) + 𝑠))
44	37, 38, 39, 40, 41, 42, 43	divalglemqt 11924	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑟 = 𝑠)
45		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑡 < 𝑞)
46		simpr1 1003	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 0 ≤ 𝑟)
47	46	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑟)
48		simpr2 1004	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < (abs‘𝐷))
49	48, 27	breqtrd 4030	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < 𝐷)
50	31, 30	eqtr3d 2212	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑡 · 𝐷) + 𝑠) = ((𝑞 · 𝐷) + 𝑟))
51	13, 17, 15, 20, 19, 47, 49, 50	divalglemnqt 11925	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑡 < 𝑞)
52	51	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → ¬ 𝑡 < 𝑞)
53	45, 52	pm2.21dd 620	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑟 = 𝑠)
54		ztri3or 9296	. . . . . . . . . . . 12 ⊢ ((𝑞 ∈ ℤ ∧ 𝑡 ∈ ℤ) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
55	19, 20, 54	syl2anc 411	. . . . . . . . . . 11 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
56	35, 44, 53, 55	mpjao3dan 1307	. . . . . . . . . 10 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 = 𝑠)
57	56	ex 115	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
58	57	rexlimdva 2594	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → (∃𝑡 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
59	10, 58	biimtrid 152	. . . . . . 7 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
60	59	exp31 364	. . . . . 6 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → (𝑞 ∈ ℤ → ((0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))))
61	2, 5, 60	rexlimd 2591	. . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)))
62	61	impd 254	. . . 4 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
63	62	ralrimivva 2559	. . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
64		breq2 4008	. . . . . 6 ⊢ (𝑟 = 𝑠 → (0 ≤ 𝑟 ↔ 0 ≤ 𝑠))
65		breq1 4007	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑟 < (abs‘𝐷) ↔ 𝑠 < (abs‘𝐷)))
66		oveq2 5883	. . . . . . 7 ⊢ (𝑟 = 𝑠 → ((𝑞 · 𝐷) + 𝑟) = ((𝑞 · 𝐷) + 𝑠))
67	66	eqeq2d 2189	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑁 = ((𝑞 · 𝐷) + 𝑟) ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑠)))
68	64, 65, 67	3anbi123d 1312	. . . . 5 ⊢ (𝑟 = 𝑠 → ((0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
69	68	rexbidv 2478	. . . 4 ⊢ (𝑟 = 𝑠 → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
70	69	rmo4 2931	. . 3 ⊢ (∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
71	63, 70	sylibr 134	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
72		reu5 2690	. 2 ⊢ (∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ (∃𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))))
73	1, 71, 72	sylanbrc 417	1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ w3o 977 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ∃wrex 2456 ∃!wreu 2457 ∃*wrmo 2458 class class class wbr 4004 ‘cfv 5217 (class class class)co 5875 0cc0 7811 + caddc 7814 · cmul 7816 < clt 7992 ≤ cle 7993 ℕcn 8919 ℤcz 9253 abscabs 11006

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4119 ax-sep 4122 ax-nul 4130 ax-pow 4175 ax-pr 4210 ax-un 4434 ax-setind 4537 ax-iinf 4588 ax-cnex 7902 ax-resscn 7903 ax-1cn 7904 ax-1re 7905 ax-icn 7906 ax-addcl 7907 ax-addrcl 7908 ax-mulcl 7909 ax-mulrcl 7910 ax-addcom 7911 ax-mulcom 7912 ax-addass 7913 ax-mulass 7914 ax-distr 7915 ax-i2m1 7916 ax-0lt1 7917 ax-1rid 7918 ax-0id 7919 ax-rnegex 7920 ax-precex 7921 ax-cnre 7922 ax-pre-ltirr 7923 ax-pre-ltwlin 7924 ax-pre-lttrn 7925 ax-pre-apti 7926 ax-pre-ltadd 7927 ax-pre-mulgt0 7928 ax-pre-mulext 7929 ax-arch 7930

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2740 df-sbc 2964 df-csb 3059 df-dif 3132 df-un 3134 df-in 3136 df-ss 3143 df-nul 3424 df-if 3536 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-int 3846 df-iun 3889 df-br 4005 df-opab 4066 df-mpt 4067 df-tr 4103 df-id 4294 df-po 4297 df-iso 4298 df-iord 4367 df-on 4369 df-ilim 4370 df-suc 4372 df-iom 4591 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-rn 4638 df-res 4639 df-ima 4640 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-fo 5223 df-f1o 5224 df-fv 5225 df-riota 5831 df-ov 5878 df-oprab 5879 df-mpo 5880 df-1st 6141 df-2nd 6142 df-recs 6306 df-frec 6392 df-pnf 7994 df-mnf 7995 df-xr 7996 df-ltxr 7997 df-le 7998 df-sub 8130 df-neg 8131 df-reap 8532 df-ap 8539 df-div 8630 df-inn 8920 df-2 8978 df-n0 9177 df-z 9254 df-uz 9529 df-q 9620 df-rp 9654 df-fl 10270 df-mod 10323 df-seqfrec 10446 df-exp 10520 df-cj 10851 df-re 10852 df-im 10853 df-rsqrt 11007 df-abs 11008

This theorem is referenced by: divalg 11929

W3C validator