| 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 11181 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 ∈ ℝ) | |
| 2 | qre 12951 | . . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
| 3 | qdencl 16759 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
| 4 | 3 | nnred 12222 | . . 3 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℝ) |
| 5 | 3 | nngt0d 12259 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 < (denom‘𝐴)) |
| 6 | ltmul1 12038 | . . 3 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((denom‘𝐴) ∈ ℝ ∧ 0 < (denom‘𝐴))) → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) | |
| 7 | 1, 2, 4, 5, 6 | syl112anc 1392 | . 2 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) |
| 8 | 3 | nncnd 12223 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℂ) |
| 9 | 8 | mul02d 11378 | . . 3 ⊢ (𝐴 ∈ ℚ → (0 · (denom‘𝐴)) = 0) |
| 10 | qmuldeneqnum 16765 | . . 3 ⊢ (𝐴 ∈ ℚ → (𝐴 · (denom‘𝐴)) = (numer‘𝐴)) | |
| 11 | 9, 10 | breq12d 5112 | . 2 ⊢ (𝐴 ∈ ℚ → ((0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)) ↔ 0 < (numer‘𝐴))) |
| 12 | 7, 11 | bitrd 281 | 1 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ 0 < (numer‘𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2141 class class class wbr 5099 ‘cfv 6517 (class class class)co 7392 ℝcr 11069 0cc0 11070 · cmul 11075 < clt 11213 ℚcq 12946 numercnumer 16751 denomcdenom 16752 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-pre-sup 11148 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-sup 9385 df-inf 9386 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12208 df-2 12277 df-3 12278 df-n0 12479 df-z 12566 df-uz 12837 df-q 12947 df-rp 12991 df-fl 13799 df-mod 13877 df-seq 14012 df-exp 14072 df-cj 15109 df-re 15110 df-im 15111 df-sqrt 15245 df-abs 15246 df-dvds 16270 df-gcd 16512 df-numer 16753 df-denom 16754 |
| This theorem is referenced by: qgt0numnn 16769 |
| Copyright terms: Public domain | W3C validator |