![]() |
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 10344 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod 𝑀) ∈ ℕ0) |
4 | 3 | nn0zd 9372 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑁 mod 𝑀) ∈ ℤ) |
5 | 0z 9263 | . . 3 ⊢ 0 ∈ ℤ | |
6 | zdceq 9327 | . . 3 ⊢ (((𝑁 mod 𝑀) ∈ ℤ ∧ 0 ∈ ℤ) → DECID (𝑁 mod 𝑀) = 0) | |
7 | 4, 5, 6 | sylancl 413 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID (𝑁 mod 𝑀) = 0) |
8 | dvdsval3 11797 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ (𝑁 mod 𝑀) = 0)) | |
9 | 8 | dcbid 838 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (DECID 𝑀 ∥ 𝑁 ↔ DECID (𝑁 mod 𝑀) = 0)) |
10 | 7, 9 | mpbird 167 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ∥ 𝑁) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 DECID wdc 834 = wceq 1353 ∈ wcel 2148 class class class wbr 4003 (class class class)co 5874 0cc0 7810 ℕcn 8918 ℤcz 9252 mod cmo 10321 ∥ cdvds 11793 |
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-sep 4121 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 |
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 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-id 4293 df-po 4296 df-iso 4297 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-reap 8531 df-ap 8538 df-div 8629 df-inn 8919 df-n0 9176 df-z 9253 df-q 9619 df-rp 9653 df-fl 10269 df-mod 10322 df-dvds 11794 |
This theorem is referenced by: zdvdsdc 11818 gcdsupex 11957 gcdsupcl 11958 prmind2 12119 prmdc 12129 divgcdodd 12142 euclemma 12145 pw2dvdslemn 12164 hashdvds 12220 fermltl 12233 hashgcdeq 12238 phisum 12239 odzcllem 12241 odzdvds 12244 fldivp1 12345 prmpwdvds 12352 infpnlem2 12357 lgslem4 14340 lgsval 14341 lgsfvalg 14342 lgsfcl2 14343 lgsval2lem 14347 lgsmod 14363 lgsdir2 14370 lgsne0 14375 m1lgs 14388 |
Copyright terms: Public domain | W3C validator |