| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qexpclz | GIF version | ||
| Description: Closure of exponentiation of rational numbers. (Contributed by Mario Carneiro, 9-Sep-2014.) |
| Ref | Expression |
|---|---|
| qexpclz | ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0z 9457 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 2 | zq 9821 | . . . . . . 7 ⊢ (0 ∈ ℤ → 0 ∈ ℚ) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ ℚ |
| 4 | qapne 9834 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 0 ∈ ℚ) → (𝐴 # 0 ↔ 𝐴 ≠ 0)) | |
| 5 | 3, 4 | mpan2 425 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (𝐴 # 0 ↔ 𝐴 ≠ 0)) |
| 6 | 5 | 3anbi2d 1351 | . . . 4 ⊢ (𝐴 ∈ ℚ → ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) ↔ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ))) |
| 7 | 6 | 3ad2ant1 1042 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) ↔ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ))) |
| 8 | 7 | ibir 177 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ)) |
| 9 | qsscn 9826 | . . 3 ⊢ ℚ ⊆ ℂ | |
| 10 | qmulcl 9832 | . . 3 ⊢ ((𝑥 ∈ ℚ ∧ 𝑦 ∈ ℚ) → (𝑥 · 𝑦) ∈ ℚ) | |
| 11 | 1z 9472 | . . . 4 ⊢ 1 ∈ ℤ | |
| 12 | zq 9821 | . . . 4 ⊢ (1 ∈ ℤ → 1 ∈ ℚ) | |
| 13 | 11, 12 | ax-mp 5 | . . 3 ⊢ 1 ∈ ℚ |
| 14 | qapne 9834 | . . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 0 ∈ ℚ) → (𝑥 # 0 ↔ 𝑥 ≠ 0)) | |
| 15 | 3, 14 | mpan2 425 | . . . . 5 ⊢ (𝑥 ∈ ℚ → (𝑥 # 0 ↔ 𝑥 ≠ 0)) |
| 16 | 15 | pm5.32i 454 | . . . 4 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 # 0) ↔ (𝑥 ∈ ℚ ∧ 𝑥 ≠ 0)) |
| 17 | qreccl 9837 | . . . 4 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 ≠ 0) → (1 / 𝑥) ∈ ℚ) | |
| 18 | 16, 17 | sylbi 121 | . . 3 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 # 0) → (1 / 𝑥) ∈ ℚ) |
| 19 | 9, 10, 13, 18 | expcl2lemap 10773 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| 20 | 8, 19 | syl 14 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 ∈ wcel 2200 ≠ wne 2400 class class class wbr 4083 (class class class)co 6001 0cc0 7999 1c1 8000 # cap 8728 / cdiv 8819 ℤcz 9446 ℚcq 9814 ↑cexp 10760 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8090 ax-resscn 8091 ax-1cn 8092 ax-1re 8093 ax-icn 8094 ax-addcl 8095 ax-addrcl 8096 ax-mulcl 8097 ax-mulrcl 8098 ax-addcom 8099 ax-mulcom 8100 ax-addass 8101 ax-mulass 8102 ax-distr 8103 ax-i2m1 8104 ax-0lt1 8105 ax-1rid 8106 ax-0id 8107 ax-rnegex 8108 ax-precex 8109 ax-cnre 8110 ax-pre-ltirr 8111 ax-pre-ltwlin 8112 ax-pre-lttrn 8113 ax-pre-apti 8114 ax-pre-ltadd 8115 ax-pre-mulgt0 8116 ax-pre-mulext 8117 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5954 df-ov 6004 df-oprab 6005 df-mpo 6006 df-1st 6286 df-2nd 6287 df-recs 6451 df-frec 6537 df-pnf 8183 df-mnf 8184 df-xr 8185 df-ltxr 8186 df-le 8187 df-sub 8319 df-neg 8320 df-reap 8722 df-ap 8729 df-div 8820 df-inn 9111 df-n0 9370 df-z 9447 df-uz 9723 df-q 9815 df-seqfrec 10670 df-exp 10761 |
| This theorem is referenced by: pcexp 12832 pcaddlem 12862 lgseisen 15753 |
| Copyright terms: Public domain | W3C validator |