![]() |
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 12849 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℝ) | |
2 | 1 | adantr 480 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝐵 ∈ ℝ) |
3 | eluz2nn 12884 | . . . . . . 7 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℕ) | |
4 | 3 | nnne0d 12278 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ≠ 0) |
5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝐵 ≠ 0) |
6 | simpr 484 | . . . . 5 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ) | |
7 | 2, 5, 6 | 3jca 1126 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ) → (𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ)) |
8 | 7 | 3adant3 1130 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ)) |
9 | reexpclz 14065 | . . 3 ⊢ ((𝐵 ∈ ℝ ∧ 𝐵 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐵↑𝑁) ∈ ℝ) | |
10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ ℝ) |
11 | 0red 11233 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ∈ ℝ) | |
12 | 1 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝐵 ∈ ℝ) |
13 | 4 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝐵 ≠ 0) |
14 | simp2 1135 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝑁 ∈ ℤ) | |
15 | 12, 13, 14 | reexpclzd 14229 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ ℝ) |
16 | 3 | nngt0d 12277 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 0 < 𝐵) |
17 | 16 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 < 𝐵) |
18 | expgt0 14078 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 0 < 𝐵) → 0 < (𝐵↑𝑁)) | |
19 | 12, 14, 17, 18 | syl3anc 1369 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 < (𝐵↑𝑁)) |
20 | 11, 15, 19 | ltled 11378 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ≤ (𝐵↑𝑁)) |
21 | 0zd 12586 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 0 ∈ ℤ) | |
22 | eluz2gt1 12920 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 < 𝐵) | |
23 | 22 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 1 < 𝐵) |
24 | simp3 1136 | . . . 4 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 𝑁 < 0) | |
25 | ltexp2a 14148 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 0 ∈ ℤ) ∧ (1 < 𝐵 ∧ 𝑁 < 0)) → (𝐵↑𝑁) < (𝐵↑0)) | |
26 | 12, 14, 21, 23, 24, 25 | syl32anc 1376 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) < (𝐵↑0)) |
27 | eluzelcn 12850 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘2) → 𝐵 ∈ ℂ) | |
28 | 27 | exp0d 14122 | . . . . 5 ⊢ (𝐵 ∈ (ℤ≥‘2) → (𝐵↑0) = 1) |
29 | 28 | eqcomd 2733 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘2) → 1 = (𝐵↑0)) |
30 | 29 | 3ad2ant1 1131 | . . 3 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → 1 = (𝐵↑0)) |
31 | 26, 30 | breqtrrd 5170 | . 2 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) < 1) |
32 | 0re 11232 | . . . 4 ⊢ 0 ∈ ℝ | |
33 | 1xr 11289 | . . . 4 ⊢ 1 ∈ ℝ* | |
34 | 32, 33 | pm3.2i 470 | . . 3 ⊢ (0 ∈ ℝ ∧ 1 ∈ ℝ*) |
35 | elico2 13406 | . . 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 1340 | 1 ⊢ ((𝐵 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ ℤ ∧ 𝑁 < 0) → (𝐵↑𝑁) ∈ (0[,)1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 ℝcr 11123 0cc0 11124 1c1 11125 ℝ*cxr 11263 < clt 11264 ≤ cle 11265 2c2 12283 ℤcz 12574 ℤ≥cuz 12838 [,)cico 13344 ↑cexp 14044 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7863 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-er 8716 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11266 df-mnf 11267 df-xr 11268 df-ltxr 11269 df-le 11270 df-sub 11462 df-neg 11463 df-div 11888 df-nn 12229 df-2 12291 df-n0 12489 df-z 12575 df-uz 12839 df-rp 12993 df-ico 13348 df-seq 13985 df-exp 14045 |
This theorem is referenced by: digexp 47593 |
Copyright terms: Public domain | W3C validator |