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

Theorem ubmelm1fzo 10161
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 10117 . 2  |-  ( K  e.  ( 0..^ N )  <->  ( K  e. 
NN0  /\  N  e.  NN  /\  K  <  N
) )
2 nnz 9210 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  ZZ )
32adantr 274 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  N  e.  ZZ )
4 nn0z 9211 . . . . . . . . 9  |-  ( K  e.  NN0  ->  K  e.  ZZ )
54adantl 275 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  K  e.  ZZ )
63, 5zsubcld 9318 . . . . . . 7  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  -> 
( N  -  K
)  e.  ZZ )
76ancoms 266 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  K
)  e.  ZZ )
8 peano2zm 9229 . . . . . 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 1007 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ZZ )
11 simp3 989 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  K  <  N )
124, 2anim12i 336 . . . . . . . 8  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
13123adant3 1007 . . . . . . 7  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
14 znnsub 9242 . . . . . . 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 146 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( N  -  K )  e.  NN )
17 nnm1ge0 9277 . . . . 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 9204 . . . 4  |-  ( ( ( N  -  K
)  -  1 )  e.  NN0  <->  ( ( ( N  -  K )  -  1 )  e.  ZZ  /\  0  <_ 
( ( N  -  K )  -  1 ) ) )
2010, 18, 19sylanbrc 414 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  NN0 )
21 simp2 988 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  N  e.  NN )
22 nncn 8865 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
2322adantl 275 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  N  e.  CC )
24 nn0cn 9124 . . . . . . 7  |-  ( K  e.  NN0  ->  K  e.  CC )
2524adantr 274 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  K  e.  CC )
26 1cnd 7915 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  1  e.  CC )
2723, 25, 26subsub4d 8240 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  =  ( N  -  ( K  + 
1 ) ) )
28 nn0p1gt0 9143 . . . . . . 7  |-  ( K  e.  NN0  ->  0  < 
( K  +  1 ) )
2928adantr 274 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  0  <  ( K  +  1 ) )
30 nn0re 9123 . . . . . . . 8  |-  ( K  e.  NN0  ->  K  e.  RR )
31 peano2re 8034 . . . . . . . 8  |-  ( K  e.  RR  ->  ( K  +  1 )  e.  RR )
3230, 31syl 14 . . . . . . 7  |-  ( K  e.  NN0  ->  ( K  +  1 )  e.  RR )
33 nnre 8864 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  RR )
34 ltsubpos 8352 . . . . . . 7  |-  ( ( ( K  +  1 )  e.  RR  /\  N  e.  RR )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3532, 33, 34syl2an 287 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3629, 35mpbid 146 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  ( K  +  1 ) )  <  N )
3727, 36eqbrtrd 4004 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  <  N )
38373adant3 1007 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  <  N )
39 elfzo0 10117 . . 3  |-  ( ( ( N  -  K
)  -  1 )  e.  ( 0..^ N )  <->  ( ( ( N  -  K )  -  1 )  e. 
NN0  /\  N  e.  NN  /\  ( ( N  -  K )  - 
1 )  <  N
) )
4020, 21, 38, 39syl3anbrc 1171 . 2  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ( 0..^ N ) )
411, 40sylbi 120 1  |-  ( K  e.  ( 0..^ N )  ->  ( ( N  -  K )  -  1 )  e.  ( 0..^ N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 968    e. wcel 2136   class class class wbr 3982  (class class class)co 5842   CCcc 7751   RRcr 7752   0cc0 7753   1c1 7754    + caddc 7756    < clt 7933    <_ cle 7934    - cmin 8069   NNcn 8857   NN0cn0 9114   ZZcz 9191  ..^cfzo 10077
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-ltadd 7869
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192  df-uz 9467  df-fz 9945  df-fzo 10078
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator