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 9407 | . 2 ⊢ (𝐴 ∈ ℚ ↔ ∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥)) | |
2 | rexcom 2593 | . . 3 ⊢ (∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥) ↔ ∃𝑥 ∈ ℕ ∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥)) | |
3 | zcn 9052 | . . . . . . . . 9 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
4 | 3 | adantl 275 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℂ) |
5 | nncn 8721 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℂ) | |
6 | 5 | adantr 274 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑥 ∈ ℂ) |
7 | nnap0 8742 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 # 0) | |
8 | 7 | adantr 274 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑥 # 0) |
9 | 4, 6, 8 | divcanap1d 8544 | . . . . . . 7 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → ((𝑦 / 𝑥) · 𝑥) = 𝑦) |
10 | simpr 109 | . . . . . . 7 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℤ) | |
11 | 9, 10 | eqeltrd 2214 | . . . . . 6 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → ((𝑦 / 𝑥) · 𝑥) ∈ ℤ) |
12 | oveq1 5774 | . . . . . . 7 ⊢ (𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) = ((𝑦 / 𝑥) · 𝑥)) | |
13 | 12 | eleq1d 2206 | . . . . . 6 ⊢ (𝐴 = (𝑦 / 𝑥) → ((𝐴 · 𝑥) ∈ ℤ ↔ ((𝑦 / 𝑥) · 𝑥) ∈ ℤ)) |
14 | 11, 13 | syl5ibrcom 156 | . . . . 5 ⊢ ((𝑥 ∈ ℕ ∧ 𝑦 ∈ ℤ) → (𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) ∈ ℤ)) |
15 | 14 | rexlimdva 2547 | . . . 4 ⊢ (𝑥 ∈ ℕ → (∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥) → (𝐴 · 𝑥) ∈ ℤ)) |
16 | 15 | reximia 2525 | . . 3 ⊢ (∃𝑥 ∈ ℕ ∃𝑦 ∈ ℤ 𝐴 = (𝑦 / 𝑥) → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
17 | 2, 16 | sylbi 120 | . 2 ⊢ (∃𝑦 ∈ ℤ ∃𝑥 ∈ ℕ 𝐴 = (𝑦 / 𝑥) → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
18 | 1, 17 | sylbi 120 | 1 ⊢ (𝐴 ∈ ℚ → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 ∃wrex 2415 class class class wbr 3924 (class class class)co 5767 ℂcc 7611 0cc0 7613 · cmul 7618 # cap 8336 / cdiv 8425 ℕcn 8713 ℤcz 9047 ℚcq 9404 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-cnex 7704 ax-resscn 7705 ax-1cn 7706 ax-1re 7707 ax-icn 7708 ax-addcl 7709 ax-addrcl 7710 ax-mulcl 7711 ax-mulrcl 7712 ax-addcom 7713 ax-mulcom 7714 ax-addass 7715 ax-mulass 7716 ax-distr 7717 ax-i2m1 7718 ax-0lt1 7719 ax-1rid 7720 ax-0id 7721 ax-rnegex 7722 ax-precex 7723 ax-cnre 7724 ax-pre-ltirr 7725 ax-pre-ltwlin 7726 ax-pre-lttrn 7727 ax-pre-apti 7728 ax-pre-ltadd 7729 ax-pre-mulgt0 7730 ax-pre-mulext 7731 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-nel 2402 df-ral 2419 df-rex 2420 df-reu 2421 df-rmo 2422 df-rab 2423 df-v 2683 df-sbc 2905 df-csb 2999 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-iun 3810 df-br 3925 df-opab 3985 df-mpt 3986 df-id 4210 df-po 4213 df-iso 4214 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-res 4546 df-ima 4547 df-iota 5083 df-fun 5120 df-fn 5121 df-f 5122 df-fv 5126 df-riota 5723 df-ov 5770 df-oprab 5771 df-mpo 5772 df-1st 6031 df-2nd 6032 df-pnf 7795 df-mnf 7796 df-xr 7797 df-ltxr 7798 df-le 7799 df-sub 7928 df-neg 7929 df-reap 8330 df-ap 8337 df-div 8426 df-inn 8714 df-z 9048 df-q 9405 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |