| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mod0 | Structured version Visualization version GIF version | ||
| Description: 𝐴 mod 𝐵 is zero iff 𝐴 is evenly divisible by 𝐵. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Fan Zheng, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| mod0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | modval 13871 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 mod 𝐵) = (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 2 | 1 | eqeq1d 2758 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0)) |
| 3 | recn 11153 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | 3 | adantr 483 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐴 ∈ ℂ) |
| 5 | rpre 12992 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 6 | 5 | adantl 484 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐵 ∈ ℝ) |
| 7 | refldivcl 13823 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℝ) | |
| 8 | 6, 7 | remulcld 11202 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℝ) |
| 9 | 8 | recnd 11200 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℂ) |
| 10 | 4, 9 | subeq0ad 11542 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0 ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 11 | 2, 10 | bitrd 281 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 12 | 7 | recnd 11200 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℂ) |
| 13 | rpcnne0 13002 | . . . . . 6 ⊢ (𝐵 ∈ ℝ+ → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 14 | 13 | adantl 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) |
| 15 | divmul2 11839 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (⌊‘(𝐴 / 𝐵)) ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 16 | 4, 12, 14, 15 | syl3anc 1386 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 17 | eqcom 2763 | . . . 4 ⊢ ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵)) | |
| 18 | 16, 17 | bitr3di 288 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 19 | 11, 18 | bitrd 281 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 20 | rerpdivcl 13015 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ) | |
| 21 | flidz 13810 | . . 3 ⊢ ((𝐴 / 𝐵) ∈ ℝ → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 22 | 20, 21 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| 23 | 19, 22 | bitrd 281 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 ‘cfv 6510 (class class class)co 7385 ℂcc 11061 ℝcr 11062 0cc0 11063 · cmul 11068 − cmin 11404 / cdiv 11834 ℤcz 12558 ℝ+crp 12983 ⌊cfl 13790 mod cmo 13869 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 ax-pre-sup 11141 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-sup 9378 df-inf 9379 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-div 11835 df-nn 12201 df-n0 12472 df-z 12559 df-uz 12830 df-rp 12984 df-fl 13792 df-mod 13870 |
| This theorem is referenced by: mulmod0 13877 negmod0 13878 modid0 13897 2txmodxeq0 13934 addmodlteq 13949 dvdsval3 16266 mod2eq1n2dvds 16357 elqaalem2 26354 elqaalem3 26355 sineq0 26559 pellexlem6 43359 sineq0ALT 45460 oddfl 45805 dirker2re 46614 dirkerdenne0 46615 dirkertrigeqlem3 46622 dirkertrigeq 46623 dirkercncflem1 46625 dirkercncflem2 46626 dirkercncflem4 46628 fourierdlem24 46653 fourierswlem 46752 mod0mul 47904 dfeven3 48228 dfodd4 48229 dignn0fr 49171 digexp 49177 0dig2nn0e 49182 dignn0flhalflem1 49185 |
| Copyright terms: Public domain | W3C validator |