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

Theorem monoord2 10848
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 8653 . . . . . 6  |-  ( (
ph  /\  k  e.  ( M ... N ) )  ->  -u ( F `
 k )  e.  RR )
4 eqid 2232 . . . . . 6  |-  ( k  e.  ( M ... N )  |->  -u ( F `  k )
)  =  ( k  e.  ( M ... N )  |->  -u ( F `  k )
)
53, 4fmptd 5831 . . . . 5  |-  ( ph  ->  ( k  e.  ( M ... N ) 
|->  -u ( F `  k ) ) : ( M ... N
) --> RR )
65ffvelcdmda 5812 . . . 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 2615 . . . . . . . 8  |-  ( ph  ->  A. k  e.  ( M ... ( N  -  1 ) ) ( F `  (
k  +  1 ) )  <_  ( F `  k ) )
9 oveq1 6057 . . . . . . . . . . 11  |-  ( k  =  n  ->  (
k  +  1 )  =  ( n  + 
1 ) )
109fveq2d 5674 . . . . . . . . . 10  |-  ( k  =  n  ->  ( F `  ( k  +  1 ) )  =  ( F `  ( n  +  1
) ) )
11 fveq2 5670 . . . . . . . . . 10  |-  ( k  =  n  ->  ( F `  k )  =  ( F `  n ) )
1210, 11breq12d 4122 . . . . . . . . 9  |-  ( k  =  n  ->  (
( F `  (
k  +  1 ) )  <_  ( F `  k )  <->  ( F `  ( n  +  1 ) )  <_  ( F `  n )
) )
1312cbvralv 2778 . . . . . . . 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 2630 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( n  +  1 ) )  <_  ( F `  n )
)
16 fveq2 5670 . . . . . . . . 9  |-  ( k  =  ( n  + 
1 )  ->  ( F `  k )  =  ( F `  ( n  +  1
) ) )
1716eleq1d 2301 . . . . . . . 8  |-  ( k  =  ( n  + 
1 )  ->  (
( F `  k
)  e.  RR  <->  ( F `  ( n  +  1 ) )  e.  RR ) )
182ralrimiva 2615 . . . . . . . . 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 10409 . . . . . . . . . 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 9863 . . . . . . . . . . . . . 14  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
231, 22syl 14 . . . . . . . . . . . . 13  |-  ( ph  ->  N  e.  ZZ )
2423zcnd 9701 . . . . . . . . . . . 12  |-  ( ph  ->  N  e.  CC )
25 ax-1cn 8220 . . . . . . . . . . . 12  |-  1  e.  CC
26 npcan 8482 . . . . . . . . . . . 12  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
2724, 25, 26sylancl 413 . . . . . . . . . . 11  |-  ( ph  ->  ( ( N  - 
1 )  +  1 )  =  N )
2827oveq2d 6066 . . . . . . . . . 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 2311 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( n  +  1 )  e.  ( M ... N
) )
3117, 19, 30rspcdva 2926 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  ( n  +  1 ) )  e.  RR )
3211eleq1d 2301 . . . . . . . 8  |-  ( k  =  n  ->  (
( F `  k
)  e.  RR  <->  ( F `  n )  e.  RR ) )
33 fzssp1 10401 . . . . . . . . . 10  |-  ( M ... ( N  - 
1 ) )  C_  ( M ... ( ( N  -  1 )  +  1 ) )
3433, 28sseqtrid 3288 . . . . . . . . 9  |-  ( ph  ->  ( M ... ( N  -  1 ) )  C_  ( M ... N ) )
3534sselda 3238 . . . . . . . 8  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  n  e.  ( M ... N ) )
3632, 19, 35rspcdva 2926 . . . . . . 7  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  ( F `  n )  e.  RR )
3731, 36lenegd 8798 . . . . . 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 8653 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  -u ( F `
 n )  e.  RR )
4011negeqd 8468 . . . . . . 7  |-  ( k  =  n  ->  -u ( F `  k )  =  -u ( F `  n ) )
4140, 4fvmptg 5753 . . . . . 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 8653 . . . . . 6  |-  ( (
ph  /\  n  e.  ( M ... ( N  -  1 ) ) )  ->  -u ( F `
 ( n  + 
1 ) )  e.  RR )
4416negeqd 8468 . . . . . . 7  |-  ( k  =  ( n  + 
1 )  ->  -u ( F `  k )  =  -u ( F `  ( n  +  1
) ) )
4544, 4fvmptg 5753 . . . . . 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 4141 . . . 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 10847 . . 3  |-  ( ph  ->  ( ( k  e.  ( M ... N
)  |->  -u ( F `  k ) ) `  M )  <_  (
( k  e.  ( M ... N ) 
|->  -u ( F `  k ) ) `  N ) )
49 eluzfz1 10365 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ( M ... N ) )
501, 49syl 14 . . . 4  |-  ( ph  ->  M  e.  ( M ... N ) )
51 fveq2 5670 . . . . . . 7  |-  ( k  =  M  ->  ( F `  k )  =  ( F `  M ) )
5251eleq1d 2301 . . . . . 6  |-  ( k  =  M  ->  (
( F `  k
)  e.  RR  <->  ( F `  M )  e.  RR ) )
5352, 18, 50rspcdva 2926 . . . . 5  |-  ( ph  ->  ( F `  M
)  e.  RR )
5453renegcld 8653 . . . 4  |-  ( ph  -> 
-u ( F `  M )  e.  RR )
5551negeqd 8468 . . . . 5  |-  ( k  =  M  ->  -u ( F `  k )  =  -u ( F `  M ) )
5655, 4fvmptg 5753 . . . 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 10366 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ( M ... N ) )
591, 58syl 14 . . . 4  |-  ( ph  ->  N  e.  ( M ... N ) )
60 fveq2 5670 . . . . . . 7  |-  ( k  =  N  ->  ( F `  k )  =  ( F `  N ) )
6160eleq1d 2301 . . . . . 6  |-  ( k  =  N  ->  (
( F `  k
)  e.  RR  <->  ( F `  N )  e.  RR ) )
6261, 18, 59rspcdva 2926 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  RR )
6362renegcld 8653 . . . 4  |-  ( ph  -> 
-u ( F `  N )  e.  RR )
6460negeqd 8468 . . . . 5  |-  ( k  =  N  ->  -u ( F `  k )  =  -u ( F `  N ) )
6564, 4fvmptg 5753 . . . 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 4140 . 2  |-  ( ph  -> 
-u ( F `  M )  <_  -u ( F `  N )
)
6862, 53lenegd 8798 . 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 1398    e. wcel 2203   A.wral 2520   class class class wbr 4109    |-> cmpt 4171   ` cfv 5352  (class class class)co 6050   CCcc 8125   RRcr 8126   1c1 8128    + caddc 8130    <_ cle 8309    - cmin 8444   -ucneg 8445   ZZcz 9577   ZZ>=cuz 9853   ...cfz 10342
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-fz 10343
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator