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

Theorem fseq1m1p1 9112
Description: Add/remove an item to/from the end of a finite sequence. (Contributed by Paul Chapman, 17-Nov-2012.)
Hypothesis
Ref Expression
fseq1m1p1.1  |-  H  =  { <. N ,  B >. }
Assertion
Ref Expression
fseq1m1p1  |-  ( N  e.  NN  ->  (
( F : ( 1 ... ( N  -  1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  H
) )  <->  ( G : ( 1 ... N ) --> A  /\  ( G `  N )  =  B  /\  F  =  ( G  |`  ( 1 ... ( N  -  1 ) ) ) ) ) )

Proof of Theorem fseq1m1p1
StepHypRef Expression
1 nnm1nn0 8329 . . 3  |-  ( N  e.  NN  ->  ( N  -  1 )  e.  NN0 )
2 eqid 2081 . . . 4  |-  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  { <. ( ( N  -  1 )  +  1 ) ,  B >. }
32fseq1p1m1 9111 . . 3  |-  ( ( N  -  1 )  e.  NN0  ->  ( ( F : ( 1 ... ( N  - 
1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  { <. (
( N  -  1 )  +  1 ) ,  B >. } ) )  <->  ( G :
( 1 ... (
( N  -  1 )  +  1 ) ) --> A  /\  ( G `  ( ( N  -  1 )  +  1 ) )  =  B  /\  F  =  ( G  |`  ( 1 ... ( N  -  1 ) ) ) ) ) )
41, 3syl 14 . 2  |-  ( N  e.  NN  ->  (
( F : ( 1 ... ( N  -  1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  { <. ( ( N  - 
1 )  +  1 ) ,  B >. } ) )  <->  ( G : ( 1 ... ( ( N  - 
1 )  +  1 ) ) --> A  /\  ( G `  ( ( N  -  1 )  +  1 ) )  =  B  /\  F  =  ( G  |`  ( 1 ... ( N  -  1 ) ) ) ) ) )
5 nncn 8047 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  CC )
6 ax-1cn 7069 . . . . . . . . 9  |-  1  e.  CC
7 npcan 7317 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
85, 6, 7sylancl 404 . . . . . . . 8  |-  ( N  e.  NN  ->  (
( N  -  1 )  +  1 )  =  N )
98opeq1d 3576 . . . . . . 7  |-  ( N  e.  NN  ->  <. (
( N  -  1 )  +  1 ) ,  B >.  =  <. N ,  B >. )
109sneqd 3411 . . . . . 6  |-  ( N  e.  NN  ->  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  { <. N ,  B >. } )
11 fseq1m1p1.1 . . . . . 6  |-  H  =  { <. N ,  B >. }
1210, 11syl6eqr 2131 . . . . 5  |-  ( N  e.  NN  ->  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  H )
1312uneq2d 3126 . . . 4  |-  ( N  e.  NN  ->  ( F  u.  { <. (
( N  -  1 )  +  1 ) ,  B >. } )  =  ( F  u.  H ) )
1413eqeq2d 2092 . . 3  |-  ( N  e.  NN  ->  ( G  =  ( F  u.  { <. ( ( N  -  1 )  +  1 ) ,  B >. } )  <->  G  =  ( F  u.  H
) ) )
15143anbi3d 1249 . 2  |-  ( N  e.  NN  ->  (
( F : ( 1 ... ( N  -  1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  { <. ( ( N  - 
1 )  +  1 ) ,  B >. } ) )  <->  ( F : ( 1 ... ( N  -  1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  H ) ) ) )
168oveq2d 5548 . . . 4  |-  ( N  e.  NN  ->  (
1 ... ( ( N  -  1 )  +  1 ) )  =  ( 1 ... N
) )
1716feq2d 5055 . . 3  |-  ( N  e.  NN  ->  ( G : ( 1 ... ( ( N  - 
1 )  +  1 ) ) --> A  <->  G :
( 1 ... N
) --> A ) )
188fveq2d 5202 . . . 4  |-  ( N  e.  NN  ->  ( G `  ( ( N  -  1 )  +  1 ) )  =  ( G `  N ) )
1918eqeq1d 2089 . . 3  |-  ( N  e.  NN  ->  (
( G `  (
( N  -  1 )  +  1 ) )  =  B  <->  ( G `  N )  =  B ) )
2017, 193anbi12d 1244 . 2  |-  ( N  e.  NN  ->  (
( G : ( 1 ... ( ( N  -  1 )  +  1 ) ) --> A  /\  ( G `
 ( ( N  -  1 )  +  1 ) )  =  B  /\  F  =  ( G  |`  (
1 ... ( N  - 
1 ) ) ) )  <->  ( G :
( 1 ... N
) --> A  /\  ( G `  N )  =  B  /\  F  =  ( G  |`  (
1 ... ( N  - 
1 ) ) ) ) ) )
214, 15, 203bitr3d 216 1  |-  ( N  e.  NN  ->  (
( F : ( 1 ... ( N  -  1 ) ) --> A  /\  B  e.  A  /\  G  =  ( F  u.  H
) )  <->  ( G : ( 1 ... N ) --> A  /\  ( G `  N )  =  B  /\  F  =  ( G  |`  ( 1 ... ( N  -  1 ) ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433    u. cun 2971   {csn 3398   <.cop 3401    |` cres 4365   -->wf 4918   ` cfv 4922  (class class class)co 5532   CCcc 6979   1c1 6982    + caddc 6984    - cmin 7279   NNcn 8039   NN0cn0 8288   ...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-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-apti 7091  ax-pre-ltadd 7092
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-reu 2355  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-int 3637  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-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-riota 5488  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-sub 7281  df-neg 7282  df-inn 8040  df-n0 8289  df-z 8352  df-uz 8620  df-fz 9030
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator