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

Theorem fznlem 9976
Description: A finite set of sequential integers is empty if the bounds are reversed. (Contributed by Jim Kingdon, 16-Apr-2020.)
Assertion
Ref Expression
fznlem  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  ->  ( M ... N
)  =  (/) ) )

Proof of Theorem fznlem
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 zre 9195 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  RR )
2 zre 9195 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  RR )
3 lenlt 7974 . . . . . . . . . . 11  |-  ( ( M  e.  RR  /\  N  e.  RR )  ->  ( M  <_  N  <->  -.  N  <  M ) )
41, 2, 3syl2an 287 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  <_  N  <->  -.  N  <  M ) )
54biimpd 143 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  <_  N  ->  -.  N  <  M
) )
65con2d 614 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  ->  -.  M  <_  N
) )
76imp 123 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  -.  M  <_  N )
87adantr 274 . . . . . 6  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  -.  M  <_  N )
9 simplll 523 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  M  e.  ZZ )
109zred 9313 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  M  e.  RR )
11 simpr 109 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  k  e.  ZZ )
1211zred 9313 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  k  e.  RR )
13 simpllr 524 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  N  e.  ZZ )
1413zred 9313 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  N  e.  RR )
15 letr 7981 . . . . . . 7  |-  ( ( M  e.  RR  /\  k  e.  RR  /\  N  e.  RR )  ->  (
( M  <_  k  /\  k  <_  N )  ->  M  <_  N
) )
1610, 12, 14, 15syl3anc 1228 . . . . . 6  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  (
( M  <_  k  /\  k  <_  N )  ->  M  <_  N
) )
178, 16mtod 653 . . . . 5  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  -.  ( M  <_  k  /\  k  <_  N ) )
1817ralrimiva 2539 . . . 4  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  A. k  e.  ZZ  -.  ( M  <_  k  /\  k  <_  N ) )
19 rabeq0 3438 . . . 4  |-  ( { k  e.  ZZ  | 
( M  <_  k  /\  k  <_  N ) }  =  (/)  <->  A. k  e.  ZZ  -.  ( M  <_  k  /\  k  <_  N ) )
2018, 19sylibr 133 . . 3  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  { k  e.  ZZ  |  ( M  <_  k  /\  k  <_  N ) }  =  (/) )
21 fzval 9946 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M ... N
)  =  { k  e.  ZZ  |  ( M  <_  k  /\  k  <_  N ) } )
2221eqeq1d 2174 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( M ... N )  =  (/)  <->  {
k  e.  ZZ  | 
( M  <_  k  /\  k  <_  N ) }  =  (/) ) )
2322adantr 274 . . 3  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  ( ( M ... N )  =  (/) 
<->  { k  e.  ZZ  |  ( M  <_ 
k  /\  k  <_  N ) }  =  (/) ) )
2420, 23mpbird 166 . 2  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  ( M ... N )  =  (/) )
2524ex 114 1  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  ->  ( M ... N
)  =  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   A.wral 2444   {crab 2448   (/)c0 3409   class class class wbr 3982  (class class class)co 5842   RRcr 7752    < clt 7933    <_ cle 7934   ZZcz 9191   ...cfz 9944
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-pre-ltwlin 7866
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-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-neg 8072  df-z 9192  df-fz 9945
This theorem is referenced by:  fzn  9977
  Copyright terms: Public domain W3C validator