Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > expnegico01 | Structured version Visualization version GIF version |
Description: An integer greater than 1 to the power of a negative integer is in the closed-below, open-above interval between 0 and 1. (Contributed by AV, 24-May-2020.) |
Ref | Expression |
---|---|
expnegico01 | ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ (0[,)1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzelre 12242 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℝ) | |
2 | 1 | adantr 481 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝐵 ∈ ℝ) |
3 | eluz2nn 12272 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
4 | 3 | nnne0d 11675 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ≠ 0) |
5 | 4 | adantr 481 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝐵 ≠ 0) |
6 | simpr 485 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ) | |
7 | 2, 5, 6 | 3jca 1120 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → (𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ)) |
8 | 7 | 3adant3 1124 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ)) |
9 | reexpclz 13437 | . . 3 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐵↑𝑁) ∈ ℝ) | |
10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ ℝ) |
11 | 0red 10632 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ∈ ℝ) | |
12 | 1 | 3ad2ant1 1125 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝐵 ∈ ℝ) |
13 | 4 | 3ad2ant1 1125 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝐵 ≠ 0) |
14 | simp2 1129 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝑁 ∈ ℤ) | |
15 | 12, 13, 14 | reexpclzd 13598 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ ℝ) |
16 | 3 | nngt0d 11674 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 0 < 𝐵) |
17 | 16 | 3ad2ant1 1125 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 < 𝐵) |
18 | expgt0 13450 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 0 < 𝐵) → 0 < (𝐵↑𝑁)) | |
19 | 12, 14, 17, 18 | syl3anc 1363 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 < (𝐵↑𝑁)) |
20 | 11, 15, 19 | ltled 10776 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ≤ (𝐵↑𝑁)) |
21 | 0zd 11981 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ∈ ℤ) | |
22 | eluz2gt1 12308 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 < 𝐵) | |
23 | 22 | 3ad2ant1 1125 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 1 < 𝐵) |
24 | simp3 1130 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝑁 < 0) | |
25 | ltexp2a 13518 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 0 ∈ ℤ) ∧ (1 < 𝐵 ∧ 𝑁 < 0)) → (𝐵↑𝑁) < (𝐵↑0)) | |
26 | 12, 14, 21, 23, 24, 25 | syl32anc 1370 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) < (𝐵↑0)) |
27 | eluzelcn 12243 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
28 | 27 | exp0d 13492 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
29 | 28 | eqcomd 2824 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
30 | 29 | 3ad2ant1 1125 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 1 = (𝐵↑0)) |
31 | 26, 30 | breqtrrd 5085 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) < 1) |
32 | 0re 10631 | . . . 4 ⊢ 0 ∈ ℝ | |
33 | 1xr 10688 | . . . 4 ⊢ 1 ∈ ℝ* | |
34 | 32, 33 | pm3.2i 471 | . . 3 ⊢ (0 ∈ ℝ ∧ 1 ∈ ℝ*) |
35 | elico2 12788 | . . 3 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ*) → ((𝐵↑𝑁) ∈ (0[,)1) ↔ ((𝐵↑𝑁) ∈ ℝ ∧ 0 ≤ (𝐵↑𝑁) ∧ (𝐵↑𝑁) < 1))) | |
36 | 34, 35 | mp1i 13 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → ((𝐵↑𝑁) ∈ (0[,)1) ↔ ((𝐵↑𝑁) ∈ ℝ ∧ 0 ≤ (𝐵↑𝑁) ∧ (𝐵↑𝑁) < 1))) |
37 | 10, 20, 31, 36 | mpbir3and 1334 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ (0[,)1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 ℝcr 10524 0cc0 10525 1c1 10526 ℝ*cxr 10662 < clt 10663 ≤ cle 10664 2c2 11680 ℤcz 11969 ℤ≥cuz 12231 [,)cico 12728 ↑cexp 13417 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-ico 12732 df-seq 13358 df-exp 13418 |
This theorem is referenced by: digexp 44595 |
Copyright terms: Public domain | W3C validator |