Metamath Proof Explorer


Theorem cxp2lim

Description: Any power grows slower than any exponential with base greater than 1 . (Contributed by Mario Carneiro, 18-Sep-2014)

Ref Expression
Assertion cxp2lim ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n A B n ⇝ℝ 0

Proof

Step Hyp Ref Expression
1 1re ⊢ 1 ∈ ℝ
2 elicopnf ⊢ 1 ∈ ℝ → n ∈ 1 +∞ ↔ n ∈ ℝ ∧ 1 ≤ n
3 1 2 ax-mp ⊢ n ∈ 1 +∞ ↔ n ∈ ℝ ∧ 1 ≤ n
4 3 simplbi ⊢ n ∈ 1 +∞ → n ∈ ℝ
5 0red ⊢ n ∈ 1 +∞ → 0 ∈ ℝ
6 1red ⊢ n ∈ 1 +∞ → 1 ∈ ℝ
7 0lt1 ⊢ 0 < 1
8 7 a1i ⊢ n ∈ 1 +∞ → 0 < 1
9 3 simprbi ⊢ n ∈ 1 +∞ → 1 ≤ n
10 5 6 4 8 9 ltletrd ⊢ n ∈ 1 +∞ → 0 < n
11 4 10 elrpd ⊢ n ∈ 1 +∞ → n ∈ ℝ +
12 11 ssriv ⊢ 1 +∞ ⊆ ℝ +
13 resmpt ⊢ 1 +∞ ⊆ ℝ + → n ∈ ℝ + ⟼ n A B n ↾ 1 +∞ = n ∈ 1 +∞ ⟼ n A B n
14 12 13 ax-mp ⊢ n ∈ ℝ + ⟼ n A B n ↾ 1 +∞ = n ∈ 1 +∞ ⟼ n A B n
15 0red ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 ∈ ℝ
16 12 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 +∞ ⊆ ℝ +
17 rpre ⊢ n ∈ ℝ + → n ∈ ℝ
18 17 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n ∈ ℝ
19 rpge0 ⊢ n ∈ ℝ + → 0 ≤ n
20 19 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 0 ≤ n
21 simpl2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B ∈ ℝ
22 0red ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 0 ∈ ℝ
23 1red ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 1 ∈ ℝ
24 7 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 0 < 1
25 simpl3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 1 < B
26 22 23 21 24 25 lttrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 0 < B
27 21 26 elrpd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B ∈ ℝ +
28 27 18 rpcxpcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n ∈ ℝ +
29 simp1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → A ∈ ℝ
30 ifcl ⊢ A ∈ ℝ ∧ 1 ∈ ℝ → if 1 ≤ A A 1 ∈ ℝ
31 29 1 30 sylancl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → if 1 ≤ A A 1 ∈ ℝ
32 1red ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 ∈ ℝ
33 7 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 < 1
34 max1 ⊢ 1 ∈ ℝ ∧ A ∈ ℝ → 1 ≤ if 1 ≤ A A 1
35 1 29 34 sylancr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 ≤ if 1 ≤ A A 1
36 15 32 31 33 35 ltletrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 < if 1 ≤ A A 1
37 31 36 elrpd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → if 1 ≤ A A 1 ∈ ℝ +
38 37 rprecred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 if 1 ≤ A A 1 ∈ ℝ
39 38 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 1 if 1 ≤ A A 1 ∈ ℝ
40 28 39 rpcxpcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 if 1 ≤ A A 1 ∈ ℝ +
41 31 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → if 1 ≤ A A 1 ∈ ℂ
42 41 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → if 1 ≤ A A 1 ∈ ℂ
43 18 20 40 42 divcxpd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 = n if 1 ≤ A A 1 B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1
44 37 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → if 1 ≤ A A 1 ∈ ℝ +
45 44 rpne0d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → if 1 ≤ A A 1 ≠ 0
46 42 45 recid2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 1 if 1 ≤ A A 1 ⁢ if 1 ≤ A A 1 = 1
47 46 oveq2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 if 1 ≤ A A 1 ⁢ if 1 ≤ A A 1 = B n 1
48 28 39 42 cxpmuld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 if 1 ≤ A A 1 ⁢ if 1 ≤ A A 1 = B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1
49 28 rpcnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n ∈ ℂ
50 49 cxp1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 = B n
51 47 48 50 3eqtr3d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 = B n
52 51 oveq2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n if 1 ≤ A A 1 B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 = n if 1 ≤ A A 1 B n
53 43 52 eqtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 = n if 1 ≤ A A 1 B n
54 53 mpteq2dva ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 = n ∈ ℝ + ⟼ n if 1 ≤ A A 1 B n
55 ovexd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n B n 1 if 1 ≤ A A 1 ∈ V
56 18 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n ∈ ℂ
57 38 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 if 1 ≤ A A 1 ∈ ℂ
58 57 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → 1 if 1 ≤ A A 1 ∈ ℂ
59 56 58 mulcomd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n ⁢ 1 if 1 ≤ A A 1 = 1 if 1 ≤ A A 1 ⁢ n
60 59 oveq2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n ⁢ 1 if 1 ≤ A A 1 = B 1 if 1 ≤ A A 1 ⁢ n
61 27 18 58 cxpmuld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n ⁢ 1 if 1 ≤ A A 1 = B n 1 if 1 ≤ A A 1
62 27 39 56 cxpmuld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B 1 if 1 ≤ A A 1 ⁢ n = B 1 if 1 ≤ A A 1 n
63 60 61 62 3eqtr3d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → B n 1 if 1 ≤ A A 1 = B 1 if 1 ≤ A A 1 n
64 63 oveq2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n B n 1 if 1 ≤ A A 1 = n B 1 if 1 ≤ A A 1 n
65 64 mpteq2dva ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n B n 1 if 1 ≤ A A 1 = n ∈ ℝ + ⟼ n B 1 if 1 ≤ A A 1 n
66 simp2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → B ∈ ℝ
67 simp3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 < B
68 15 32 66 33 67 lttrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 < B
69 66 68 elrpd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → B ∈ ℝ +
70 69 38 rpcxpcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → B 1 if 1 ≤ A A 1 ∈ ℝ +
71 70 rpred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → B 1 if 1 ≤ A A 1 ∈ ℝ
72 57 1cxpd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 1 if 1 ≤ A A 1 = 1
73 0le1 ⊢ 0 ≤ 1
74 73 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 ≤ 1
75 69 rpge0d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 0 ≤ B
76 37 rpreccld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 if 1 ≤ A A 1 ∈ ℝ +
77 32 74 66 75 76 cxplt2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 < B ↔ 1 1 if 1 ≤ A A 1 < B 1 if 1 ≤ A A 1
78 67 77 mpbid ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 1 if 1 ≤ A A 1 < B 1 if 1 ≤ A A 1
79 72 78 eqbrtrrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → 1 < B 1 if 1 ≤ A A 1
80 cxp2limlem ⊢ B 1 if 1 ≤ A A 1 ∈ ℝ ∧ 1 < B 1 if 1 ≤ A A 1 → n ∈ ℝ + ⟼ n B 1 if 1 ≤ A A 1 n ⇝ℝ 0
81 71 79 80 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n B 1 if 1 ≤ A A 1 n ⇝ℝ 0
82 65 81 eqbrtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n B n 1 if 1 ≤ A A 1 ⇝ℝ 0
83 55 82 37 rlimcxp ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n B n 1 if 1 ≤ A A 1 if 1 ≤ A A 1 ⇝ℝ 0
84 54 83 eqbrtrrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n if 1 ≤ A A 1 B n ⇝ℝ 0
85 16 84 rlimres2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ 1 +∞ ⟼ n if 1 ≤ A A 1 B n ⇝ℝ 0
86 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n ∈ ℝ +
87 31 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → if 1 ≤ A A 1 ∈ ℝ
88 86 87 rpcxpcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n if 1 ≤ A A 1 ∈ ℝ +
89 88 28 rpdivcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n if 1 ≤ A A 1 B n ∈ ℝ +
90 89 rpred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n if 1 ≤ A A 1 B n ∈ ℝ
91 11 90 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n if 1 ≤ A A 1 B n ∈ ℝ
92 simpl1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → A ∈ ℝ
93 86 92 rpcxpcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n A ∈ ℝ +
94 93 28 rpdivcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n A B n ∈ ℝ +
95 11 94 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A B n ∈ ℝ +
96 95 rpred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A B n ∈ ℝ
97 11 93 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A ∈ ℝ +
98 97 rpred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A ∈ ℝ
99 11 88 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n if 1 ≤ A A 1 ∈ ℝ +
100 99 rpred ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n if 1 ≤ A A 1 ∈ ℝ
101 11 28 sylan2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → B n ∈ ℝ +
102 4 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n ∈ ℝ
103 9 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → 1 ≤ n
104 simpl1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → A ∈ ℝ
105 31 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → if 1 ≤ A A 1 ∈ ℝ
106 max2 ⊢ 1 ∈ ℝ ∧ A ∈ ℝ → A ≤ if 1 ≤ A A 1
107 1 104 106 sylancr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → A ≤ if 1 ≤ A A 1
108 102 103 104 105 107 cxplead ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A ≤ n if 1 ≤ A A 1
109 98 100 101 108 lediv1dd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → n A B n ≤ n if 1 ≤ A A 1 B n
110 109 adantrr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ ∧ 0 ≤ n → n A B n ≤ n if 1 ≤ A A 1 B n
111 95 rpge0d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ → 0 ≤ n A B n
112 111 adantrr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ 1 +∞ ∧ 0 ≤ n → 0 ≤ n A B n
113 15 15 85 91 96 110 112 rlimsqz2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ 1 +∞ ⟼ n A B n ⇝ℝ 0
114 14 113 eqbrtrid ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n A B n ↾ 1 +∞ ⇝ℝ 0
115 94 rpcnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B ∧ n ∈ ℝ + → n A B n ∈ ℂ
116 115 fmpttd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n A B n : ℝ + ⟶ ℂ
117 rpssre ⊢ ℝ + ⊆ ℝ
118 117 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → ℝ + ⊆ ℝ
119 116 118 32 rlimresb ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n A B n ⇝ℝ 0 ↔ n ∈ ℝ + ⟼ n A B n ↾ 1 +∞ ⇝ℝ 0
120 114 119 mpbird ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 1 < B → n ∈ ℝ + ⟼ n A B n ⇝ℝ 0