MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elfz2 Unicode version

Theorem elfz2 10881
Description: Membership in a finite set of sequential integers. We use the fact that an operation's value is empty outside of its domain to show  M  e.  ZZ and  N  e.  ZZ. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
elfz2  |-  ( K  e.  ( M ... N )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  /\  ( M  <_  K  /\  K  <_  N ) ) )

Proof of Theorem elfz2
StepHypRef Expression
1 anass 630 . 2  |-  ( ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  K  e.  ZZ )  /\  ( M  <_  K  /\  K  <_  N ) )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) )
2 df-3an 936 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  K  e.  ZZ ) )
32anbi1i 676 . 2  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  /\  ( M  <_  K  /\  K  <_  N ) )  <->  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  K  e.  ZZ )  /\  ( M  <_  K  /\  K  <_  N
) ) )
4 elfz1 10879 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N )  <-> 
( K  e.  ZZ  /\  M  <_  K  /\  K  <_  N ) ) )
5 3anass 938 . . . . 5  |-  ( ( K  e.  ZZ  /\  M  <_  K  /\  K  <_  N )  <->  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) )
6 ibar 490 . . . . 5  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) ) )
75, 6syl5bb 248 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  e.  ZZ  /\  M  <_  K  /\  K  <_  N
)  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) ) )
84, 7bitrd 244 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N )  <-> 
( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) ) )
9 fzf 10878 . . . . . . 7  |-  ... :
( ZZ  X.  ZZ )
--> ~P ZZ
109fdmi 5477 . . . . . 6  |-  dom  ...  =  ( ZZ  X.  ZZ )
1110ndmov 6091 . . . . 5  |-  ( -.  ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M ... N )  =  (/) )
1211eleq2d 2425 . . . 4  |-  ( -.  ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N
)  <->  K  e.  (/) ) )
13 noel 3535 . . . . . 6  |-  -.  K  e.  (/)
1413pm2.21i 123 . . . . 5  |-  ( K  e.  (/)  ->  ( M  e.  ZZ  /\  N  e.  ZZ ) )
15 simpl 443 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) )  ->  ( M  e.  ZZ  /\  N  e.  ZZ ) )
1614, 15pm5.21ni 341 . . . 4  |-  ( -.  ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  (/) 
<->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) ) )
1712, 16bitrd 244 . . 3  |-  ( -.  ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( M ... N
)  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) ) )
188, 17pm2.61i 156 . 2  |-  ( K  e.  ( M ... N )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  e.  ZZ  /\  ( M  <_  K  /\  K  <_  N ) ) ) )
191, 3, 183bitr4ri 269 1  |-  ( K  e.  ( M ... N )  <->  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  /\  ( M  <_  K  /\  K  <_  N ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 176    /\ wa 358    /\ w3a 934    e. wcel 1710   (/)c0 3531   ~Pcpw 3701   class class class wbr 4104    X. cxp 4769  (class class class)co 5945    <_ cle 8958   ZZcz 10116   ...cfz 10874
This theorem is referenced by:  elfz4  10883  elfzuzb  10884  fzind2  11015  ballotlemsdom  24018  ballotlemsel1i  24019  ballotlemsima  24022  ballotlemfrcn0  24036  fzp1nel  24511  fprodntriv  24569  fprodeq0  24600  preduz  24758  fmul01lt1lem1  27037  fmul01lt1lem2  27038  stoweidlem3  27075  stoweidlem34  27106  stoweidlem51  27123
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-sep 4222  ax-nul 4230  ax-pow 4269  ax-pr 4295  ax-un 4594  ax-cnex 8883  ax-resscn 8884
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-ral 2624  df-rex 2625  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-op 3725  df-uni 3909  df-iun 3988  df-br 4105  df-opab 4159  df-mpt 4160  df-id 4391  df-xp 4777  df-rel 4778  df-cnv 4779  df-co 4780  df-dm 4781  df-rn 4782  df-res 4783  df-ima 4784  df-iota 5301  df-fun 5339  df-fn 5340  df-f 5341  df-fv 5345  df-ov 5948  df-oprab 5949  df-mpt2 5950  df-1st 6209  df-2nd 6210  df-neg 9130  df-z 10117  df-fz 10875
  Copyright terms: Public domain W3C validator