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

Theorem ubmelm1fzo 10470
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 10420 . 2  |-  ( K  e.  ( 0..^ N )  <->  ( K  e. 
NN0  /\  N  e.  NN  /\  K  <  N
) )
2 nnz 9497 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  ZZ )
32adantr 276 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  N  e.  ZZ )
4 nn0z 9498 . . . . . . . . 9  |-  ( K  e.  NN0  ->  K  e.  ZZ )
54adantl 277 . . . . . . . 8  |-  ( ( N  e.  NN  /\  K  e.  NN0 )  ->  K  e.  ZZ )
63, 5zsubcld 9606 . . . . . . 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 9516 . . . . . 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 1043 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  e.  ZZ )
11 simp3 1025 . . . . . 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 1043 . . . . . . 7  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  ( K  e.  ZZ  /\  N  e.  ZZ ) )
14 znnsub 9530 . . . . . . 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 9565 . . . . 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 9491 . . . 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 1024 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  N  e.  NN )
22 nncn 9150 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
2322adantl 277 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  N  e.  CC )
24 nn0cn 9411 . . . . . . 7  |-  ( K  e.  NN0  ->  K  e.  CC )
2524adantr 276 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  K  e.  CC )
26 1cnd 8194 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  1  e.  CC )
2723, 25, 26subsub4d 8520 . . . . 5  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  =  ( N  -  ( K  + 
1 ) ) )
28 nn0p1gt0 9430 . . . . . . 7  |-  ( K  e.  NN0  ->  0  < 
( K  +  1 ) )
2928adantr 276 . . . . . 6  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  0  <  ( K  +  1 ) )
30 nn0re 9410 . . . . . . . 8  |-  ( K  e.  NN0  ->  K  e.  RR )
31 peano2re 8314 . . . . . . . 8  |-  ( K  e.  RR  ->  ( K  +  1 )  e.  RR )
3230, 31syl 14 . . . . . . 7  |-  ( K  e.  NN0  ->  ( K  +  1 )  e.  RR )
33 nnre 9149 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  RR )
34 ltsubpos 8633 . . . . . . 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 4110 . . . 4  |-  ( ( K  e.  NN0  /\  N  e.  NN )  ->  ( ( N  -  K )  -  1 )  <  N )
38373adant3 1043 . . 3  |-  ( ( K  e.  NN0  /\  N  e.  NN  /\  K  <  N )  ->  (
( N  -  K
)  -  1 )  <  N )
39 elfzo0 10420 . . 3  |-  ( ( ( N  -  K
)  -  1 )  e.  ( 0..^ N )  <->  ( ( ( N  -  K )  -  1 )  e. 
NN0  /\  N  e.  NN  /\  ( ( N  -  K )  - 
1 )  <  N
) )
4020, 21, 38, 39syl3anbrc 1207 . 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 1004    e. wcel 2202   class class class wbr 4088  (class class class)co 6017   CCcc 8029   RRcr 8030   0cc0 8031   1c1 8032    + caddc 8034    < clt 8213    <_ cle 8214    - cmin 8349   NNcn 9142   NN0cn0 9401   ZZcz 9478  ..^cfzo 10376
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator