MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  facubnd Unicode version

Theorem facubnd 11329
Description: An upper bound for the factorial function. (Contributed by Mario Carneiro, 15-Apr-2016.)
Assertion
Ref Expression
facubnd  |-  ( N  e.  NN0  ->  ( ! `
 N )  <_ 
( N ^ N
) )

Proof of Theorem facubnd
Dummy variables  m  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5541 . . . 4  |-  ( m  =  0  ->  ( ! `  m )  =  ( ! ` 
0 ) )
2 fac0 11307 . . . 4  |-  ( ! `
 0 )  =  1
31, 2syl6eq 2344 . . 3  |-  ( m  =  0  ->  ( ! `  m )  =  1 )
4 id 19 . . . . 5  |-  ( m  =  0  ->  m  =  0 )
54, 4oveq12d 5892 . . . 4  |-  ( m  =  0  ->  (
m ^ m )  =  ( 0 ^ 0 ) )
6 0cn 8847 . . . . 5  |-  0  e.  CC
7 exp0 11124 . . . . 5  |-  ( 0  e.  CC  ->  (
0 ^ 0 )  =  1 )
86, 7ax-mp 8 . . . 4  |-  ( 0 ^ 0 )  =  1
95, 8syl6eq 2344 . . 3  |-  ( m  =  0  ->  (
m ^ m )  =  1 )
103, 9breq12d 4052 . 2  |-  ( m  =  0  ->  (
( ! `  m
)  <_  ( m ^ m )  <->  1  <_  1 ) )
11 fveq2 5541 . . 3  |-  ( m  =  k  ->  ( ! `  m )  =  ( ! `  k ) )
12 id 19 . . . 4  |-  ( m  =  k  ->  m  =  k )
1312, 12oveq12d 5892 . . 3  |-  ( m  =  k  ->  (
m ^ m )  =  ( k ^
k ) )
1411, 13breq12d 4052 . 2  |-  ( m  =  k  ->  (
( ! `  m
)  <_  ( m ^ m )  <->  ( ! `  k )  <_  (
k ^ k ) ) )
15 fveq2 5541 . . 3  |-  ( m  =  ( k  +  1 )  ->  ( ! `  m )  =  ( ! `  ( k  +  1 ) ) )
16 id 19 . . . 4  |-  ( m  =  ( k  +  1 )  ->  m  =  ( k  +  1 ) )
1716, 16oveq12d 5892 . . 3  |-  ( m  =  ( k  +  1 )  ->  (
m ^ m )  =  ( ( k  +  1 ) ^
( k  +  1 ) ) )
1815, 17breq12d 4052 . 2  |-  ( m  =  ( k  +  1 )  ->  (
( ! `  m
)  <_  ( m ^ m )  <->  ( ! `  ( k  +  1 ) )  <_  (
( k  +  1 ) ^ ( k  +  1 ) ) ) )
19 fveq2 5541 . . 3  |-  ( m  =  N  ->  ( ! `  m )  =  ( ! `  N ) )
20 id 19 . . . 4  |-  ( m  =  N  ->  m  =  N )
2120, 20oveq12d 5892 . . 3  |-  ( m  =  N  ->  (
m ^ m )  =  ( N ^ N ) )
2219, 21breq12d 4052 . 2  |-  ( m  =  N  ->  (
( ! `  m
)  <_  ( m ^ m )  <->  ( ! `  N )  <_  ( N ^ N ) ) )
23 1le1 9412 . 2  |-  1  <_  1
24 faccl 11314 . . . . . . . 8  |-  ( k  e.  NN0  ->  ( ! `
 k )  e.  NN )
2524adantr 451 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  k
)  e.  NN )
2625nnred 9777 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  k
)  e.  RR )
27 nn0re 9990 . . . . . . . 8  |-  ( k  e.  NN0  ->  k  e.  RR )
2827adantr 451 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
k  e.  RR )
29 simpl 443 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
k  e.  NN0 )
3028, 29reexpcld 11278 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( k ^ k
)  e.  RR )
31 nn0p1nn 10019 . . . . . . . . 9  |-  ( k  e.  NN0  ->  ( k  +  1 )  e.  NN )
3231adantr 451 . . . . . . . 8  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( k  +  1 )  e.  NN )
3332nnred 9777 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( k  +  1 )  e.  RR )
3433, 29reexpcld 11278 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ( k  +  1 ) ^ k
)  e.  RR )
35 simpr 447 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  k
)  <_  ( k ^ k ) )
36 nn0ge0 10007 . . . . . . . 8  |-  ( k  e.  NN0  ->  0  <_ 
k )
3736adantr 451 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
0  <_  k )
3828lep1d 9704 . . . . . . 7  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
k  <_  ( k  +  1 ) )
39 leexp1a 11176 . . . . . . 7  |-  ( ( ( k  e.  RR  /\  ( k  +  1 )  e.  RR  /\  k  e.  NN0 )  /\  ( 0  <_  k  /\  k  <_  ( k  +  1 ) ) )  ->  ( k ^ k )  <_ 
( ( k  +  1 ) ^ k
) )
4028, 33, 29, 37, 38, 39syl32anc 1190 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( k ^ k
)  <_  ( (
k  +  1 ) ^ k ) )
4126, 30, 34, 35, 40letrd 8989 . . . . 5  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  k
)  <_  ( (
k  +  1 ) ^ k ) )
4232nngt0d 9805 . . . . . 6  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
0  <  ( k  +  1 ) )
43 lemul1 9624 . . . . . 6  |-  ( ( ( ! `  k
)  e.  RR  /\  ( ( k  +  1 ) ^ k
)  e.  RR  /\  ( ( k  +  1 )  e.  RR  /\  0  <  ( k  +  1 ) ) )  ->  ( ( ! `  k )  <_  ( ( k  +  1 ) ^ k
)  <->  ( ( ! `
 k )  x.  ( k  +  1 ) )  <_  (
( ( k  +  1 ) ^ k
)  x.  ( k  +  1 ) ) ) )
4426, 34, 33, 42, 43syl112anc 1186 . . . . 5  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ( ! `  k )  <_  (
( k  +  1 ) ^ k )  <-> 
( ( ! `  k )  x.  (
k  +  1 ) )  <_  ( (
( k  +  1 ) ^ k )  x.  ( k  +  1 ) ) ) )
4541, 44mpbid 201 . . . 4  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ( ! `  k )  x.  (
k  +  1 ) )  <_  ( (
( k  +  1 ) ^ k )  x.  ( k  +  1 ) ) )
46 facp1 11309 . . . . 5  |-  ( k  e.  NN0  ->  ( ! `
 ( k  +  1 ) )  =  ( ( ! `  k )  x.  (
k  +  1 ) ) )
4746adantr 451 . . . 4  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  (
k  +  1 ) )  =  ( ( ! `  k )  x.  ( k  +  1 ) ) )
4832nncnd 9778 . . . . 5  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( k  +  1 )  e.  CC )
4948, 29expp1d 11262 . . . 4  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ( k  +  1 ) ^ (
k  +  1 ) )  =  ( ( ( k  +  1 ) ^ k )  x.  ( k  +  1 ) ) )
5045, 47, 493brtr4d 4069 . . 3  |-  ( ( k  e.  NN0  /\  ( ! `  k )  <_  ( k ^
k ) )  -> 
( ! `  (
k  +  1 ) )  <_  ( (
k  +  1 ) ^ ( k  +  1 ) ) )
5150ex 423 . 2  |-  ( k  e.  NN0  ->  ( ( ! `  k )  <_  ( k ^
k )  ->  ( ! `  ( k  +  1 ) )  <_  ( ( k  +  1 ) ^
( k  +  1 ) ) ) )
5210, 14, 18, 22, 23, 51nn0ind 10124 1  |-  ( N  e.  NN0  ->  ( ! `
 N )  <_ 
( N ^ N
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   class class class wbr 4039   ` cfv 5271  (class class class)co 5874   CCcc 8751   RRcr 8752   0cc0 8753   1c1 8754    + caddc 8756    x. cmul 8758    < clt 8883    <_ cle 8884   NNcn 9762   NN0cn0 9981   ^cexp 11120   !cfa 11304
This theorem is referenced by:  logfacubnd  20476
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-cnex 8809  ax-resscn 8810  ax-1cn 8811  ax-icn 8812  ax-addcl 8813  ax-addrcl 8814  ax-mulcl 8815  ax-mulrcl 8816  ax-mulcom 8817  ax-addass 8818  ax-mulass 8819  ax-distr 8820  ax-i2m1 8821  ax-1ne0 8822  ax-1rid 8823  ax-rnegex 8824  ax-rrecex 8825  ax-cnre 8826  ax-pre-lttri 8827  ax-pre-lttrn 8828  ax-pre-ltadd 8829  ax-pre-mulgt0 8830
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-nel 2462  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-2nd 6139  df-riota 6320  df-recs 6404  df-rdg 6439  df-er 6676  df-en 6880  df-dom 6881  df-sdom 6882  df-pnf 8885  df-mnf 8886  df-xr 8887  df-ltxr 8888  df-le 8889  df-sub 9055  df-neg 9056  df-nn 9763  df-n0 9982  df-z 10041  df-uz 10247  df-seq 11063  df-exp 11121  df-fac 11305
  Copyright terms: Public domain W3C validator