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

Theorem monoord2 10491
Description: Ordering relation for a monotonic sequence, decreasing case. (Contributed by Mario Carneiro, 18-Jul-2014.)
Hypotheses
Ref Expression
monoord2.1  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
monoord2.2  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  ( F `  k )  e.  RR )
monoord2.3  |-  ( (
ph  /\  k  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( k  +  1 ) )  <_  ( F `  k )
)
Assertion
Ref Expression
monoord2  |-  ( ph  ->  ( F `  N
)  <_  ( F `  M ) )
Distinct variable groups:    k, F    k, M    k, N    ph, k

Proof of Theorem monoord2
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 monoord2.1 . . . 4  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
2 monoord2.2 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  ( F `  k )  e.  RR )
32renegcld 8351 . . . . . 6  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  -u ( F `
 k )  e.  RR )
4 eqid 2187 . . . . . 6  |-  ( k  e.  ( M ... N )  |->  -u ( F `  k )
)  =  ( k  e.  ( M ... N )  |->  -u ( F `  k )
)
53, 4fmptd 5683 . . . . 5  |-  ( ph  ->  ( k  e.  ( M ... N ) 
|->  -u ( F `  k ) ) : ( M ... N
) --> RR )
65ffvelcdmda 5664 . . . 4  |-  ( (
ph  /\  n  e.  ( M ... N ) )  ->  ( (
k  e.  ( M ... N )  |->  -u ( F `  k ) ) `  n )  e.  RR )
7 monoord2.3 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( k  +  1 ) )  <_  ( F `  k )
)
87ralrimiva 2560 . . . . . . . 8  |-  ( ph  ->  A. k  e.  ( M ... ( N  -  1 ) ) ( F `  (
k  +  1 ) )  <_  ( F `  k ) )
9 oveq1 5895 . . . . . . . . . . 11  |-  ( k  =  n  ->  (
k  +  1 )  =  ( n  + 
1 ) )
109fveq2d 5531 . . . . . . . . . 10  |-  ( k  =  n  ->  ( F `  ( k  +  1 ) )  =  ( F `  ( n  +  1
) ) )
11 fveq2 5527 . . . . . . . . . 10  |-  ( k  =  n  ->  ( F `  k )  =  ( F `  n ) )
1210, 11breq12d 4028 . . . . . . . . 9  |-  ( k  =  n  ->  (
( F `  (
k  +  1 ) )  <_  ( F `  k )  <->  ( F `  ( n  +  1 ) )  <_  ( F `  n )
) )
1312cbvralv 2715 . . . . . . . 8  |-  ( A. k  e.  ( M ... ( N  -  1 ) ) ( F `
 ( k  +  1 ) )  <_ 
( F `  k
)  <->  A. n  e.  ( M ... ( N  -  1 ) ) ( F `  (
n  +  1 ) )  <_  ( F `  n ) )
148, 13sylib 122 . . . . . . 7  |-  ( ph  ->  A. n  e.  ( M ... ( N  -  1 ) ) ( F `  (
n  +  1 ) )  <_  ( F `  n ) )
1514r19.21bi 2575 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( n  +  1 ) )  <_  ( F `  n )
)
16 fveq2 5527 . . . . . . . . 9  |-  ( k  =  ( n  + 
1 )  ->  ( F `  k )  =  ( F `  ( n  +  1
) ) )
1716eleq1d 2256 . . . . . . . 8  |-  ( k  =  ( n  + 
1 )  ->  (
( F `  k
)  e.  RR  <->  ( F `  ( n  +  1 ) )  e.  RR ) )
182ralrimiva 2560 . . . . . . . . 9  |-  ( ph  ->  A. k  e.  ( M ... N ) ( F `  k
)  e.  RR )
1918adantr 276 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  A. k  e.  ( M ... N
) ( F `  k )  e.  RR )
20 fzp1elp1 10089 . . . . . . . . . 10  |-  ( n  e.  ( M ... ( N  -  1
) )  ->  (
n  +  1 )  e.  ( M ... ( ( N  - 
1 )  +  1 ) ) )
2120adantl 277 . . . . . . . . 9  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( n  +  1 )  e.  ( M ... (
( N  -  1 )  +  1 ) ) )
22 eluzelz 9551 . . . . . . . . . . . . . 14  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
231, 22syl 14 . . . . . . . . . . . . 13  |-  ( ph  ->  N  e.  ZZ )
2423zcnd 9390 . . . . . . . . . . . 12  |-  ( ph  ->  N  e.  CC )
25 ax-1cn 7918 . . . . . . . . . . . 12  |-  1  e.  CC
26 npcan 8180 . . . . . . . . . . . 12  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
2724, 25, 26sylancl 413 . . . . . . . . . . 11  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
2827oveq2d 5904 . . . . . . . . . 10  |-  ( ph  ->  ( M ... (
( N  -  1 )  +  1 ) )  =  ( M ... N ) )
2928adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( M ... ( ( N  - 
1 )  +  1 ) )  =  ( M ... N ) )
3021, 29eleqtrd 2266 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( n  +  1 )  e.  ( M ... N
) )
3117, 19, 30rspcdva 2858 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( n  +  1 ) )  e.  RR )
3211eleq1d 2256 . . . . . . . 8  |-  ( k  =  n  ->  (
( F `  k
)  e.  RR  <->  ( F `  n )  e.  RR ) )
33 fzssp1 10081 . . . . . . . . . 10  |-  ( M ... ( N  - 
1 ) )  C_  ( M ... ( ( N  -  1 )  +  1 ) )
3433, 28sseqtrid 3217 . . . . . . . . 9  |-  ( ph  ->  ( M ... ( N  -  1 ) )  C_  ( M ... N ) )
3534sselda 3167 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  n  e.  ( M ... N ) )
3632, 19, 35rspcdva 2858 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  n )  e.  RR )
3731, 36lenegd 8495 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( ( F `  ( n  +  1 ) )  <_  ( F `  n )  <->  -u ( F `
 n )  <_  -u ( F `  (
n  +  1 ) ) ) )
3815, 37mpbid 147 . . . . 5  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  -u ( F `
 n )  <_  -u ( F `  (
n  +  1 ) ) )
3936renegcld 8351 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  -u ( F `
 n )  e.  RR )
