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

Theorem ubmelm1fzo 10219
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 10175 . 2  |-  ( K  e.  ( 0..^ N )  <->  ( K  e. 
NN0  /\  N  e.  NN  /\  K  <  N
) )
2 nnz 9266 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  ZZ )
32adantr 276 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  N  e.  ZZ )
4 nn0z 9267 . . . . . . . . 9  |-  ( K  e.  NN0  ->  K  e.  ZZ )
54adantl 277 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  K  e.  ZZ )
63, 5zsubcld 9374 . . . . . . 7  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  -> 
( N  -  K
)  e.  ZZ )
76ancoms 268 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  K
)  e.  ZZ )
8 peano2zm 9285 . . . . . 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 1017 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ZZ )
11 simp3 999 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  K  <  N )
124, 2anim12i 338 . . . . . . . 8  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
13123adant3 1017 . . . . . . 7  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
14 znnsub 9298 . . . . . . 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 147 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( N  -  K )  e.  NN )
17 nnm1ge0 9333 . . . . 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 9260 . . . 4  |-  ( ( ( N  -  K
)  -  1 )  e.  NN0  <->  ( ( ( N  -  K )  -  1 )  e.  ZZ  /\  0  <_ 
( ( N  -  K )  -  1 ) ) )
2010, 18, 19sylanbrc 417 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  NN0 )
21 simp2 998 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  N  e.  NN )
22 nncn 8921 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
2322adantl 277 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  N  e.  CC )
24 nn0cn 9180 . . . . . . 7  |-  ( K  e.  NN0  ->  K  e.  CC )
2524adantr 276 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  K  e.  CC )
26 1cnd 7968 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  1  e.  CC )
2723, 25, 26subsub4d 8293 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  =  ( N  -  ( K  + 
1 ) ) )
28 nn0p1gt0 9199 . . . . . . 7  |-  ( K  e.  NN0  ->  0  < 
( K  +  1 ) )
2928adantr 276 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  0  <  ( K  +  1 ) )
30 nn0re 9179 . . . . . . . 8  |-  ( K  e.  NN0  ->  K  e.  RR )
31 peano2re 8087 . . . . . . . 8  |-  ( K  e.  RR  ->  ( K  +  1 )  e.  RR )
3230, 31syl 14 . . . . . . 7  |-  ( K  e.  NN0  ->  ( K  +  1 )  e.  RR )
33 nnre 8920 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  RR )
34 ltsubpos 8405 . . . . . . 7  |-  ( ( ( K  +  1 )  e.  RR  /\  N  e.  RR )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3532, 33, 34syl2an 289 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( 0  <  ( K  +  1 )  <-> 
( N  -  ( K  +  1 ) )  <  N ) )
3629, 35mpbid 147 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( N  -  ( K  +  1 ) )  <  N )
3727, 36eqbrtrd 4023 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  <  N )
38373adant3 1017 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  <  N )
39 elfzo0 10175 . . 3  |-  ( ( ( N  -  K
)  -  1 )  e.  ( 0..^ N )  <->  ( ( ( N  -  K )  -  1 )  e. 
NN0  /\  N  e.  NN  /\  ( ( N  -  K )  - 
1 )  <  N
) )
4020, 21, 38, 39syl3anbrc 1181 . 2  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ( 0..^ N ) )
411, 40sylbi 121 1  |-  ( K  e.  ( 0..^ N )  ->  ( ( N  -  K )  -  1 )  e.  ( 0..^ N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 978    e. wcel 2148   class class class wbr 4001  (class class class)co 5870   CCcc 7804   RRcr 7805   0cc0 7806   1c1 7807    + caddc 7809    < clt 7986    <_ cle 7987    - cmin 8122   NNcn 8913   NN0cn0 9170   ZZcz 9247  ..^cfzo 10135
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172  ax-pr 4207  ax-un 4431  ax-setind 4534  ax-cnex 7897  ax-resscn 7898  ax-1cn 7899  ax-1re 7900  ax-icn 7901  ax-addcl 7902  ax-addrcl 7903  ax-mulcl 7904  ax-addcom 7906  ax-addass 7908  ax-distr 7910  ax-i2m1 7911  ax-0lt1 7912  ax-0id 7914  ax-rnegex 7915  ax-cnre 7917  ax-pre-ltirr 7918  ax-pre-ltwlin 7919  ax-pre-lttrn 7920  ax-pre-ltadd 7922
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3809  df-int 3844  df-iun 3887  df-br 4002  df-opab 4063  df-mpt 4064  df-id 4291  df-xp 4630  df-rel 4631  df-cnv 4632  df-co 4633  df-dm 4634  df-rn 4635  df-res 4636  df-ima 4637  df-iota 5175  df-fun 5215  df-fn 5216  df-f 5217  df-fv 5221  df-riota 5826  df-ov 5873  df-oprab 5874  df-mpo 5875  df-1st 6136  df-2nd 6137  df-pnf 7988  df-mnf 7989  df-xr 7990  df-ltxr 7991  df-le 7992  df-sub 8124  df-neg 8125  df-inn 8914  df-n0 9171  df-z 9248  df-uz 9523  df-fz 10003  df-fzo 10136
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator