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

Theorem elfzom1b 10435
Description: An integer is a member of a 1-based finite set of sequential integers iff its predecessor is a member of the corresponding 0-based set. (Contributed by Mario Carneiro, 27-Sep-2015.)
Assertion
Ref Expression
elfzom1b  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( 1..^ N )  <->  ( K  -  1 )  e.  ( 0..^ ( N  -  1 ) ) ) )

Proof of Theorem elfzom1b
StepHypRef Expression
1 peano2zm 9484 . . 3  |-  ( N  e.  ZZ  ->  ( N  -  1 )  e.  ZZ )
2 elfzm1b 10294 . . 3  |-  ( ( K  e.  ZZ  /\  ( N  -  1
)  e.  ZZ )  ->  ( K  e.  ( 1 ... ( N  -  1 ) )  <->  ( K  - 
1 )  e.  ( 0 ... ( ( N  -  1 )  -  1 ) ) ) )
31, 2sylan2 286 . 2  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( 1 ... ( N  -  1 ) )  <-> 
( K  -  1 )  e.  ( 0 ... ( ( N  -  1 )  - 
1 ) ) ) )
4 fzoval 10344 . . . 4  |-  ( N  e.  ZZ  ->  (
1..^ N )  =  ( 1 ... ( N  -  1 ) ) )
54adantl 277 . . 3  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( 1..^ N )  =  ( 1 ... ( N  -  1 ) ) )
65eleq2d 2299 . 2  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( 1..^ N )  <->  K  e.  ( 1 ... ( N  -  1 ) ) ) )
71adantl 277 . . . 4  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  -  1 )  e.  ZZ )
8 fzoval 10344 . . . 4  |-  ( ( N  -  1 )  e.  ZZ  ->  (
0..^ ( N  - 
1 ) )  =  ( 0 ... (
( N  -  1 )  -  1 ) ) )
97, 8syl 14 . . 3  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( 0..^ ( N  -  1 ) )  =  ( 0 ... ( ( N  - 
1 )  -  1 ) ) )
109eleq2d 2299 . 2  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  - 
1 )  e.  ( 0..^ ( N  - 
1 ) )  <->  ( K  -  1 )  e.  ( 0 ... (
( N  -  1 )  -  1 ) ) ) )
113, 6, 103bitr4d 220 1  |-  ( ( K  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  e.  ( 1..^ N )  <->  ( K  -  1 )  e.  ( 0..^ ( N  -  1 ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200  (class class class)co 6001   0cc0 7999   1c1 8000    - cmin 8317   ZZcz 9446   ...cfz 10204  ..^cfzo 10338
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-ltadd 8115
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-fz 10205  df-fzo 10339
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator