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 10715 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 ∈ ℝ) | |
2 | qre 12428 | . . 3 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ) | |
3 | qdencl 16174 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
4 | 3 | nnred 11724 | . . 3 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℝ) |
5 | 3 | nngt0d 11758 | . . 3 ⊢ (𝐴 ∈ ℚ → 0 < (denom‘𝐴)) |
6 | ltmul1 11561 | . . 3 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ ((denom‘𝐴) ∈ ℝ ∧ 0 < (denom‘𝐴))) → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) | |
7 | 1, 2, 4, 5, 6 | syl112anc 1375 | . 2 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ (0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)))) |
8 | 3 | nncnd 11725 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℂ) |
9 | 8 | mul02d 10909 | . . 3 ⊢ (𝐴 ∈ ℚ → (0 · (denom‘𝐴)) = 0) |
10 | qmuldeneqnum 16180 | . . 3 ⊢ (𝐴 ∈ ℚ → (𝐴 · (denom‘𝐴)) = (numer‘𝐴)) | |
11 | 9, 10 | breq12d 5040 | . 2 ⊢ (𝐴 ∈ ℚ → ((0 · (denom‘𝐴)) < (𝐴 · (denom‘𝐴)) ↔ 0 < (numer‘𝐴))) |
12 | 7, 11 | bitrd 282 | 1 ⊢ (𝐴 ∈ ℚ → (0 < 𝐴 ↔ 0 < (numer‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2113 class class class wbr 5027 ‘cfv 6333 (class class class)co 7164 ℝcr 10607 0cc0 10608 · cmul 10613 < clt 10746 ℚcq 12423 numercnumer 16166 denomcdenom 16167 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2161 ax-12 2178 ax-ext 2710 ax-sep 5164 ax-nul 5171 ax-pow 5229 ax-pr 5293 ax-un 7473 ax-cnex 10664 ax-resscn 10665 ax-1cn 10666 ax-icn 10667 ax-addcl 10668 ax-addrcl 10669 ax-mulcl 10670 ax-mulrcl 10671 ax-mulcom 10672 ax-addass 10673 ax-mulass 10674 ax-distr 10675 ax-i2m1 10676 ax-1ne0 10677 ax-1rid 10678 ax-rnegex 10679 ax-rrecex 10680 ax-cnre 10681 ax-pre-lttri 10682 ax-pre-lttrn 10683 ax-pre-ltadd 10684 ax-pre-mulgt0 10685 ax-pre-sup 10686 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3399 df-sbc 3680 df-csb 3789 df-dif 3844 df-un 3846 df-in 3848 df-ss 3858 df-pss 3860 df-nul 4210 df-if 4412 df-pw 4487 df-sn 4514 df-pr 4516 df-tp 4518 df-op 4520 df-uni 4794 df-iun 4880 df-br 5028 df-opab 5090 df-mpt 5108 df-tr 5134 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6123 df-ord 6169 df-on 6170 df-lim 6171 df-suc 6172 df-iota 6291 df-fun 6335 df-fn 6336 df-f 6337 df-f1 6338 df-fo 6339 df-f1o 6340 df-fv 6341 df-riota 7121 df-ov 7167 df-oprab 7168 df-mpo 7169 df-om 7594 df-1st 7707 df-2nd 7708 df-wrecs 7969 df-recs 8030 df-rdg 8068 df-er 8313 df-en 8549 df-dom 8550 df-sdom 8551 df-sup 8972 df-inf 8973 df-pnf 10748 df-mnf 10749 df-xr 10750 df-ltxr 10751 df-le 10752 df-sub 10943 df-neg 10944 df-div 11369 df-nn 11710 df-2 11772 df-3 11773 df-n0 11970 df-z 12056 df-uz 12318 df-q 12424 df-rp 12466 df-fl 13246 df-mod 13322 df-seq 13454 df-exp 13515 df-cj 14541 df-re 14542 df-im 14543 df-sqrt 14677 df-abs 14678 df-dvds 15693 df-gcd 15931 df-numer 16168 df-denom 16169 |
This theorem is referenced by: qgt0numnn 16184 |
Copyright terms: Public domain | W3C validator |