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

Theorem fzofzim 10426
Description: If a nonnegative integer in a finite interval of integers is not the upper bound of the interval, it is contained in the corresponding half-open integer range. (Contributed by Alexander van der Vekens, 15-Jun-2018.)
Assertion
Ref Expression
fzofzim  |-  ( ( K  =/=  M  /\  K  e.  ( 0 ... M ) )  ->  K  e.  ( 0..^ M ) )

Proof of Theorem fzofzim
StepHypRef Expression
1 elfz2nn0 10346 . . . 4  |-  ( K  e.  ( 0 ... M )  <->  ( K  e.  NN0  /\  M  e. 
NN0  /\  K  <_  M ) )
2 simpl1 1026 . . . . . 6  |-  ( ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  /\  K  =/=  M )  ->  K  e.  NN0 )
3 necom 2486 . . . . . . . . 9  |-  ( K  =/=  M  <->  M  =/=  K )
4 nn0z 9498 . . . . . . . . . . . . 13  |-  ( K  e.  NN0  ->  K  e.  ZZ )
5 nn0z 9498 . . . . . . . . . . . . 13  |-  ( M  e.  NN0  ->  M  e.  ZZ )
6 zltlen 9557 . . . . . . . . . . . . 13  |-  ( ( K  e.  ZZ  /\  M  e.  ZZ )  ->  ( K  <  M  <->  ( K  <_  M  /\  M  =/=  K ) ) )
74, 5, 6syl2an 289 . . . . . . . . . . . 12  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( K  <  M  <->  ( K  <_  M  /\  M  =/=  K ) ) )
87bicomd 141 . . . . . . . . . . 11  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( ( K  <_  M  /\  M  =/=  K
)  <->  K  <  M ) )
9 elnn0z 9491 . . . . . . . . . . . . 13  |-  ( K  e.  NN0  <->  ( K  e.  ZZ  /\  0  <_  K ) )
10 0red 8179 . . . . . . . . . . . . . . . . 17  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  -> 
0  e.  RR )
11 zre 9482 . . . . . . . . . . . . . . . . . 18  |-  ( K  e.  ZZ  ->  K  e.  RR )
1211adantr 276 . . . . . . . . . . . . . . . . 17  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  ->  K  e.  RR )
13 nn0re 9410 . . . . . . . . . . . . . . . . . 18  |-  ( M  e.  NN0  ->  M  e.  RR )
1413adantl 277 . . . . . . . . . . . . . . . . 17  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  ->  M  e.  RR )
15 lelttr 8267 . . . . . . . . . . . . . . . . 17  |-  ( ( 0  e.  RR  /\  K  e.  RR  /\  M  e.  RR )  ->  (
( 0  <_  K  /\  K  <  M )  ->  0  <  M
) )
1610, 12, 14, 15syl3anc 1273 . . . . . . . . . . . . . . . 16  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( 0  <_  K  /\  K  <  M
)  ->  0  <  M ) )
17 elnnz 9488 . . . . . . . . . . . . . . . . . . 19  |-  ( M  e.  NN  <->  ( M  e.  ZZ  /\  0  < 
M ) )
1817simplbi2 385 . . . . . . . . . . . . . . . . . 18  |-  ( M  e.  ZZ  ->  (
0  <  M  ->  M  e.  NN ) )
195, 18syl 14 . . . . . . . . . . . . . . . . 17  |-  ( M  e.  NN0  ->  ( 0  <  M  ->  M  e.  NN ) )
2019adantl 277 . . . . . . . . . . . . . . . 16  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  -> 
( 0  <  M  ->  M  e.  NN ) )
2116, 20syld 45 . . . . . . . . . . . . . . 15  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  -> 
( ( 0  <_  K  /\  K  <  M
)  ->  M  e.  NN ) )
2221expd 258 . . . . . . . . . . . . . 14  |-  ( ( K  e.  ZZ  /\  M  e.  NN0 )  -> 
( 0  <_  K  ->  ( K  <  M  ->  M  e.  NN ) ) )
2322impancom 260 . . . . . . . . . . . . 13  |-  ( ( K  e.  ZZ  /\  0  <_  K )  -> 
( M  e.  NN0  ->  ( K  <  M  ->  M  e.  NN ) ) )
249, 23sylbi 121 . . . . . . . . . . . 12  |-  ( K  e.  NN0  ->  ( M  e.  NN0  ->  ( K  <  M  ->  M  e.  NN ) ) )
2524imp 124 . . . . . . . . . . 11  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( K  <  M  ->  M  e.  NN ) )
268, 25sylbid 150 . . . . . . . . . 10  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( ( K  <_  M  /\  M  =/=  K
)  ->  M  e.  NN ) )
2726expd 258 . . . . . . . . 9  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( K  <_  M  ->  ( M  =/=  K  ->  M  e.  NN ) ) )
283, 27syl7bi 165 . . . . . . . 8  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( K  <_  M  ->  ( K  =/=  M  ->  M  e.  NN ) ) )
29283impia 1226 . . . . . . 7  |-  ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  ->  ( K  =/=  M  ->  M  e.  NN ) )
3029imp 124 . . . . . 6  |-  ( ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  /\  K  =/=  M )  ->  M  e.  NN )
318biimpd 144 . . . . . . . . . 10  |-  ( ( K  e.  NN0  /\  M  e.  NN0 )  -> 
( ( K  <_  M  /\  M  =/=  K
)  ->  K  <  M ) )
3231exp4b 367 . . . . . . . . 9  |-  ( K  e.  NN0  ->  ( M  e.  NN0  ->  ( K  <_  M  ->  ( M  =/=  K  ->  K  <  M ) ) ) )
33323imp 1219 . . . . . . . 8  |-  ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  ->  ( M  =/=  K  ->  K  <  M ) )
343, 33biimtrid 152 . . . . . . 7  |-  ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  ->  ( K  =/=  M  ->  K  <  M ) )
3534imp 124 . . . . . 6  |-  ( ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  /\  K  =/=  M )  ->  K  <  M )
362, 30, 353jca 1203 . . . . 5  |-  ( ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  /\  K  =/=  M )  -> 
( K  e.  NN0  /\  M  e.  NN  /\  K  <  M ) )
3736ex 115 . . . 4  |-  ( ( K  e.  NN0  /\  M  e.  NN0  /\  K  <_  M )  ->  ( K  =/=  M  ->  ( K  e.  NN0  /\  M  e.  NN  /\  K  < 
M ) ) )
381, 37sylbi 121 . . 3  |-  ( K  e.  ( 0 ... M )  ->  ( K  =/=  M  ->  ( K  e.  NN0  /\  M  e.  NN  /\  K  < 
M ) ) )
3938impcom 125 . 2  |-  ( ( K  =/=  M  /\  K  e.  ( 0 ... M ) )  ->  ( K  e. 
NN0  /\  M  e.  NN  /\  K  <  M
) )
40 elfzo0 10420 . 2  |-  ( K  e.  ( 0..^ M )  <->  ( K  e. 
NN0  /\  M  e.  NN  /\  K  <  M
) )
4139, 40sylibr 134 1  |-  ( ( K  =/=  M  /\  K  e.  ( 0 ... M ) )  ->  K  e.  ( 0..^ M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    e. wcel 2202    =/= wne 2402   class class class wbr 4088  (class class class)co 6017   RRcr 8030   0cc0 8031    < clt 8213    <_ cle 8214   NNcn 9142   NN0cn0 9401   ZZcz 9478   ...cfz 10242  ..^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-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
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-reap 8754  df-ap 8761  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