| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qnumgt0 | Structured version Visualization version GIF version | ||
| Description: A rational is positive iff its canonical numerator is. (Contributed by Stefan O'Rear, 15-Sep-2014.) |
| Ref | Expression |
|---|---|
| qnumgt0 | ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ 0 < (numer‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 11238 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 ∈ ℝ) | |
| 2 | qre 13005 | . . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
| 3 | qdencl 16836 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
| 4 | 3 | nnred 12275 | . . 3 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℝ) |
| 5 | 3 | nngt0d 12312 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 < (denom‘𝐴)) |
| 6 | ltmul1 12092 | . . 3 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((denom‘𝐴) ∈ ℝ ∧ 0 < (denom‘𝐴))) → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) | |
| 7 | 1, 2, 4, 5, 6 | syl112anc 1401 | . 2 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) |
| 8 | 3 | nncnd 12276 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℂ) |
| 9 | 8 | mul02d 11435 | . . 3 ⊢ (𝐴 ∈ ℚ → (0 · (denom‘𝐴)) = 0) |
| 10 | qmuldeneqnum 16842 | . . 3 ⊢ (𝐴 ∈ ℚ → (𝐴 · (denom‘𝐴)) = (numer‘𝐴)) | |
| 11 | 9, 10 | breq12d 5120 | . 2 ⊢ (𝐴 ∈ ℚ → ((0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)) ↔ 0 < (numer‘𝐴))) |
| 12 | 7, 11 | bitrd 282 | 1 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ 0 < (numer‘𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2145 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 ℝcr 11126 0cc0 11127 · cmul 11132 < clt 11270 ℚcq 13000 numercnumer 16828 denomcdenom 16829 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-z 12619 df-uz 12891 df-q 13001 df-rp 13045 df-fl 13855 df-mod 13933 df-seq 14068 df-exp 14128 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-dvds 16347 df-gcd 16589 df-numer 16830 df-denom 16831 |
| This theorem is used by: qgt0numnn 16846 |
| Copyright terms: Public domain | W3C validator |