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

Theorem fznlem 10424
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 9627 . . . . . . . . . . 11  |-  ( M  e.  ZZ  ->  M  e.  RR )
2 zre 9627 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  RR )
3 lenlt 8391 . . . . . . . . . . 11  |-  ( ( M  e.  RR  /\  N  e.  RR )  ->  ( M  <_  N  <->  -.  N  <  M ) )
41, 2, 3syl2an 289 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  <_  N  <->  -.  N  <  M ) )
54biimpd 144 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  <_  N  ->  -.  N  <  M
) )
65con2d 633 . . . . . . . 8  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  ->  -.  M  <_  N
) )
76imp 124 . . . . . . 7  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  -.  M  <_  N )
87adantr 276 . . . . . 6  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  -.  M  <_  N )
9 simplll 539 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  M  e.  ZZ )
109zred 9747 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  M  e.  RR )
11 simpr 110 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  k  e.  ZZ )
1211zred 9747 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  k  e.  RR )
13 simpllr 540 . . . . . . . 8  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  N  e.  ZZ )
1413zred 9747 . . . . . . 7  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  N  e.  RR )
15 letr 8398 . . . . . . 7  |-  ( ( M  e.  RR  /\  k  e.  RR  /\  N  e.  RR )  ->  (
( M  <_  k  /\  k  <_  N )  ->  M  <_  N
) )
1610, 12, 14, 15syl3anc 1278 . . . . . 6  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  (
( M  <_  k  /\  k  <_  N )  ->  M  <_  N
) )
178, 16mtod 673 . . . . 5  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M )  /\  k  e.  ZZ )  ->  -.  ( M  <_  k  /\  k  <_  N ) )
1817ralrimiva 2623 . . . 4  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  A. k  e.  ZZ  -.  ( M  <_  k  /\  k  <_  N ) )
19 rabeq0 3552 . . . 4  |-  ( { k  e.  ZZ  | 
( M  <_  k  /\  k  <_  N ) }  =  (/)  <->  A. k  e.  ZZ  -.  ( M  <_  k  /\  k  <_  N ) )
2018, 19sylibr 134 . . 3  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  { k  e.  ZZ  |  ( M  <_  k  /\  k  <_  N ) }  =  (/) )
21 fzval 10392 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M ... N
)  =  { k  e.  ZZ  |  ( M  <_  k  /\  k  <_  N ) } )
2221eqeq1d 2247 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( M ... N )  =  (/)  <->  {
k  e.  ZZ  | 
( M  <_  k  /\  k  <_  N ) }  =  (/) ) )
2322adantr 276 . . 3  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  ( ( M ... N )  =  (/) 
<->  { k  e.  ZZ  |  ( M  <_ 
k  /\  k  <_  N ) }  =  (/) ) )
2420, 23mpbird 167 . 2  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  N  <  M
)  ->  ( M ... N )  =  (/) )
2524ex 115 1  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  <  M  ->  ( M ... N
)  =  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532   (/)c0 3520   class class class wbr 4125  (class class class)co 6075   RRcr 8168    < clt 8350    <_ cle 8351   ZZcz 9623   ...cfz 10390
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-pre-ltwlin 8282
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-neg 8490  df-z 9624  df-fz 10391
This theorem is referenced by:  fzn  10425
  Copyright terms: Public domain W3C validator