| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > numdenexp | Structured version Visualization version GIF version | ||
| Description: Elevating a rational number to the power 𝑁 has the same effect on its canonical components. Same as numdensq 16715, extended to nonnegative exponents. (Contributed by Steven Nguyen, 5-Apr-2023.) |
| Ref | Expression |
|---|---|
| numdenexp | ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → ((numer‘(𝐴↑𝑁)) = ((numer‘𝐴)↑𝑁) ∧ (denom‘(𝐴↑𝑁)) = ((denom‘𝐴)↑𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qnumdencoprm 16706 | . . . . 5 ⊢ (𝐴 ∈ ℚ → ((numer‘𝐴) gcd (denom‘𝐴)) = 1) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → ((numer‘𝐴) gcd (denom‘𝐴)) = 1) |
| 3 | 2 | oveq1d 7375 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (((numer‘𝐴) gcd (denom‘𝐴))↑𝑁) = (1↑𝑁)) |
| 4 | qnumcl 16701 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (numer‘𝐴) ∈ ℤ) | |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (numer‘𝐴) ∈ ℤ) |
| 6 | qdencl 16702 | . . . . . 6 ⊢ (𝐴 ∈ ℚ → (denom‘𝐴) ∈ ℕ) | |
| 7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (denom‘𝐴) ∈ ℕ) |
| 8 | 7 | nnzd 12541 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (denom‘𝐴) ∈ ℤ) |
| 9 | simpr 484 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0) | |
| 10 | zexpgcd 16525 | . . . 4 ⊢ (((numer‘𝐴) ∈ ℤ ∧ (denom‘𝐴) ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (((numer‘𝐴) gcd (denom‘𝐴))↑𝑁) = (((numer‘𝐴)↑𝑁) gcd ((denom‘𝐴)↑𝑁))) | |
| 11 | 5, 8, 9, 10 | syl3anc 1374 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (((numer‘𝐴) gcd (denom‘𝐴))↑𝑁) = (((numer‘𝐴)↑𝑁) gcd ((denom‘𝐴)↑𝑁))) |
| 12 | nn0z 12539 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 13 | 1exp 14044 | . . . 4 ⊢ (𝑁 ∈ ℤ → (1↑𝑁) = 1) | |
| 14 | 9, 12, 13 | 3syl 18 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (1↑𝑁) = 1) |
| 15 | 3, 11, 14 | 3eqtr3d 2780 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (((numer‘𝐴)↑𝑁) gcd ((denom‘𝐴)↑𝑁)) = 1) |
| 16 | qeqnumdivden 16707 | . . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) | |
| 17 | 16 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → 𝐴 = ((numer‘𝐴) / (denom‘𝐴))) |
| 18 | 17 | oveq1d 7375 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (((numer‘𝐴) / (denom‘𝐴))↑𝑁)) |
| 19 | 5 | zcnd 12625 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (numer‘𝐴) ∈ ℂ) |
| 20 | 7 | nncnd 12181 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (denom‘𝐴) ∈ ℂ) |
| 21 | 7 | nnne0d 12218 | . . . 4 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (denom‘𝐴) ≠ 0) |
| 22 | 19, 20, 21, 9 | expdivd 14113 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (((numer‘𝐴) / (denom‘𝐴))↑𝑁) = (((numer‘𝐴)↑𝑁) / ((denom‘𝐴)↑𝑁))) |
| 23 | 18, 22 | eqtrd 2772 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) = (((numer‘𝐴)↑𝑁) / ((denom‘𝐴)↑𝑁))) |
| 24 | qexpcl 14030 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℚ) | |
| 25 | zexpcl 14029 | . . . 4 ⊢ (((numer‘𝐴) ∈ ℤ ∧ 𝑁 ∈ ℕ0) → ((numer‘𝐴)↑𝑁) ∈ ℤ) | |
| 26 | 4, 25 | sylan 581 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → ((numer‘𝐴)↑𝑁) ∈ ℤ) |
| 27 | 7, 9 | nnexpcld 14198 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → ((denom‘𝐴)↑𝑁) ∈ ℕ) |
| 28 | qnumdenbi 16705 | . . 3 ⊢ (((𝐴↑𝑁) ∈ ℚ ∧ ((numer‘𝐴)↑𝑁) ∈ ℤ ∧ ((denom‘𝐴)↑𝑁) ∈ ℕ) → (((((numer‘𝐴)↑𝑁) gcd ((denom‘𝐴)↑𝑁)) = 1 ∧ (𝐴↑𝑁) = (((numer‘𝐴)↑𝑁) / ((denom‘𝐴)↑𝑁))) ↔ ((numer‘(𝐴↑𝑁)) = ((numer‘𝐴)↑𝑁) ∧ (denom‘(𝐴↑𝑁)) = ((denom‘𝐴)↑𝑁)))) | |
| 29 | 24, 26, 27, 28 | syl3anc 1374 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (((((numer‘𝐴)↑𝑁) gcd ((denom‘𝐴)↑𝑁)) = 1 ∧ (𝐴↑𝑁) = (((numer‘𝐴)↑𝑁) / ((denom‘𝐴)↑𝑁))) ↔ ((numer‘(𝐴↑𝑁)) = ((numer‘𝐴)↑𝑁) ∧ (denom‘(𝐴↑𝑁)) = ((denom‘𝐴)↑𝑁)))) |
| 30 | 15, 23, 29 | mpbi2and 713 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → ((numer‘(𝐴↑𝑁)) = ((numer‘𝐴)↑𝑁) ∧ (denom‘(𝐴↑𝑁)) = ((denom‘𝐴)↑𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6492 (class class class)co 7360 1c1 11030 / cdiv 11798 ℕcn 12165 ℕ0cn0 12428 ℤcz 12515 ℚcq 12889 ↑cexp 14014 gcd cgcd 16454 numercnumer 16694 denomcdenom 16695 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-q 12890 df-rp 12934 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16213 df-gcd 16455 df-numer 16696 df-denom 16697 |
| This theorem is referenced by: numexp 16722 denexp 16723 |
| Copyright terms: Public domain | W3C validator |