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

Theorem fzsuc2 10014
Description: Join a successor to the end of a finite set of sequential integers. (Contributed by Mario Carneiro, 7-Mar-2014.)
Assertion
Ref Expression
fzsuc2  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( M  -  1
) ) )  -> 
( M ... ( N  +  1 ) )  =  ( ( M ... N )  u.  { ( N  +  1 ) } ) )

Proof of Theorem fzsuc2
StepHypRef Expression
1 uzp1 9499 . 2  |-  ( N  e.  ( ZZ>= `  ( M  -  1 ) )  ->  ( N  =  ( M  - 
1 )  \/  N  e.  ( ZZ>= `  ( ( M  -  1 )  +  1 ) ) ) )
2 zcn 9196 . . . . . . . 8  |-  ( M  e.  ZZ  ->  M  e.  CC )
3 ax-1cn 7846 . . . . . . . 8  |-  1  e.  CC
4 npcan 8107 . . . . . . . 8  |-  ( ( M  e.  CC  /\  1  e.  CC )  ->  ( ( M  - 
1 )  +  1 )  =  M )
52, 3, 4sylancl 410 . . . . . . 7  |-  ( M  e.  ZZ  ->  (
( M  -  1 )  +  1 )  =  M )
65oveq2d 5858 . . . . . 6  |-  ( M  e.  ZZ  ->  ( M ... ( ( M  -  1 )  +  1 ) )  =  ( M ... M
) )
7 uncom 3266 . . . . . . . 8  |-  ( (/)  u. 
{ M } )  =  ( { M }  u.  (/) )
8 un0 3442 . . . . . . . 8  |-  ( { M }  u.  (/) )  =  { M }
97, 8eqtri 2186 . . . . . . 7  |-  ( (/)  u. 
{ M } )  =  { M }
10 zre 9195 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  M  e.  RR )
1110ltm1d 8827 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  ( M  -  1 )  <  M )
12 peano2zm 9229 . . . . . . . . . 10  |-  ( M  e.  ZZ  ->  ( M  -  1 )  e.  ZZ )
13 fzn 9977 . . . . . . . . . 10  |-  ( ( M  e.  ZZ  /\  ( M  -  1
)  e.  ZZ )  ->  ( ( M  -  1 )  < 
M  <->  ( M ... ( M  -  1
) )  =  (/) ) )
1412, 13mpdan 418 . . . . . . . . 9  |-  ( M  e.  ZZ  ->  (
( M  -  1 )  <  M  <->  ( M ... ( M  -  1 ) )  =  (/) ) )
1511, 14mpbid 146 . . . . . . . 8  |-  ( M  e.  ZZ  ->  ( M ... ( M  - 
1 ) )  =  (/) )
165sneqd 3589 . . . . . . . 8  |-  ( M  e.  ZZ  ->  { ( ( M  -  1 )  +  1 ) }  =  { M } )
1715, 16uneq12d 3277 . . . . . . 7  |-  ( M  e.  ZZ  ->  (
( M ... ( M  -  1 ) )  u.  { ( ( M  -  1 )  +  1 ) } )  =  (
(/)  u.  { M } ) )
18 fzsn 10001 . . . . . . 7  |-  ( M  e.  ZZ  ->  ( M ... M )  =  { M } )
199, 17, 183eqtr4a 2225 . . . . . 6  |-  ( M  e.  ZZ  ->  (
( M ... ( M  -  1 ) )  u.  { ( ( M  -  1 )  +  1 ) } )  =  ( M ... M ) )
206, 19eqtr4d 2201 . . . . 5  |-  ( M  e.  ZZ  ->  ( M ... ( ( M  -  1 )  +  1 ) )  =  ( ( M ... ( M  -  1
) )  u.  {
( ( M  - 
1 )  +  1 ) } ) )
21 oveq1 5849 . . . . . . 7  |-  ( N  =  ( M  - 
1 )  ->  ( N  +  1 )  =  ( ( M  -  1 )  +  1 ) )
2221oveq2d 5858 . . . . . 6  |-  ( N  =  ( M  - 
1 )  ->  ( M ... ( N  + 
1 ) )  =  ( M ... (
( M  -  1 )  +  1 ) ) )
23 oveq2 5850 . . . . . . 7  |-  ( N  =  ( M  - 
1 )  ->  ( M ... N )  =  ( M ... ( M  -  1 ) ) )
2421sneqd 3589 . . . . . . 7  |-  ( N  =  ( M  - 
1 )  ->  { ( N  +  1 ) }  =  { ( ( M  -  1 )  +  1 ) } )
2523, 24uneq12d 3277 . . . . . 6  |-  ( N  =  ( M  - 
1 )  ->  (
( M ... N
)  u.  { ( N  +  1 ) } )  =  ( ( M ... ( M  -  1 ) )  u.  { ( ( M  -  1 )  +  1 ) } ) )
2622, 25eqeq12d 2180 . . . . 5  |-  ( N  =  ( M  - 
1 )  ->  (
( M ... ( N  +  1 ) )  =  ( ( M ... N )  u.  { ( N  +  1 ) } )  <->  ( M ... ( ( M  - 
1 )  +  1 ) )  =  ( ( M ... ( M  -  1 ) )  u.  { ( ( M  -  1 )  +  1 ) } ) ) )
2720, 26syl5ibrcom 156 . . . 4  |-  ( M  e.  ZZ  ->  ( N  =  ( M  -  1 )  -> 
( M ... ( N  +  1 ) )  =  ( ( M ... N )  u.  { ( N  +  1 ) } ) ) )
2827imp 123 . . 3  |-  ( ( M  e.  ZZ  /\  N  =  ( M  -  1 ) )  ->  ( M ... ( N  +  1
) )  =  ( ( M ... N
)  u.  { ( N  +  1 ) } ) )
295fveq2d 5490 . . . . . 6  |-  ( M  e.  ZZ  ->  ( ZZ>=
`  ( ( M  -  1 )  +  1 ) )  =  ( ZZ>= `  M )
)
3029eleq2d 2236 . . . . 5  |-  ( M  e.  ZZ  ->  ( N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) )  <->  N  e.  ( ZZ>= `  M )
) )
3130biimpa 294 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )  ->  N  e.  ( ZZ>= `  M ) )
32 fzsuc 10004 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M ... ( N  +  1 ) )  =  ( ( M ... N
)  u.  { ( N  +  1 ) } ) )
3331, 32syl 14 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( ( M  - 
1 )  +  1 ) ) )  -> 
( M ... ( N  +  1 ) )  =  ( ( M ... N )  u.  { ( N  +  1 ) } ) )
3428, 33jaodan 787 . 2  |-  ( ( M  e.  ZZ  /\  ( N  =  ( M  -  1 )  \/  N  e.  (
ZZ>= `  ( ( M  -  1 )  +  1 ) ) ) )  ->  ( M ... ( N  +  1 ) )  =  ( ( M ... N
)  u.  { ( N  +  1 ) } ) )
351, 34sylan2 284 1  |-  ( ( M  e.  ZZ  /\  N  e.  ( ZZ>= `  ( M  -  1
) ) )  -> 
( M ... ( N  +  1 ) )  =  ( ( M ... N )  u.  { ( N  +  1 ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698    = wceq 1343    e. wcel 2136    u. cun 3114   (/)c0 3409   {csn 3576   class class class wbr 3982   ` cfv 5188  (class class class)co 5842   CCcc 7751   1c1 7754    + caddc 7756    < clt 7933    - cmin 8069   ZZcz 9191   ZZ>=cuz 9466   ...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-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869
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-reu 2451  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-int 3825  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-riota 5798  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-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192  df-uz 9467  df-fz 9945
This theorem is referenced by:  fseq1p1m1  10029  frecfzennn  10361  zfz1isolemsplit  10751  fsumm1  11357  fprodm1  11539
  Copyright terms: Public domain W3C validator