ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  exp3val Unicode version

Theorem exp3val 10978
Description: Value of exponentiation to integer powers. (Contributed by Jim Kingdon, 7-Jun-2020.)
Assertion
Ref Expression
exp3val  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  -> 
( A ^ N
)  =  if ( N  =  0 ,  1 ,  if ( 0  <  N , 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) ) )

Proof of Theorem exp3val
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1cnd 8342 . . 3  |-  ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  N  =  0 )  ->  1  e.  CC )
2 simp1 1028 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  ->  A  e.  CC )
3 nnuz 9958 . . . . . . . 8  |-  NN  =  ( ZZ>= `  1 )
4 1zzd 9671 . . . . . . . 8  |-  ( A  e.  CC  ->  1  e.  ZZ )
5 fvconst2g 5929 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  x  e.  NN )  ->  ( ( NN  X.  { A } ) `  x )  =  A )
6 simpl 109 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  x  e.  NN )  ->  A  e.  CC )
75, 6eqeltrd 2315 . . . . . . . 8  |-  ( ( A  e.  CC  /\  x  e.  NN )  ->  ( ( NN  X.  { A } ) `  x )  e.  CC )
8 mulcl 8306 . . . . . . . . 9  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( x  x.  y
)  e.  CC )
98adantl 277 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( x  e.  CC  /\  y  e.  CC ) )  ->  ( x  x.  y )  e.  CC )
103, 4, 7, 9seqf 10901 . . . . . . 7  |-  ( A  e.  CC  ->  seq 1 (  x.  , 
( NN  X.  { A } ) ) : NN --> CC )
112, 10syl 14 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  ->  seq 1 (  x.  , 
( NN  X.  { A } ) ) : NN --> CC )
1211ad2antrr 492 . . . . 5  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  0  <  N )  ->  seq 1
(  x.  ,  ( NN  X.  { A } ) ) : NN --> CC )
13 simp2 1029 . . . . . . 7  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  ->  N  e.  ZZ )
1413ad2antrr 492 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  0  <  N )  ->  N  e.  ZZ )
15 simpr 110 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  0  <  N )  ->  0  <  N )
16 elnnz 9654 . . . . . 6  |-  ( N  e.  NN  <->  ( N  e.  ZZ  /\  0  < 
N ) )
1714, 15, 16sylanbrc 421 . . . . 5  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  0  <  N )  ->  N  e.  NN )
1812, 17ffvelcdmd 5844 . . . 4  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  0  <  N )  ->  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  N )  e.  CC )
1911ad2antrr 492 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  seq 1 (  x.  , 
( NN  X.  { A } ) ) : NN --> CC )
2013ad2antrr 492 . . . . . . . 8  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  N  e.  ZZ )
2120znegcld 9770 . . . . . . 7  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -u N  e.  ZZ )
22 simpr 110 . . . . . . . . . . 11  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -.  0  <  N )
23 simplr 533 . . . . . . . . . . . 12  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -.  N  =  0 )
24 eqcom 2240 . . . . . . . . . . . 12  |-  ( N  =  0  <->  0  =  N )
2523, 24sylnib 687 . . . . . . . . . . 11  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -.  0  =  N )
26 ioran 764 . . . . . . . . . . 11  |-  ( -.  ( 0  <  N  \/  0  =  N
)  <->  ( -.  0  <  N  /\  -.  0  =  N ) )
2722, 25, 26sylanbrc 421 . . . . . . . . . 10  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -.  ( 0  <  N  \/  0  =  N
) )
28 0zd 9656 . . . . . . . . . . 11  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  0  e.  ZZ )
29 zleloe 9691 . . . . . . . . . . 11  |-  ( ( 0  e.  ZZ  /\  N  e.  ZZ )  ->  ( 0  <_  N  <->  ( 0  <  N  \/  0  =  N )
) )
3028, 20, 29syl2anc 415 . . . . . . . . . 10  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  (
0  <_  N  <->  ( 0  <  N  \/  0  =  N ) ) )
3127, 30mtbird 684 . . . . . . . . 9  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -.  0  <_  N )
32 zltnle 9690 . . . . . . . . . 10  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  ->  ( N  <  0  <->  -.  0  <_  N )
)
3320, 28, 32syl2anc 415 . . . . . . . . 9  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  ( N  <  0  <->  -.  0  <_  N ) )
3431, 33mpbird 167 . . . . . . . 8  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  N  <  0 )
3520zred 9768 . . . . . . . . 9  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  N  e.  RR )
3635lt0neg1d 8843 . . . . . . . 8  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  ( N  <  0  <->  0  <  -u N ) )
3734, 36mpbid 147 . . . . . . 7  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  0  <  -u N )
38 elnnz 9654 . . . . . . 7  |-  ( -u N  e.  NN  <->  ( -u N  e.  ZZ  /\  0  <  -u N ) )
3921, 37, 38sylanbrc 421 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  -u N  e.  NN )
4019, 39ffvelcdmd 5844 . . . . 5  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N )  e.  CC )
412ad2antrr 492 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  A  e.  CC )
42 simpll3 1069 . . . . . . 7  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  ( A #  0  \/  0  <_  N ) )
4331, 42ecased 1390 . . . . . 6  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  A #  0 )
4441, 43, 39exp3vallem 10977 . . . . 5  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) #  0 )
4540, 44recclapd 9111 . . . 4  |-  ( ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0
)  /\  -.  0  <  N )  ->  (
1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) )  e.  CC )
46 0zd 9656 . . . . 5  |-  ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0 )  ->  0  e.  ZZ )
47 simpl2 1032 . . . . 5  |-  ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0 )  ->  N  e.  ZZ )
48 zdclt 9722 . . . . 5  |-  ( ( 0  e.  ZZ  /\  N  e.  ZZ )  -> DECID  0  <  N )
4946, 47, 48syl2anc 415 . . . 4  |-  ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0 )  -> DECID  0  <  N )
5018, 45, 49ifcldadc 3670 . . 3  |-  ( ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  /\  -.  N  =  0 )  ->  if ( 0  <  N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) )  e.  CC )
51 0zd 9656 . . . 4  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  -> 
0  e.  ZZ )
52 zdceq 9720 . . . 4  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  -> DECID  N  =  0 )
5313, 51, 52syl2anc 415 . . 3  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  -> DECID  N  =  0 )
541, 50, 53ifcldadc 3670 . 2  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  ->  if ( N  =  0 ,  1 ,  if ( 0  <  N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) )  e.  CC )
55 sneq 3720 . . . . . . . 8  |-  ( x  =  A  ->  { x }  =  { A } )
5655xpeq2d 4798 . . . . . . 7  |-  ( x  =  A  ->  ( NN  X.  { x }
)  =  ( NN 
X.  { A }
) )
5756seqeq3d 10892 . . . . . 6  |-  ( x  =  A  ->  seq 1 (  x.  , 
( NN  X.  {
x } ) )  =  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) )
5857fveq1d 5697 . . . . 5  |-  ( x  =  A  ->  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 y )  =  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  y
) )
5957fveq1d 5697 . . . . . 6  |-  ( x  =  A  ->  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 -u y )  =  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  -u y
) )
6059oveq2d 6101 . . . . 5  |-  ( x  =  A  ->  (
1  /  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 -u y ) )  =  ( 1  / 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u y ) ) )
6158, 60ifeq12d 3660 . . . 4  |-  ( x  =  A  ->  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { x } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 -u y ) ) )  =  if ( 0  <  y ,  (  seq 1 (  x.  ,  ( NN 
X.  { A }
) ) `  y
) ,  ( 1  /  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  -u y ) ) ) )
6261ifeq2d 3659 . . 3  |-  ( x  =  A  ->  if ( y  =  0 ,  1 ,  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { x } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 -u y ) ) ) )  =  if ( y  =  0 ,  1 ,  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u y ) ) ) ) )
63 eqeq1 2245 . . . 4  |-  ( y  =  N  ->  (
y  =  0  <->  N  =  0 ) )
64 breq2 4134 . . . . 5  |-  ( y  =  N  ->  (
0  <  y  <->  0  <  N ) )
65 fveq2 5695 . . . . 5  |-  ( y  =  N  ->  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  y )  =  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) )
66 negeq 8519 . . . . . . 7  |-  ( y  =  N  ->  -u y  =  -u N )
6766fveq2d 5699 . . . . . 6  |-  ( y  =  N  ->  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u y )  =  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 -u N ) )
6867oveq2d 6101 . . . . 5  |-  ( y  =  N  ->  (
1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u y ) )  =  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) )
6964, 65, 68ifbieq12d 3667 . . . 4  |-  ( y  =  N  ->  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u y ) ) )  =  if ( 0  <  N ,  (  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) )
7063, 69ifbieq2d 3665 . . 3  |-  ( y  =  N  ->  if ( y  =  0 ,  1 ,  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u y ) ) ) )  =  if ( N  =  0 ,  1 ,  if ( 0  <  N , 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) ) )
71 df-exp 10976 . . 3  |-  ^  =  ( x  e.  CC ,  y  e.  ZZ  |->  if ( y  =  0 ,  1 ,  if ( 0  <  y ,  (  seq 1
(  x.  ,  ( NN  X.  { x } ) ) `  y ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  {
x } ) ) `
 -u y ) ) ) ) )
