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

Theorem fzdisj 9071
Description: Condition for two finite intervals of integers to be disjoint. (Contributed by Jeff Madsen, 17-Jun-2010.)
Assertion
Ref Expression
fzdisj  |-  ( K  <  M  ->  (
( J ... K
)  i^i  ( M ... N ) )  =  (/) )

Proof of Theorem fzdisj
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elin 3155 . . . 4  |-  ( x  e.  ( ( J ... K )  i^i  ( M ... N
) )  <->  ( x  e.  ( J ... K
)  /\  x  e.  ( M ... N ) ) )
2 elfzel1 9044 . . . . . . . 8  |-  ( x  e.  ( M ... N )  ->  M  e.  ZZ )
32adantl 271 . . . . . . 7  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  M  e.  ZZ )
43zred 8469 . . . . . 6  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  M  e.  RR )
5 elfzelz 9045 . . . . . . . 8  |-  ( x  e.  ( M ... N )  ->  x  e.  ZZ )
65zred 8469 . . . . . . 7  |-  ( x  e.  ( M ... N )  ->  x  e.  RR )
76adantl 271 . . . . . 6  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  x  e.  RR )
8 elfzel2 9043 . . . . . . . 8  |-  ( x  e.  ( J ... K )  ->  K  e.  ZZ )
98adantr 270 . . . . . . 7  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  K  e.  ZZ )
109zred 8469 . . . . . 6  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  K  e.  RR )
11 elfzle1 9046 . . . . . . 7  |-  ( x  e.  ( M ... N )  ->  M  <_  x )
1211adantl 271 . . . . . 6  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  M  <_  x )
13 elfzle2 9047 . . . . . . 7  |-  ( x  e.  ( J ... K )  ->  x  <_  K )
1413adantr 270 . . . . . 6  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  x  <_  K )
154, 7, 10, 12, 14letrd 7233 . . . . 5  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  M  <_  K )
164, 10lenltd 7227 . . . . 5  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  -> 
( M  <_  K  <->  -.  K  <  M ) )
1715, 16mpbid 145 . . . 4  |-  ( ( x  e.  ( J ... K )  /\  x  e.  ( M ... N ) )  ->  -.  K  <  M )
181, 17sylbi 119 . . 3  |-  ( x  e.  ( ( J ... K )  i^i  ( M ... N
) )  ->  -.  K  <  M )
1918con2i 589 . 2  |-  ( K  <  M  ->  -.  x  e.  ( ( J ... K )  i^i  ( M ... N
) ) )
2019eq0rdv 3288 1  |-  ( K  <  M  ->  (
( J ... K
)  i^i  ( M ... N ) )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    = wceq 1284    e. wcel 1433    i^i cin 2972   (/)c0 3251   class class class wbr 3785  (class class class)co 5532   RRcr 6980    < clt 7153    <_ cle 7154   ZZcz 8351   ...cfz 9029
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-cnex 7067  ax-resscn 7068  ax-pre-ltwlin 7089
This theorem depends on definitions:  df-bi 115  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-neg 7282  df-z 8352  df-uz 8620  df-fz 9030
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator