| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > negmod0 | Structured version Visualization version GIF version | ||
| Description: 𝐴 is divisible by 𝐵 iff its negative is. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Fan Zheng, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| negmod0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (-𝐴 mod 𝐵) = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rerpdivcl 12974 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ) | |
| 2 | recn 11128 | . . . 4 ⊢ ((𝐴 / 𝐵) ∈ ℝ → (𝐴 / 𝐵) ∈ ℂ) | |
| 3 | znegclb 12564 | . . . 4 ⊢ ((𝐴 / 𝐵) ∈ ℂ → ((𝐴 / 𝐵) ∈ ℤ ↔ -(𝐴 / 𝐵) ∈ ℤ)) | |
| 4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) ∈ ℤ ↔ -(𝐴 / 𝐵) ∈ ℤ)) |
| 5 | recn 11128 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐴 ∈ ℂ) |
| 7 | rpcn 12953 | . . . . . 6 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℂ) | |
| 8 | 7 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐵 ∈ ℂ) |
| 9 | rpne0 12959 | . . . . . 6 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ≠ 0) | |
| 10 | 9 | adantl 481 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐵 ≠ 0) |
| 11 | 6, 8, 10 | divnegd 11944 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → -(𝐴 / 𝐵) = (-𝐴 / 𝐵)) |
| 12 | 11 | eleq1d 2821 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (-(𝐴 / 𝐵) ∈ ℤ ↔ (-𝐴 / 𝐵) ∈ ℤ)) |
| 13 | 4, 12 | bitrd 279 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) ∈ ℤ ↔ (-𝐴 / 𝐵) ∈ ℤ)) |
| 14 | mod0 13835 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 15 | renegcl 11457 | . . 3 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 16 | mod0 13835 | . . 3 ⊢ ((-𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((-𝐴 mod 𝐵) = 0 ↔ (-𝐴 / 𝐵) ∈ ℤ)) | |
| 17 | 15, 16 | sylan 581 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((-𝐴 mod 𝐵) = 0 ↔ (-𝐴 / 𝐵) ∈ ℤ)) |
| 18 | 13, 14, 17 | 3bitr4d 311 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (-𝐴 mod 𝐵) = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 (class class class)co 7367 ℂcc 11036 ℝcr 11037 0cc0 11038 -cneg 11378 / cdiv 11807 ℤcz 12524 ℝ+crp 12942 mod cmo 13828 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fl 13751 df-mod 13829 |
| This theorem is referenced by: absmod0 15265 gausslemma2dlem0i 27327 pgnbgreunbgrlem2lem1 48590 pgnbgreunbgrlem2lem2 48591 |
| Copyright terms: Public domain | W3C validator |