| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qmulz | GIF version | ||
| Description: If 𝐴 is rational, then some integer multiple of it is an integer. (Contributed by NM, 7-Nov-2008.) (Revised by Mario Carneiro, 22-Jul-2014.) |
| Ref | Expression |
|---|---|
| qmulz | ⊢ (𝐴 ∈ ℚ → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elq 9953 | . 2 ⊢ (𝐴 ∈ ℚ ↔ ∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥)) | |
| 2 | rexcom 2707 | . . 3 ⊢ (∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥) ↔ ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥)) | |
| 3 | zcn 9581 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
| 4 | 3 | adantl 277 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℂ) |
| 5 | nncn 9244 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℂ) | |
| 6 | 5 | adantr 276 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑥 ∈ ℂ) |
| 7 | nnap0 9265 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 # 0) | |
| 8 | 7 | adantr 276 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑥 # 0) |
| 9 | 4, 6, 8 | divcanap1d 9064 | . . . . . . 7 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → ((𝑦 / 𝑥) · 𝑥) = 𝑦) |
| 10 | simpr 110 | . . . . . . 7 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℤ) | |
| 11 | 9, 10 | eqeltrd 2309 | . . . . . 6 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → ((𝑦 / 𝑥) · 𝑥) ∈ ℤ) |
| 12 | oveq1 6056 | . . . . . . 7 ⊢ (𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) = ((𝑦 / 𝑥) · 𝑥)) | |
| 13 | 12 | eleq1d 2301 | . . . . . 6 ⊢ (𝐴 = (𝑦 / 𝑥) → ((𝐴 · 𝑥) ∈ ℤ ↔ ((𝑦 / 𝑥) · 𝑥) ∈ ℤ)) |
| 14 | 11, 13 | syl5ibrcom 157 | . . . . 5 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → (𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) ∈ ℤ)) |
| 15 | 14 | rexlimdva 2660 | . . . 4 ⊢ (𝑥 ∈ ℕ → (∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) ∈ ℤ)) |
| 16 | 15 | reximia 2637 | . . 3 ⊢ (∃𝑥 ∈ ℕ ∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥) → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
| 17 | 2, 16 | sylbi 121 | . 2 ⊢ (∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥) → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
| 18 | 1, 17 | sylbi 121 | 1 ⊢ (𝐴 ∈ ℚ → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 class class class wbr 4108 (class class class)co 6049 ℂcc 8124 0cc0 8126 · cmul 8131 # cap 8854 / cdiv 8945 ℕcn 9236 ℤcz 9576 ℚcq 9950 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-mulrcl 8225 ax-addcom 8226 ax-mulcom 8227 ax-addass 8228 ax-mulass 8229 ax-distr 8230 ax-i2m1 8231 ax-0lt1 8232 ax-1rid 8233 ax-0id 8234 ax-rnegex 8235 ax-precex 8236 ax-cnre 8237 ax-pre-ltirr 8238 ax-pre-ltwlin 8239 ax-pre-lttrn 8240 ax-pre-apti 8241 ax-pre-ltadd 8242 ax-pre-mulgt0 8243 ax-pre-mulext 8244 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-po 4416 df-iso 4417 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-pnf 8309 df-mnf 8310 df-xr 8311 df-ltxr 8312 df-le 8313 df-sub 8445 df-neg 8446 df-reap 8848 df-ap 8855 df-div 8946 df-inn 9237 df-z 9577 df-q 9951 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |