| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qeqnumdivden | Structured version Visualization version GIF version | ||
| Description: Recover a rational number from its canonical representation. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
| Ref | Expression |
|---|---|
| qeqnumdivden | ⊢ (𝐴 ∈ ℚ → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqidd 2731 | . . . 4 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) = (numer‘𝐴)) | |
| 2 | eqid 2730 | . . . 4 ⊢ (denom‘𝐴) = (denom‘𝐴) | |
| 3 | 1, 2 | jctir 520 | . . 3 ⊢ (𝐴 ∈ ℚ → ((numer‘𝐴) = (numer‘𝐴) ∧ (denom‘𝐴) = (denom‘𝐴))) |
| 4 | qnumcl 16717 | . . . 4 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) ∈ ℤ) | |
| 5 | qdencl 16718 | . . . 4 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
| 6 | qnumdenbi 16721 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ (numer‘𝐴) ∈ ℤ ∧ (denom‘𝐴) ∈ ℕ) → ((((numer‘𝐴) gcd (denom‘𝐴)) = 1 ∧ 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) ↔ ((numer‘𝐴) = (numer‘𝐴) ∧ (denom‘𝐴) = (denom‘𝐴)))) | |
| 7 | 4, 5, 6 | mpd3an23 1465 | . . 3 ⊢ (𝐴 ∈ ℚ → ((((numer‘𝐴) gcd (denom‘𝐴)) = 1 ∧ 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) ↔ ((numer‘𝐴) = (numer‘𝐴) ∧ (denom‘𝐴) = (denom‘𝐴)))) |
| 8 | 3, 7 | mpbird 257 | . 2 ⊢ (𝐴 ∈ ℚ → (((numer‘𝐴) gcd (denom‘𝐴)) = 1 ∧ 𝐴 = ((numer‘𝐴) / (denom‘𝐴)))) |
| 9 | 8 | simprd 495 | 1 ⊢ (𝐴 ∈ ℚ → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ‘cfv 6514 (class class class)co 7390 1c1 11076 / cdiv 11842 ℕcn 12193 ℤcz 12536 ℚcq 12914 gcd cgcd 16471 numercnumer 16710 denomcdenom 16711 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9400 df-inf 9401 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-3 12257 df-n0 12450 df-z 12537 df-uz 12801 df-q 12915 df-rp 12959 df-fl 13761 df-mod 13839 df-seq 13974 df-exp 14034 df-cj 15072 df-re 15073 df-im 15074 df-sqrt 15208 df-abs 15209 df-dvds 16230 df-gcd 16472 df-numer 16712 df-denom 16713 |
| This theorem is referenced by: qmuldeneqnum 16724 numdensq 16731 qden1elz 16734 numdenexp 16737 numdenneg 32746 zringfrac 33532 qqhval2 33979 qqhghm 33985 qqhrhm 33986 qqhnm 33987 qqhre 34017 pellexlem3 42826 |
| Copyright terms: Public domain | W3C validator |