| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qden1elz | Structured version Visualization version GIF version | ||
| Description: A rational is an integer iff it has denominator 1. (Contributed by Stefan O'Rear, 15-Sep-2014.) |
| Ref | Expression |
|---|---|
| qden1elz | ⊢ (𝐴 ∈ ℚ → ((denom‘𝐴) = 1 ↔ 𝐴 ∈ ℤ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qeqnumdivden 16966 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) |
| 3 | oveq2 7459 | . . . . 5 ⊢ ((denom‘𝐴) = 1 → ((numer‘𝐴) / (denom‘𝐴)) = ((numer‘𝐴) / 1)) | |
| 4 | 3 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → ((numer‘𝐴) / (denom‘𝐴)) = ((numer‘𝐴) / 1)) |
| 5 | qnumcl 16960 | . . . . . . 7 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) ∈ ℤ) | |
| 6 | 5 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → (numer‘𝐴) ∈ ℤ) |
| 7 | 6 | zcnd 12844 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → (numer‘𝐴) ∈ ℂ) |
| 8 | 7 | div1d 12125 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → ((numer‘𝐴) / 1) = (numer‘𝐴)) |
| 9 | 2, 4, 8 | 3eqtrd 2802 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → 𝐴 = (numer‘𝐴)) |
| 10 | 9, 6 | eqeltrd 2864 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ (denom‘𝐴) = 1) → 𝐴 ∈ ℤ) |
| 11 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ) | |
| 12 | 11 | zcnd 12844 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℂ) |
| 13 | 12 | div1d 12125 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (𝐴 / 1) = 𝐴) |
| 14 | 13 | fveq2d 6920 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (denom‘(𝐴 / 1)) = (denom‘𝐴)) |
| 15 | 1nn 12386 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 16 | divdenle 16969 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 1 ∈ ℕ) → (denom‘(𝐴 / 1)) ≤ 1) | |
| 17 | 11, 15, 16 | sylancl 598 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (denom‘(𝐴 / 1)) ≤ 1) |
| 18 | 14, 17 | eqbrtrrd 5135 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (denom‘𝐴) ≤ 1) |
| 19 | qdencl 16961 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
| 20 | 19 | adantr 486 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (denom‘𝐴) ∈ ℕ) |
| 21 | nnle1eq1 12408 | . . . 4 ⊢ ((denom‘𝐴) ∈ ℕ → ((denom‘𝐴) ≤ 1 ↔ (denom‘𝐴) = 1)) | |
| 22 | 20, 21 | syl 18 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → ((denom‘𝐴) ≤ 1 ↔ (denom‘𝐴) = 1)) |
| 23 | 18, 22 | mpbid 235 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ∈ ℤ) → (denom‘𝐴) = 1) |
| 24 | 10, 23 | impbida 813 | 1 ⊢ (𝐴 ∈ ℚ → ((denom‘𝐴) = 1 ↔ 𝐴 ∈ ℤ)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 1c1 11240 ≤ cle 11383 / cdiv 12013 ℕcn 12375 ℤcz 12733 ℚcq 13115 numercnumer 16953 denomcdenom 16954 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-q 13116 df-rp 13161 df-fl 13972 df-mod 14050 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-dvds 16467 df-gcd 16709 df-numer 16955 df-denom 16956 |
| This theorem is used by: zsqrtelqelz 16978 zrtelqelz 27143 oexpreposd 43645 |
| Copyright terms: Public domain | W3C validator |