4011negeqd 8166 . . . . . . 7  |-  ( k  =  n  ->  -u ( F `  k )  =  -u ( F `  n ) )
4140, 4fvmptg 5605 . . . . . 6  |-  ( ( n  e.  ( M ... N )  /\  -u ( F `  n
)  e.  RR )  ->  ( ( k  e.  ( M ... N )  |->  -u ( F `  k )
) `  n )  =  -u ( F `  n ) )
4235, 39, 41syl2anc 411 . . . . 5  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( (
k  e.  ( M ... N )  |->  -u ( F `  k ) ) `  n )  =  -u ( F `  n ) )
4331renegcld 8351 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  -u ( F `
 ( n  + 
1 ) )  e.  RR )
4416negeqd 8166 . . . . . . 7  |-  ( k  =  ( n  + 
1 )  ->  -u ( F `  k )  =  -u ( F `  ( n  +  1
) ) )
4544, 4fvmptg 5605 . . . . . 6  |-  ( ( ( n  +  1 )  e.  ( M ... N )  /\  -u ( F `  (
n  +  1 ) )  e.  RR )  ->  ( ( k  e.  ( M ... N )  |->  -u ( F `  k )
) `  ( n  +  1 ) )  =  -u ( F `  ( n  +  1
) ) )
4630, 43, 45syl2anc 411 . . . . 5  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( (
k  e.  ( M ... N )  |->  -u ( F `  k ) ) `  ( n  +  1 ) )  =  -u ( F `  ( n  +  1
) ) )
4738, 42, 463brtr4d 4047 . . . 4  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( (
k  e.  ( M ... N )  |->  -u ( F `  k ) ) `  n )  <_  ( ( k  e.  ( M ... N )  |->  -u ( F `  k )
) `  ( n  +  1 ) ) )
481, 6, 47monoord 10490 . . 3  |-  ( ph  ->  ( ( k  e.  ( M ... N
)  |->  -u ( F `  k ) ) `  M )  <_  (
( k  e.  ( M ... N ) 
|->  -u ( F `  k ) ) `  N ) )
49 eluzfz1 10045 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ( M ... N ) )
501, 49syl 14 . . . 4  |-  ( ph  ->  M  e.  ( M ... N ) )
51 fveq2 5527 . . . . . . 7  |-  ( k  =  M  ->  ( F `  k )  =  ( F `  M ) )
5251eleq1d 2256 . . . . . 6  |-  ( k  =  M  ->  (
( F `  k
)  e.  RR  <->  ( F `  M )  e.  RR ) )
5352, 18, 50rspcdva 2858 . . . . 5  |-  ( ph  ->  ( F `  M
)  e.  RR )
5453renegcld 8351 . . . 4  |-  ( ph  -> 
-u ( F `  M )  e.  RR )
5551negeqd 8166 . . . . 5  |-  ( k  =  M  ->  -u ( F `  k )  =  -u ( F `  M ) )
5655, 4fvmptg 5605 . . . 4  |-  ( ( M  e.  ( M ... N )  /\  -u ( F `  M
)  e.  RR )  ->  ( ( k  e.  ( M ... N )  |->  -u ( F `  k )
) `  M )  =  -u ( F `  M ) )
5750, 54, 56syl2anc 411 . . 3  |-  ( ph  ->  ( ( k  e.  ( M ... N
)  |->  -u ( F `  k ) ) `  M )  =  -u ( F `  M ) )
58 eluzfz2 10046 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ( M ... N ) )
591, 58syl 14 . . . 4  |-  ( ph  ->  N  e.  ( M ... N ) )
60 fveq2 5527 . . . . . . 7  |-  ( k  =  N  ->  ( F `  k )  =  ( F `  N ) )
6160eleq1d 2256 . . . . . 6  |-  ( k  =  N  ->  (
( F `  k
)  e.  RR  <->  ( F `  N )  e.  RR ) )
6261, 18, 59rspcdva 2858 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  RR )
6362renegcld 8351 . . . 4  |-  ( ph  -> 
-u ( F `  N )  e.  RR )
6460negeqd 8166 . . . . 5  |-  ( k  =  N  ->  -u ( F `  k )  =  -u ( F `  N ) )
6564, 4fvmptg 5605 . . . 4  |-  ( ( N  e.  ( M ... N )  /\  -u ( F `  N
)  e.  RR )  ->  ( ( k  e.  ( M ... N )  |->  -u ( F `  k )
) `  N )  =  -u ( F `  N ) )
6659, 63, 65syl2anc 411 . . 3  |-  ( ph  ->  ( ( k  e.  ( M ... N
)  |->  -u ( F `  k ) ) `  N )  =  -u ( F `  N ) )
6748, 57, 663brtr3d 4046 . 2  |-  ( ph  -> 
-u ( F `  M )  <_  -u ( F `  N )
)
6862, 53lenegd 8495 . 2  |-  ( ph  ->  ( ( F `  N )  <_  ( F `  M )  <->  -u ( F `  M
)  <_  -u ( F `
 N ) ) )
6967, 68mpbird 167 1  |-  ( ph  ->  ( F `  N
)  <_  ( F `  M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1363    e. wcel 2158   A.wral 2465   class class class wbr 4015    |-> cmpt 4076   ` cfv 5228  (class class class)co 5888   CCcc 7823   RRcr 7824   1c1 7826    + caddc 7828    <_ cle 8007    - cmin 8142   -ucneg 8143   ZZcz 9267   ZZ>=cuz 9542   ...cfz 10022
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-1cn 7918  ax-1re 7919  ax-icn 7920  ax-addcl 7921  ax-addrcl 7922  ax-mulcl 7923  ax-addcom 7925  ax-addass 7927  ax-distr 7929  ax-i2m1 7930  ax-0lt1 7931  ax-0id 7933  ax-rnegex 7934  ax-cnre 7936  ax-pre-ltirr 7937  ax-pre-ltwlin 7938  ax-pre-lttrn 7939  ax-pre-ltadd 7941
This theorem depends on definitions:  df-bi 117  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-pnf 8008  df-mnf 8009  df-xr 8010  df-ltxr 8011  df-le 8012  df-sub 8144  df-neg 8145  df-inn 8934  df-n0 9191  df-z 9268  df-uz 9543  df-fz 10023
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator