| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divalg2 | Structured version Visualization version GIF version | ||
| Description: The division algorithm (theorem) for a positive divisor. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| divalg2 | ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℕ0 (𝑟 < 𝐷 ∧ 𝐷 ∥ (𝑁 − 𝑟))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 12627 | . . . 4 ⊢ (𝐷 ∈ ℕ → 𝐷 ∈ ℤ) | |
| 2 | nnne0 12285 | . . . 4 ⊢ (𝐷 ∈ ℕ → 𝐷 ≠ 0) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝐷 ∈ ℕ → (𝐷 ∈ ℤ ∧ 𝐷 ≠ 0)) |
| 4 | divalg 16483 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → ∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟))) | |
| 5 | divalgb 16484 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (∃!𝑟 ∈ ℤ ∃𝑞 ∈ ℤ (0 ≤ 𝑟 ∧ 𝑟 < (abs‘𝐷) ∧ 𝑁 = ((𝑞 · 𝐷) + 𝑟)) ↔ ∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟)))) | |
| 6 | 4, 5 | mpbid 235 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → ∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟))) |
| 7 | 6 | 3expb 1138 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ (𝐷 ∈ ℤ ∧ 𝐷 ≠ 0)) → ∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟))) |
| 8 | 3, 7 | sylan2 605 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟))) |
| 9 | nnre 12255 | . . . . . . 7 ⊢ (𝐷 ∈ ℕ → 𝐷 ∈ ℝ) | |
| 10 | nnnn0 12526 | . . . . . . . 8 ⊢ (𝐷 ∈ ℕ → 𝐷 ∈ ℕ0) | |
| 11 | 10 | nn0ge0d 12583 | . . . . . . 7 ⊢ (𝐷 ∈ ℕ → 0 ≤ 𝐷) |
| 12 | 9, 11 | absidd 15498 | . . . . . 6 ⊢ (𝐷 ∈ ℕ → (abs‘𝐷) = 𝐷) |
| 13 | 12 | breq2d 5123 | . . . . 5 ⊢ (𝐷 ∈ ℕ → (𝑟 < (abs‘𝐷) ↔ 𝑟 < 𝐷)) |
| 14 | 13 | anbi1d 643 | . . . 4 ⊢ (𝐷 ∈ ℕ → ((𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟)) ↔ (𝑟 < 𝐷 ∧ 𝐷 ∥ (𝑁 − 𝑟)))) |
| 15 | 14 | reubidv 3387 | . . 3 ⊢ (𝐷 ∈ ℕ → (∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟)) ↔ ∃!𝑟 ∈ ℕ0 (𝑟 < 𝐷 ∧ 𝐷 ∥ (𝑁 − 𝑟)))) |
| 16 | 15 | adantl 487 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → (∃!𝑟 ∈ ℕ0 (𝑟 < (abs‘𝐷) ∧ 𝐷 ∥ (𝑁 − 𝑟)) ↔ ∃!𝑟 ∈ ℕ0 (𝑟 < 𝐷 ∧ 𝐷 ∥ (𝑁 − 𝑟)))) |
| 17 | 8, 16 | mpbid 235 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝐷 ∈ ℕ) → ∃!𝑟 ∈ ℕ0 (𝑟 < 𝐷 ∧ 𝐷 ∥ (𝑁 − 𝑟))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ∃wrex 3091 ∃!wreu 3369 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 0cc0 11115 + caddc 11118 · cmul 11120 < clt 11258 ≤ cle 11259 − cmin 11456 ℕcn 12248 ℕ0cn0 12519 ℤcz 12606 abscabs 15309 ∥ cdvds 16332 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-sup 9409 df-inf 9410 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-rp 13033 df-fz 13552 df-seq 14056 df-exp 14116 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-dvds 16333 |
| This theorem is used by: divalgmod 16486 ndvdssub 16489 |
| Copyright terms: Public domain | W3C validator |