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

Theorem ubmelm1fzo 9235
Description: The result of subtracting 1 and an integer of a half-open range of nonnegative integers from the upper bound of this range is contained in this range. (Contributed by AV, 23-Mar-2018.) (Revised by AV, 30-Oct-2018.)
Assertion
Ref Expression
ubmelm1fzo  |-  ( K  e.  ( 0..^ N )  ->  ( ( N  -  K )  -  1 )  e.  ( 0..^ N ) )

Proof of Theorem ubmelm1fzo
StepHypRef Expression
1 elfzo0 9191 . 2  |-  ( K  e.  ( 0..^ N )  <->  ( K  e. 
NN0  /\  N  e.  NN  /\  K  <  N
) )
2 nnz 8370 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  ZZ )
32adantr 270 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  N  e.  ZZ )
4 nn0z 8371 . . . . . . . . 9  |-  ( K  e.  NN0  ->  K  e.  ZZ )
54adantl 271 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  K  e.  ZZ )
63, 5zsubcld 8474 . . . . . . 7  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  -> 
( N  -  K
)  e.  ZZ )
76ancoms 264 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  K
)  e.  ZZ )
8 peano2zm 8389 . . . . . 6  |-  ( ( N  -  K )  e.  ZZ  ->  (
( N  -  K
)  -  1 )  e.  ZZ )
97, 8syl 14 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  e.  ZZ )
1093adant3 958 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ZZ )
11 simp3 940 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  K  <  N )
124, 2anim12i 331 . . . . . . . 8  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
13123adant3 958 . . . . . . 7  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
14 znnsub 8402 . . . . . . 7  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  <  N  <->  ( N  -  K )  e.  NN ) )
1513, 14syl 14 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( K  <  N  <->  ( N  -  K )  e.  NN ) )
1611, 15mpbid 145 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( N  -  K )  e.  NN )
17 nnm1ge0 8433 . . . . 5  |-  ( ( N  -  K )  e.  NN  ->  0  <_  ( ( N  -  K )  -  1 ) )
1816, 17syl 14 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  0  <_  ( ( N  -  K )  -  1 ) )
19 elnn0z 8364 . . . 4  |-  ( ( ( N  -  K
)  -  1 )  e.  NN0  <->  ( ( ( N  -  K )  -  1 )  e.  ZZ  /\  0  <_ 
( ( N  -  K )  -  1 ) ) )
2010, 18, 19sylanbrc 408 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  NN0 )
21 simp2 939 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  N  e.  NN )
22 nncn 8047 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
2322adantl 271 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  N  e.  CC )
24 nn0cn 8298 . . . . . . 7  |-  ( K  e.  NN0  ->  K  e.  CC )
2524adantr 270 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  K  e.  CC )
26 1cnd 7135 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  1  e.  CC )
2723, 25, 26subsub4d 7450 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  =  ( N  -  ( K  + 
1 ) ) )
28 nn0p1gt0 8317 . . . . . . 7  |-  ( K  e.  NN0  ->  0  < 
( K  +  1 ) )
2928adantr 270 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  0  <  ( K  +  1 ) )
30 nn0re 8297 . . . . . . . 8  |-  ( K  e.  NN0  ->  K  e.  RR )
31 peano2re 7244 . . . . . . . 8  |-  ( K  e.  RR  ->  ( K  +  1 )  e.  RR )
3230, 31syl 14 . . . . . . 7  |-  ( K  e.  NN0  ->  ( K  +  1 )  e.  RR )
33 nnre 8046 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  RR )
34 ltsubpos 7558 . . . . . . 7  |-  ( ( ( K  +  1 )  e.  RR  /\  N  e.  RR )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3532, 33, 34syl2an 283 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3629, 35mpbid 145 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  ( K  +  1 ) )  <  N )
3727, 36eqbrtrd 3805 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  <  N )
38373adant3 958 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  <  N )
39 elfzo0 9191 . . 3  |-  ( ( ( N  -  K
)  -  1 )  e.  ( 0..^ N )  <->  ( ( ( N  -  K )  -  1 )  e. 
NN0  /\  N  e.  NN  /\  ( ( N  -  K )  - 
1 )  <  N
) )
4020, 21, 38, 39syl3anbrc 1122 . 2  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ( 0..^ N ) )
411, 40sylbi 119 1  |-  ( K  e.  ( 0..^ N )  ->  ( ( N  -  K )  -  1 )  e.  ( 0..^ N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    /\ w3a 919    e. wcel 1433   class class class wbr 3785  (class class class)co 5532   CCcc 6979   RRcr 6980   0cc0 6981   1c1 6982    + caddc 6984    < clt 7153    <_ cle 7154    - cmin 7279   NNcn 8039   NN0cn0 8288   ZZcz 8351  ..^cfzo 9152
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-ltadd 7092
This theorem depends on definitions:  df-bi 115  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-inn 8040  df-n0 8289  df-z 8352  df-uz 8620  df-fz 9030  df-fzo 9153
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator