| 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 9534 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 2 | zq 9904 | . . . . . . 7 ⊢ (0 ∈ ℤ → 0 ∈ ℚ) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ ℚ |
| 4 | qapne 9917 | . . . . . 6 ⊢ ((𝐴 ∈ ℚ ∧ 0 ∈ ℚ) → (𝐴 # 0 ↔ 𝐴 ≠ 0)) | |
| 5 | 3, 4 | mpan2 425 | . . . . 5 ⊢ (𝐴 ∈ ℚ → (𝐴 # 0 ↔ 𝐴 ≠ 0)) |
| 6 | 5 | 3anbi2d 1354 | . . . 4 ⊢ (𝐴 ∈ ℚ → ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) ↔ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ))) |
| 7 | 6 | 3ad2ant1 1045 | . . 3 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) ↔ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ))) |
| 8 | 7 | ibir 177 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ)) |
| 9 | qsscn 9909 | . . 3 ⊢ ℚ ⊆ ℂ | |
| 10 | qmulcl 9915 | . . 3 ⊢ ((𝑥 ∈ ℚ ∧ 𝑦 ∈ ℚ) → (𝑥 · 𝑦) ∈ ℚ) | |
| 11 | 1z 9549 | . . . 4 ⊢ 1 ∈ ℤ | |
| 12 | zq 9904 | . . . 4 ⊢ (1 ∈ ℤ → 1 ∈ ℚ) | |
| 13 | 11, 12 | ax-mp 5 | . . 3 ⊢ 1 ∈ ℚ |
| 14 | qapne 9917 | . . . . . 6 ⊢ ((𝑥 ∈ ℚ ∧ 0 ∈ ℚ) → (𝑥 # 0 ↔ 𝑥 ≠ 0)) | |
| 15 | 3, 14 | mpan2 425 | . . . . 5 ⊢ (𝑥 ∈ ℚ → (𝑥 # 0 ↔ 𝑥 ≠ 0)) |
| 16 | 15 | pm5.32i 454 | . . . 4 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 # 0) ↔ (𝑥 ∈ ℚ ∧ 𝑥 ≠ 0)) |
| 17 | qreccl 9920 | . . . 4 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 ≠ 0) → (1 / 𝑥) ∈ ℚ) | |
| 18 | 16, 17 | sylbi 121 | . . 3 ⊢ ((𝑥 ∈ ℚ ∧ 𝑥 # 0) → (1 / 𝑥) ∈ ℚ) |
| 19 | 9, 10, 13, 18 | expcl2lemap 10859 | . 2 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| 20 | 8, 19 | syl 14 | 1 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 ∈ wcel 2202 ≠ wne 2403 class class class wbr 4093 (class class class)co 6028 0cc0 8075 1c1 8076 # cap 8803 / cdiv 8894 ℤcz 9523 ℚcq 9897 ↑cexp 10846 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-seqfrec 10756 df-exp 10847 |
| This theorem is referenced by: pcexp 12945 pcaddlem 12975 lgseisen 15876 |
| Copyright terms: Public domain | W3C validator |