Metamath Proof Explorer


Theorem expnlbnd2

Description: The reciprocal of exponentiation with a base greater than 1 has no positive lower bound. (Contributed by NM, 18-Jul-2008) (Proof shortened by Mario Carneiro, 5-Jun-2014)

Ref Expression
Assertion expnlbnd2 A+B1<Bjkj1Bk<A

Proof

Step Hyp Ref Expression
1 expnlbnd A+B1<Bj1Bj<A
2 simpl2 A+B1<BjkjB
3 simpl3 A+B1<Bjkj1<B
4 1re 1
5 ltle 1B1<B1B
6 4 2 5 sylancr A+B1<Bjkj1<B1B
7 3 6 mpd A+B1<Bjkj1B
8 simprr A+B1<Bjkjkj
9 leexp2a B1BkjBjBk
10 2 7 8 9 syl3anc A+B1<BjkjBjBk
11 0red A+B1<Bjkj0
12 1red A+B1<Bjkj1
13 0lt1 0<1
14 13 a1i A+B1<Bjkj0<1
15 11 12 2 14 3 lttrd A+B1<Bjkj0<B
16 2 15 elrpd A+B1<BjkjB+
17 nnz jj
18 17 ad2antrl A+B1<Bjkjj
19 rpexpcl B+jBj+
20 16 18 19 syl2anc A+B1<BjkjBj+
21 eluzelz kjk
22 21 ad2antll A+B1<Bjkjk
23 rpexpcl B+kBk+
24 16 22 23 syl2anc A+B1<BjkjBk+
25 20 24 lerecd A+B1<BjkjBjBk1Bk1Bj
26 10 25 mpbid A+B1<Bjkj1Bk1Bj
27 24 rprecred A+B1<Bjkj1Bk
28 20 rprecred A+B1<Bjkj1Bj
29 simpl1 A+B1<BjkjA+
30 29 rpred A+B1<BjkjA
31 lelttr 1Bk1BjA1Bk1Bj1Bj<A1Bk<A
32 27 28 30 31 syl3anc A+B1<Bjkj1Bk1Bj1Bj<A1Bk<A
33 26 32 mpand A+B1<Bjkj1Bj<A1Bk<A
34 33 anassrs A+B1<Bjkj1Bj<A1Bk<A
35 34 ralrimdva A+B1<Bj1Bj<Akj1Bk<A
36 35 reximdva A+B1<Bj1Bj<Ajkj1Bk<A
37 1 36 mpd A+B1<Bjkj1Bk<A