| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > modirr | Structured version Visualization version GIF version | ||
| Description: A number modulo an irrational multiple of it is nonzero. (Contributed by NM, 11-Nov-2008.) |
| Ref | Expression |
|---|---|
| modirr | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ (𝐴 / 𝐵) ∈ (ℝ ∖ ℚ)) → (𝐴 mod 𝐵) ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldif 3912 | . . 3 ⊢ ((𝐴 / 𝐵) ∈ (ℝ ∖ ℚ) ↔ ((𝐴 / 𝐵) ∈ ℝ ∧ ¬ (𝐴 / 𝐵) ∈ ℚ)) | |
| 2 | modval 13795 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 mod 𝐵) = (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 3 | 2 | eqeq1d 2739 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0)) |
| 4 | recn 11120 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 5 | 4 | adantr 480 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐴 ∈ ℂ) |
| 6 | rpre 12918 | . . . . . . . . . . 11 ⊢ (𝐵 ∈ ℝ+ → 𝐵 ∈ ℝ) | |
| 7 | 6 | adantl 481 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐵 ∈ ℝ) |
| 8 | refldivcl 13747 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℝ) | |
| 9 | 7, 8 | remulcld 11166 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℝ) |
| 10 | 9 | recnd 11164 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 · (⌊‘(𝐴 / 𝐵))) ∈ ℂ) |
| 11 | 5, 10 | subeq0ad 11506 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 − (𝐵 · (⌊‘(𝐴 / 𝐵)))) = 0 ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 12 | rerpdivcl 12941 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ) | |
| 13 | reflcl 13720 | . . . . . . . . . . 11 ⊢ ((𝐴 / 𝐵) ∈ ℝ → (⌊‘(𝐴 / 𝐵)) ∈ ℝ) | |
| 14 | 13 | recnd 11164 | . . . . . . . . . 10 ⊢ ((𝐴 / 𝐵) ∈ ℝ → (⌊‘(𝐴 / 𝐵)) ∈ ℂ) |
| 15 | 12, 14 | syl 17 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (⌊‘(𝐴 / 𝐵)) ∈ ℂ) |
| 16 | rpcnne0 12928 | . . . . . . . . . 10 ⊢ (𝐵 ∈ ℝ+ → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 17 | 16 | adantl 481 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) |
| 18 | divmul2 11804 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ (⌊‘(𝐴 / 𝐵)) ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) | |
| 19 | 5, 15, 17, 18 | syl3anc 1374 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ 𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))))) |
| 20 | eqcom 2744 | . . . . . . . 8 ⊢ ((𝐴 / 𝐵) = (⌊‘(𝐴 / 𝐵)) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵)) | |
| 21 | 19, 20 | bitr3di 286 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 = (𝐵 · (⌊‘(𝐴 / 𝐵))) ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 22 | 3, 11, 21 | 3bitrd 305 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 ↔ (⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵))) |
| 23 | flidz 13734 | . . . . . . . 8 ⊢ ((𝐴 / 𝐵) ∈ ℝ → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 24 | zq 12871 | . . . . . . . 8 ⊢ ((𝐴 / 𝐵) ∈ ℤ → (𝐴 / 𝐵) ∈ ℚ) | |
| 25 | 23, 24 | biimtrdi 253 | . . . . . . 7 ⊢ ((𝐴 / 𝐵) ∈ ℝ → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) → (𝐴 / 𝐵) ∈ ℚ)) |
| 26 | 12, 25 | syl 17 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((⌊‘(𝐴 / 𝐵)) = (𝐴 / 𝐵) → (𝐴 / 𝐵) ∈ ℚ)) |
| 27 | 22, 26 | sylbid 240 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 mod 𝐵) = 0 → (𝐴 / 𝐵) ∈ ℚ)) |
| 28 | 27 | necon3bd 2947 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (¬ (𝐴 / 𝐵) ∈ ℚ → (𝐴 mod 𝐵) ≠ 0)) |
| 29 | 28 | adantld 490 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (((𝐴 / 𝐵) ∈ ℝ ∧ ¬ (𝐴 / 𝐵) ∈ ℚ) → (𝐴 mod 𝐵) ≠ 0)) |
| 30 | 1, 29 | biimtrid 242 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → ((𝐴 / 𝐵) ∈ (ℝ ∖ ℚ) → (𝐴 mod 𝐵) ≠ 0)) |
| 31 | 30 | 3impia 1118 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+ ∧ (𝐴 / 𝐵) ∈ (ℝ ∖ ℚ)) → (𝐴 mod 𝐵) ≠ 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3899 ‘cfv 6493 (class class class)co 7360 ℂcc 11028 ℝcr 11029 0cc0 11030 · cmul 11035 − cmin 11368 / cdiv 11798 ℤcz 12492 ℚcq 12865 ℝ+crp 12909 ⌊cfl 13714 mod cmo 13793 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-inf 9350 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-n0 12406 df-z 12493 df-uz 12756 df-q 12866 df-rp 12910 df-fl 13716 df-mod 13794 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |