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

Theorem fseq1m1p1 9979
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 9114 . . 3  |-  ( N  e.  NN  ->  ( N  -  1 )  e.  NN0 )
2 eqid 2157 . . . 4  |-  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  { <. ( ( N  -  1 )  +  1 ) ,  B >. }
32fseq1p1m1 9978 . . 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 8824 . . . . . . . . 9  |-  ( N  e.  NN  ->  N  e.  CC )
6 ax-1cn 7808 . . . . . . . . 9  |-  1  e.  CC
7 npcan 8067 . . . . . . . . 9  |-  ( ( N  e.  CC  /\  1  e.  CC )  ->  ( ( N  - 
1 )  +  1 )  =  N )
85, 6, 7sylancl 410 . . . . . . . 8  |-  ( N  e.  NN  ->  (
( N  -  1 )  +  1 )  =  N )
98opeq1d 3747 . . . . . . 7  |-  ( N  e.  NN  ->  <. (
( N  -  1 )  +  1 ) ,  B >.  =  <. N ,  B >. )
109sneqd 3573 . . . . . 6  |-  ( N  e.  NN  ->  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  { <. N ,  B >. } )
11 fseq1m1p1.1 . . . . . 6  |-  H  =  { <. N ,  B >. }
1210, 11eqtr4di 2208 . . . . 5  |-  ( N  e.  NN  ->  { <. ( ( N  -  1 )  +  1 ) ,  B >. }  =  H )
1312uneq2d 3261 . . . 4  |-  ( N  e.  NN  ->  ( F  u.  { <. (
( N  -  1 )  +  1 ) ,  B >. } )  =  ( F  u.  H ) )
1413eqeq2d 2169 . . 3  |-  ( N  e.  NN  ->  ( G  =  ( F  u.  { <. ( ( N  -  1 )  +  1 ) ,  B >. } )  <->  G  =  ( F  u.  H
) ) )
15143anbi3d 1300 . 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 5834 . . . 4  |-  ( N  e.  NN  ->  (
1 ... ( ( N  -  1 )  +  1 ) )  =  ( 1 ... N
) )
1716feq2d 5304 . . 3  |-  ( N  e.  NN  ->  ( G : ( 1 ... ( ( N  - 
1 )  +  1 ) ) --> A  <->  G :
( 1 ... N
) --> A ) )
188fveq2d 5469 . . . 4  |-  ( N  e.  NN  ->  ( G `  ( ( N  -  1 )  +  1 ) )  =  ( G `  N ) )
1918eqeq1d 2166 . . 3  |-  ( N  e.  NN  ->  (
( G `  (
( N  -  1 )  +  1 ) )  =  B  <->  ( G `  N )  =  B ) )
2017, 193anbi12d 1295 . 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 217 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 104    /\ w3a 963    = wceq 1335    e. wcel 2128    u. cun 3100   {csn 3560   <.cop 3563    |` cres 4585   -->wf 5163   ` cfv 5167  (class class class)co 5818   CCcc 7713   1c1 7716    + caddc 7718    - cmin 8029   NNcn 8816   NN0cn0 9073   ...cfz 9894
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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4134  ax-pr 4168  ax-un 4392  ax-setind 4494  ax-cnex 7806  ax-resscn 7807  ax-1cn 7808  ax-1re 7809  ax-icn 7810  ax-addcl 7811  ax-addrcl 7812  ax-mulcl 7813  ax-addcom 7815  ax-addass 7817  ax-distr 7819  ax-i2m1 7820  ax-0lt1 7821  ax-0id 7823  ax-rnegex 7824  ax-cnre 7826  ax-pre-ltirr 7827  ax-pre-ltwlin 7828  ax-pre-lttrn 7829  ax-pre-apti 7830  ax-pre-ltadd 7831
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-int 3808  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4252  df-xp 4589  df-rel 4590  df-cnv 4591  df-co 4592  df-dm 4593  df-rn 4594  df-res 4595  df-ima 4596  df-iota 5132  df-fun 5169  df-fn 5170  df-f 5171  df-f1 5172  df-fo 5173  df-f1o 5174  df-fv 5175  df-riota 5774  df-ov 5821  df-oprab 5822  df-mpo 5823  df-pnf 7897  df-mnf 7898  df-xr 7899  df-ltxr 7900  df-le 7901  df-sub 8031  df-neg 8032  df-inn 8817  df-n0 9074  df-z 9151  df-uz 9423  df-fz 9895
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator