Theorem expcnvre 12295

Description: A sequence of powers of a nonnegative real number less than one converges to zero. (Contributed by Jim Kingdon, 28-Oct-2022.)

Hypotheses

Ref	Expression
expcnvre.ar	|- ( ph -> A e. RR )
expcnvre.a1	|- ( ph -> A < 1 )
expcnvre.a0	|- ( ph -> 0 <_ A )

Assertion

Ref	Expression
expcnvre	|- ( ph -> ( n e. NN0 |-> ( A ^ n ) ) ~~> 0 )

Distinct variable group:   A, n

Allowed substitution hint:   ph( n)

Proof of Theorem expcnvre

Dummy variables k x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		expcnvre.ar	. . 3 |- ( ph -> A e. RR )
2		1red 8347	. . 3 |- ( ph -> 1 e. RR )
3		expcnvre.a1	. . 3 |- ( ph -> A < 1 )
4		qbtwnre 10708	. . 3 |- ( ( A e. RR /\ 1 e. RR /\ A < 1 ) -> E. x e. QQ ( A < x /\ x < 1 ) )
5	1, 2, 3, 4	syl3anc 1278	. 2 |- ( ph -> E. x e. QQ ( A < x /\ x < 1 ) )
6		nn0uz 9973	. . 3 |- NN0 = ( ZZ>= ` 0 )
7		0zd 9667	. . 3 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> 0 e. ZZ )
8		qre 10041	. . . . . 6 |- ( x e. QQ -> x e. RR )
9	8	ad2antrl 494	. . . . 5 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> x e. RR )
10	9	recnd 8360	. . . 4 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> x e. CC )
11		0red 8333	. . . . . . 7 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> 0 e. RR )
12	1	adantr 276	. . . . . . . 8 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> A e. RR )
13		expcnvre.a0	. . . . . . . . 9 |- ( ph -> 0 <_ A )
14	13	adantr 276	. . . . . . . 8 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> 0 <_ A )
15		simprrl 545	. . . . . . . 8 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> A < x )
16	11, 12, 9, 14, 15	lelttrd 8458	. . . . . . 7 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> 0 < x )
17	11, 9, 16	ltled 8452	. . . . . 6 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> 0 <_ x )
18	9, 17	absidd 11956	. . . . 5 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> ( abs ` x ) = x )
19		simprrr 546	. . . . 5 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> x < 1 )
20	18, 19	eqbrtrd 4153	. . . 4 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> ( abs ` x ) < 1 )
21	9, 16	gt0ap0d 8965	. . . 4 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> x # 0 )
22	10, 20, 21	expcnvap0 12294	. . 3 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> ( n e. NN0 |-> ( x ^ n ) ) ~~> 0 )
23		nn0ex 9580	. . . . 5 |- NN0 e. _V
24	23	mptex 5946	. . . 4 |- ( n e. NN0 |-> ( A ^ n ) ) e. _V
25	24	a1i 9	. . 3 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> ( n e. NN0 |-> ( A ^ n ) ) e. _V )
26		simpr 110	. . . . 5 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> k e. NN0 )
27	9	adantr 276	. . . . . 6 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> x e. RR )
28	27, 26	reexpcld 11149	. . . . 5 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( x ^ k ) e. RR )
29		oveq2 6096	. . . . . 6 |- ( n = k -> ( x ^ n ) = ( x ^ k ) )
30		eqid 2238	. . . . . 6 |- ( n e. NN0 |-> ( x ^ n ) ) = ( n e. NN0 |-> ( x ^ n ) )
31	29, 30	fvmptg 5784	. . . . 5 |- ( ( k e. NN0 /\ ( x ^ k ) e. RR ) -> ( ( n e. NN0 |-> ( x ^ n ) ) ` k ) = ( x ^ k ) )
32	26, 28, 31	syl2anc 415	. . . 4 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( ( n e. NN0 |-> ( x ^ n ) ) ` k ) = ( x ^ k ) )
33	32, 28	eqeltrd 2315	. . 3 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( ( n e. NN0 |-> ( x ^ n ) ) ` k ) e. RR )
34	12	adantr 276	. . . . . 6 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> A e. RR )
35	34, 26	reexpcld 11149	. . . . 5 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( A ^ k ) e. RR )
36		oveq2 6096	. . . . . 6 |- ( n = k -> ( A ^ n ) = ( A ^ k ) )
37		eqid 2238	. . . . . 6 |- ( n e. NN0 |-> ( A ^ n ) ) = ( n e. NN0 |-> ( A ^ n ) )
38	36, 37	fvmptg 5784	. . . . 5 |- ( ( k e. NN0 /\ ( A ^ k ) e. RR ) -> ( ( n e. NN0 |-> ( A ^ n ) ) ` k ) = ( A ^ k ) )
39	26, 35, 38	syl2anc 415	. . . 4 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( ( n e. NN0 |-> ( A ^ n ) ) ` k ) = ( A ^ k ) )
40	39, 35	eqeltrd 2315	. . 3 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( ( n e. NN0 |-> ( A ^ n ) ) ` k ) e. RR )
41	14	adantr 276	. . . . 5 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> 0 <_ A )
42	15	adantr 276	. . . . . 6 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> A < x )
43	34, 27, 42	ltled 8452	. . . . 5 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> A <_ x )
44		leexp1a 11052	. . . . 5 |- ( ( ( A e. RR /\ x e. RR /\ k e. NN0 ) /\ ( 0 <_ A /\ A <_ x ) ) -> ( A ^ k ) <_ ( x ^ k ) )
45	34, 27, 26, 41, 43, 44	syl32anc 1286	. . . 4 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( A ^ k ) <_ ( x ^ k ) )
46	45, 39, 32	3brtr4d 4163	. . 3 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> ( ( n e. NN0 |-> ( A ^ n ) ) ` k ) <_ ( ( n e. NN0 |-> ( x ^ n ) ) ` k ) )
47	34, 26, 41	expge0d 11150	. . . 4 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> 0 <_ ( A ^ k ) )
48	47, 39	breqtrrd 4159	. . 3 |- ( ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) /\ k e. NN0 ) -> 0 <_ ( ( n e. NN0 |-> ( A ^ n ) ) ` k ) )
49	6, 7, 22, 25, 33, 40, 46, 48	climsqz2 12127	. 2 |- ( ( ph /\ ( x e. QQ /\ ( A < x /\ x < 1 ) ) ) -> ( n e. NN0 |-> ( A ^ n ) ) ~~> 0 )
50	5, 49	rexlimddv 2673	1 |- ( ph -> ( n e. NN0 |-> ( A ^ n ) ) ~~> 0 )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   E.wrex 2529   _Vcvv 2821   class class class wbr 4131   |-> cmpt 4193   ` cfv 5380  (class class class)co 6088   RRcr 8184   0cc0 8185   1c1 8186   < clt 8366   <_ cle 8367   NN0cn0 9574   QQcq 10035   ^cexp 10996   abscabs 11785   ~~> cli 12069

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-clim 12070

This theorem is used by:  expcnv  12296