| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvdsdc | GIF version | ||
| Description: Divisibility is decidable. (Contributed by Jim Kingdon, 14-Nov-2021.) |
| Ref | Expression |
|---|---|
| dvdsdc | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ∥ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ) | |
| 2 | simpl 109 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℕ) | |
| 3 | 1, 2 | zmodcld 10804 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod 𝑀) ∈ ℕ0) |
| 4 | 3 | nn0zd 9778 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod 𝑀) ∈ ℤ) |
| 5 | 0z 9667 | . . 3 ⊢ 0 ∈ ℤ | |
| 6 | zdceq 9732 | . . 3 ⊢ (((𝑁 mod 𝑀) ∈ ℤ ∧ 0 ∈ ℤ) → DECID (𝑁 mod 𝑀) = 0) | |
| 7 | 4, 5, 6 | sylancl 417 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID (𝑁 mod 𝑀) = 0) |
| 8 | dvdsval3 12584 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ (𝑁 mod 𝑀) = 0)) | |
| 9 | 8 | dcbid 850 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (DECID 𝑀 ∥ 𝑁 ↔ DECID (𝑁 mod 𝑀) = 0)) |
| 10 | 7, 9 | mpbird 167 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ∥ 𝑁) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 DECID wdc 846 = wceq 1402 ∈ wcel 2209 class class class wbr 4131 (class class class)co 6088 0cc0 8186 ℕcn 9314 ℤcz 9656 mod cmo 10781 ∥ cdvds 12580 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-precex 8296 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 ax-pre-mulgt0 8303 ax-pre-mulext 8304 ax-arch 8305 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-po 4443 df-iso 4444 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-reap 8912 df-ap 8919 df-div 9012 df-inn 9315 df-n0 9576 df-z 9657 df-q 10037 df-rp 10073 df-fl 10723 df-mod 10782 df-dvds 12581 |
| This theorem is used by: zdvdsdc 12605 bitsdc 12740 gcdsupex 12760 gcdsupcl 12761 prmind2 12924 prmdc 12934 divgcdodd 12948 euclemma 12951 pwbdvdslemn 12970 hashdvds 13029 fermltl 13042 dvdsfi 13047 hashgcdeq 13048 odzcllem 13051 odzdvds 13054 fldivp1 13157 prmpwdvds 13164 infpnlem2 13169 prmdvdsfi 16255 lgslem4 16339 lgsval 16340 lgsfvalg 16341 lgsfcl2 16342 lgsval2lem 16346 lgsmod 16362 lgsdir2 16369 lgsne0 16374 gausslemma2dlem1a 16394 lgsquadlemofi 16412 lgsquadlem2 16414 m1lgs 16421 konigsberglem5 16950 |
| Copyright terms: Public domain | W3C validator |