7262, 70, 71ovmpog 6223 . 2  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  if ( N  =  0 ,  1 ,  if ( 0  <  N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) )  e.  CC )  ->  ( A ^ N )  =  if ( N  =  0 ,  1 ,  if ( 0  <  N ,  (  seq 1
(  x.  ,  ( NN  X.  { A } ) ) `  N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) ) )
7354, 72syld3an3 1323 1  |-  ( ( A  e.  CC  /\  N  e.  ZZ  /\  ( A #  0  \/  0  <_  N ) )  -> 
( A ^ N
)  =  if ( N  =  0 ,  1 ,  if ( 0  <  N , 
(  seq 1 (  x.  ,  ( NN  X.  { A } ) ) `
 N ) ,  ( 1  /  (  seq 1 (  x.  , 
( NN  X.  { A } ) ) `  -u N ) ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720  DECID wdc 846    /\ w3a 1009    = wceq 1402    e. wcel 2209   ifcif 3638   {csn 3709   class class class wbr 4130    X. cxp 4772   -->wf 5373   ` cfv 5377  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180    x. cmul 8184    < clt 8360    <_ cle 8361   -ucneg 8498   # cap 8909    / cdiv 9002   NNcn 9304   ZZcz 9644    seqcseq 10884   ^cexp 10975
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-seqfrec 10885  df-exp 10976
This theorem is used by:  expnnval  10979  exp0  10980  expnegap0  10984
  Copyright terms: Public domain W3C validator