| 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 13819 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 mod 𝐵) = (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 2 | 1 | eqeq1d 2739 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0)) |
| 3 | recn 11117 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | 3 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐴 ∈ ℂ) |
| 5 | rpre 12940 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 6 | 5 | adantl 481 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐵 ∈ ℝ) |
| 7 | refldivcl 13771 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℝ) | |
| 8 | 6, 7 | remulcld 11164 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℝ) |
| 9 | 8 | recnd 11162 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℂ) |
| 10 | 4, 9 | subeq0ad 11504 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0 ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 11 | 2, 10 | bitrd 279 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 12 | 7 | recnd 11162 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℂ) |
| 13 | rpcnne0 12950 | . . . . . 6 ⊢ (𝐵 ∈ ℝ+ → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 14 | 13 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) |
| 15 | divmul2 11802 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (⌊‘(𝐴 / 𝐵)) ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 16 | 4, 12, 14, 15 | syl3anc 1374 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 17 | eqcom 2744 | . . . 4 ⊢ ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵)) | |
| 18 | 16, 17 | bitr3di 286 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 19 | 11, 18 | bitrd 279 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 20 | rerpdivcl 12963 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ) | |
| 21 | flidz 13758 | . . 3 ⊢ ((𝐴 / 𝐵) ∈ ℝ → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 22 | 20, 21 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| 23 | 19, 22 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ‘cfv 6490 (class class class)co 7358 ℂcc 11025 ℝcr 11026 0cc0 11027 · cmul 11032 − cmin 11366 / cdiv 11796 ℤcz 12513 ℝ+crp 12931 ⌊cfl 13738 mod cmo 13817 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-sup 9346 df-inf 9347 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12164 df-n0 12427 df-z 12514 df-uz 12778 df-rp 12932 df-fl 13740 df-mod 13818 |
| This theorem is referenced by: mulmod0 13825 negmod0 13826 modid0 13845 2txmodxeq0 13882 addmodlteq 13897 dvdsval3 16214 mod2eq1n2dvds 16305 elqaalem2 26299 elqaalem3 26300 sineq0 26504 pellexlem6 43277 sineq0ALT 45378 oddfl 45726 dirker2re 46535 dirkerdenne0 46536 dirkertrigeqlem3 46543 dirkertrigeq 46544 dirkercncflem1 46546 dirkercncflem2 46547 dirkercncflem4 46549 fourierdlem24 46574 fourierswlem 46673 mod0mul 47807 dfeven3 48131 dfodd4 48132 dignn0fr 49074 digexp 49080 0dig2nn0e 49085 dignn0flhalflem1 49088 |
| Copyright terms: Public domain | W3C validator |