divalglemeunn - Intuitionistic Logic Explorer

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

Theorem divalglemeunn 12607

Description: Lemma for divalg 12610. 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 12604	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
2		nfv 1577	. . . . . 6 ⊢ Ⅎ𝑞((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ))
3		nfre1 2585	. . . . . . 7 ⊢ Ⅎ𝑞∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))
4		nfv 1577	. . . . . . 7 ⊢ Ⅎ𝑞 𝑟 = 𝑠
5	3, 4	nfim 1621	. . . . . 6 ⊢ Ⅎ𝑞(∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)
6		oveq1 6057	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑡 → (𝑞 · 𝐷) = (𝑡 · 𝐷))
7	6	oveq1d 6065	. . . . . . . . . . 11 ⊢ (𝑞 = 𝑡 → ((𝑞 · 𝐷) + 𝑠) = ((𝑡 · 𝐷) + 𝑠))
8	7	eqeq2d 2244	. . . . . . . . . 10 ⊢ (𝑞 = 𝑡 → (𝑁 = ((𝑞 · 𝐷) + 𝑠) ↔ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
9	8	3anbi3d 1355	. . . . . . . . 9 ⊢ (𝑞 = 𝑡 → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))))
10	9	cbvrexv 2779	. . . . . . . 8 ⊢ (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) ↔ ∃𝑡 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)))
11		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑞 < 𝑡)
12		simplr 529	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → 𝐷 ∈ ℕ)
13	12	ad4antr 494	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ)
14		simplrl 537	. . . . . . . . . . . . . . 15 ⊢ ((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) → 𝑟 ∈ ℤ)
15	14	ad3antrrr 492	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 ∈ ℤ)
16		simplrr 538	. . . . . . . . . . . . . . 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 529	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑡 ∈ ℤ)
21		simpr1 1030	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑠)
22		simpr2 1031	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑟 < (abs‘𝐷))
23	22	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < (abs‘𝐷))
24	13	nnred 9250	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℝ)
25	13	nnnn0d 9553	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝐷 ∈ ℕ₀)
26	25	nn0ge0d 9556	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝐷)
27	24, 26	absidd 11852	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (abs‘𝐷) = 𝐷)
28	23, 27	breqtrd 4135	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 < 𝐷)
29		simpr3 1032	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
30	29	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑞 · 𝐷) + 𝑟))
31		simpr3 1032	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑁 = ((𝑡 · 𝐷) + 𝑠))
32	30, 31	eqtr3d 2267	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑞 · 𝐷) + 𝑟) = ((𝑡 · 𝐷) + 𝑠))
33	13, 15, 17, 19, 20, 21, 28, 32	divalglemnqt 12606	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑞 < 𝑡)
34	33	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → ¬ 𝑞 < 𝑡)
35	11, 34	pm2.21dd 625	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 < 𝑡) → 𝑟 = 𝑠)
36	13	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝐷 ∈ ℕ)
37	36	nnzd 9699	. . . . . . . . . . . 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 12605	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑞 = 𝑡) → 𝑟 = 𝑠)
45		simpr 110	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑡 < 𝑞)
46		simpr1 1030	. . . . . . . . . . . . . . 15 ⊢ (((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) → 0 ≤ 𝑟)
47	46	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 0 ≤ 𝑟)
48		simpr2 1031	. . . . . . . . . . . . . . 15 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < (abs‘𝐷))
49	48, 27	breqtrd 4135	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑠 < 𝐷)
50	31, 30	eqtr3d 2267	. . . . . . . . . . . . . 14 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ((𝑡 · 𝐷) + 𝑠) = ((𝑞 · 𝐷) + 𝑟))
51	13, 17, 15, 20, 19, 47, 49, 50	divalglemnqt 12606	. . . . . . . . . . . . 13 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → ¬ 𝑡 < 𝑞)
52	51	adantr 276	. . . . . . . . . . . 12 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → ¬ 𝑡 < 𝑞)
53	45, 52	pm2.21dd 625	. . . . . . . . . . 11 ⊢ ((((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) ∧ 𝑡 < 𝑞) → 𝑟 = 𝑠)
54		ztri3or 9620	. . . . . . . . . . . 12 ⊢ ((𝑞 ∈ ℤ ∧ 𝑡 ∈ ℤ) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
55	19, 20, 54	syl2anc 411	. . . . . . . . . . 11 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → (𝑞 < 𝑡 ∨ 𝑞 = 𝑡 ∨ 𝑡 < 𝑞))
56	35, 44, 53, 55	mpjao3dan 1344	. . . . . . . . . 10 ⊢ (((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) ∧ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠))) → 𝑟 = 𝑠)
57	56	ex 115	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) ∧ 𝑞 ∈ ℤ) ∧ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) ∧ 𝑡 ∈ ℤ) → ((0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑡 · 𝐷) + 𝑠)) → 𝑟 = 𝑠))
58	57	rexlimdva 2660	. . . . . . . 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 2657	. . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) → (∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠)) → 𝑟 = 𝑠)))
62	61	impd 254	. . . 4 ⊢ (((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) ∧ (𝑟 ∈ ℤ ∧ 𝑠 ∈ ℤ)) → ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
63	62	ralrimivva 2624	. . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
64		breq2 4113	. . . . . 6 ⊢ (𝑟 = 𝑠 → (0 ≤ 𝑟 ↔ 0 ≤ 𝑠))
65		breq1 4112	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑟 < (abs‘𝐷) ↔ 𝑠 < (abs‘𝐷)))
66		oveq2 6058	. . . . . . 7 ⊢ (𝑟 = 𝑠 → ((𝑞 · 𝐷) + 𝑟) = ((𝑞 · 𝐷) + 𝑠))
67	66	eqeq2d 2244	. . . . . 6 ⊢ (𝑟 = 𝑠 → (𝑁 = ((𝑞 · 𝐷) + 𝑟) ↔ 𝑁 = ((𝑞 · 𝐷) + 𝑠)))
68	64, 65, 67	3anbi123d 1349	. . . . 5 ⊢ (𝑟 = 𝑠 → ((0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
69	68	rexbidv 2543	. . . 4 ⊢ (𝑟 = 𝑠 → (∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))))
70	69	rmo4 3010	. . 3 ⊢ (∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∀𝑟 ∈ ℤ ∀𝑠 ∈ ℤ ((∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ∧ ∃𝑞 ∈ ℤ (0 ≤ 𝑠 ∧ 𝑠 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑠))) → 𝑟 = 𝑠))
71	63, 70	sylibr 134	. 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃*𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)))
72		reu5 2762	. 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 1004 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∀wral 2520 ∃wrex 2521 ∃!wreu 2522 ∃*wrmo 2523 class class class wbr 4109 ‘cfv 5352 (class class class)co 6050 0cc0 8127 + caddc 8130 · cmul 8132 < clt 8308 ≤ cle 8309 ℕcn 9237 ℤcz 9577 abscabs 11682

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-mulrcl 8226 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-precex 8237 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243 ax-pre-mulgt0 8244 ax-pre-mulext 8245 ax-arch 8246

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-reap 8849 df-ap 8856 df-div 8947 df-inn 9238 df-2 9296 df-n0 9497 df-z 9578 df-uz 9854 df-q 9952 df-rp 9987 df-fl 10630 df-mod 10685 df-seqfrec 10810 df-exp 10901 df-cj 11527 df-re 11528 df-im 11529 df-rsqrt 11683 df-abs 11684

This theorem is referenced by: divalg 12610

W3C validator