Metamath Proof Explorer


Theorem cxplim

Description: A power to a negative exponent goes to zero as the base becomes large. (Contributed by Mario Carneiro, 15-Sep-2014) (Revised by Mario Carneiro, 18-May-2016)

Ref Expression
Assertion cxplim ⊢ A ∈ ℝ + → n ∈ ℝ + ⟼ 1 n A ⇝ℝ 0

Proof

Step Hyp Ref Expression
1 rpre ⊢ x ∈ ℝ + → x ∈ ℝ
2 1 adantl ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → x ∈ ℝ
3 rpge0 ⊢ x ∈ ℝ + → 0 ≤ x
4 3 adantl ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → 0 ≤ x
5 rpre ⊢ A ∈ ℝ + → A ∈ ℝ
6 5 renegcld ⊢ A ∈ ℝ + → − A ∈ ℝ
7 6 adantr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → − A ∈ ℝ
8 rpcn ⊢ A ∈ ℝ + → A ∈ ℂ
9 rpne0 ⊢ A ∈ ℝ + → A ≠ 0
10 8 9 negne0d ⊢ A ∈ ℝ + → − A ≠ 0
11 10 adantr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → − A ≠ 0
12 7 11 rereccld ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → 1 − A ∈ ℝ
13 2 4 12 recxpcld ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → x 1 − A ∈ ℝ
14 simprl ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n ∈ ℝ +
15 5 ad2antrr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → A ∈ ℝ
16 14 15 rpcxpcld ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n A ∈ ℝ +
17 16 rpreccld ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 n A ∈ ℝ +
18 17 rprege0d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 n A ∈ ℝ ∧ 0 ≤ 1 n A
19 absid ⊢ 1 n A ∈ ℝ ∧ 0 ≤ 1 n A → 1 n A = 1 n A
20 18 19 syl ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 n A = 1 n A
21 simplr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x ∈ ℝ +
22 simprr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x 1 − A < n
23 rpreccl ⊢ A ∈ ℝ + → 1 A ∈ ℝ +
24 23 ad2antrr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 A ∈ ℝ +
25 24 rpcnd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 A ∈ ℂ
26 21 25 cxprecd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x 1 A = 1 x 1 A
27 rpcn ⊢ x ∈ ℝ + → x ∈ ℂ
28 27 ad2antlr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x ∈ ℂ
29 rpne0 ⊢ x ∈ ℝ + → x ≠ 0
30 29 ad2antlr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x ≠ 0
31 28 30 25 cxpnegd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x − 1 A = 1 x 1 A
32 1cnd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 ∈ ℂ
33 8 ad2antrr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → A ∈ ℂ
34 9 ad2antrr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → A ≠ 0
35 32 33 34 divneg2d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → − 1 A = 1 − A
36 35 oveq2d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → x − 1 A = x 1 − A
37 26 31 36 3eqtr2d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x 1 A = x 1 − A
38 33 34 recidd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → A ⁢ 1 A = 1
39 38 oveq2d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n A ⁢ 1 A = n 1
40 14 15 25 cxpmuld ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n A ⁢ 1 A = n A 1 A
41 14 rpcnd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n ∈ ℂ
42 41 cxp1d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n 1 = n
43 39 40 42 3eqtr3d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n A 1 A = n
44 22 37 43 3brtr4d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x 1 A < n A 1 A
45 rpreccl ⊢ x ∈ ℝ + → 1 x ∈ ℝ +
46 45 ad2antlr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x ∈ ℝ +
47 46 rpred ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x ∈ ℝ
48 46 rpge0d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 0 ≤ 1 x
49 16 rpred ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → n A ∈ ℝ
50 16 rpge0d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 0 ≤ n A
51 47 48 49 50 24 cxplt2d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x < n A ↔ 1 x 1 A < n A 1 A
52 44 51 mpbird ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 x < n A
53 21 16 52 ltrec1d ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 n A < x
54 20 53 eqbrtrd ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + ∧ x 1 − A < n → 1 n A < x
55 54 expr ⊢ A ∈ ℝ + ∧ x ∈ ℝ + ∧ n ∈ ℝ + → x 1 − A < n → 1 n A < x
56 55 ralrimiva ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → ∀ n ∈ ℝ + x 1 − A < n → 1 n A < x
57 breq1 ⊢ y = x 1 − A → y < n ↔ x 1 − A < n
58 57 rspceaimv ⊢ x 1 − A ∈ ℝ ∧ ∀ n ∈ ℝ + x 1 − A < n → 1 n A < x → ∃ y ∈ ℝ ∀ n ∈ ℝ + y < n → 1 n A < x
59 13 56 58 syl2anc ⊢ A ∈ ℝ + ∧ x ∈ ℝ + → ∃ y ∈ ℝ ∀ n ∈ ℝ + y < n → 1 n A < x
60 59 ralrimiva ⊢ A ∈ ℝ + → ∀ x ∈ ℝ + ∃ y ∈ ℝ ∀ n ∈ ℝ + y < n → 1 n A < x
61 id ⊢ n ∈ ℝ + → n ∈ ℝ +
62 rpcxpcl ⊢ n ∈ ℝ + ∧ A ∈ ℝ → n A ∈ ℝ +
63 61 5 62 syl2anr ⊢ A ∈ ℝ + ∧ n ∈ ℝ + → n A ∈ ℝ +
64 63 rpreccld ⊢ A ∈ ℝ + ∧ n ∈ ℝ + → 1 n A ∈ ℝ +
65 64 rpcnd ⊢ A ∈ ℝ + ∧ n ∈ ℝ + → 1 n A ∈ ℂ
66 65 ralrimiva ⊢ A ∈ ℝ + → ∀ n ∈ ℝ + 1 n A ∈ ℂ
67 rpssre ⊢ ℝ + ⊆ ℝ
68 67 a1i ⊢ A ∈ ℝ + → ℝ + ⊆ ℝ
69 66 68 rlim0lt ⊢ A ∈ ℝ + → n ∈ ℝ + ⟼ 1 n A ⇝ℝ 0 ↔ ∀ x ∈ ℝ + ∃ y ∈ ℝ ∀ n ∈ ℝ + y < n → 1 n A < x
70 60 69 mpbird ⊢ A ∈ ℝ + → n ∈ ℝ + ⟼ 1 n A ⇝ℝ 0