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

Theorem iseqf1olemfvp 10947
Description: Lemma for seq3f1o 10954. (Contributed by Jim Kingdon, 30-Aug-2022.)
Hypotheses
Ref Expression
iseqf1olemfvp.k  |-  ( ph  ->  K  e.  ( M ... N ) )
iseqf1olemfvp.t  |-  ( ph  ->  T : ( M ... N ) -1-1-onto-> ( M ... N ) )
iseqf1olemfvp.a  |-  ( ph  ->  A  e.  ( M ... N ) )
iseqf1olemfvp.g  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( G `  x )  e.  S
)
iseqf1olemfvp.p  |-  P  =  ( x  e.  (
ZZ>= `  M )  |->  if ( x  <_  N ,  ( G `  ( f `  x
) ) ,  ( G `  M ) ) )
Assertion
Ref Expression
iseqf1olemfvp  |-  ( ph  ->  ( [_ T  / 
f ]_ P `  A
)  =  ( G `
 ( T `  A ) ) )
Distinct variable groups:    x, A    f, G, x    x, K    f, M, x    f, N, x   
x, S    T, f, x    ph, x
Allowed substitution hints:    ph( f)    A( f)    P( x,  f)    S( f)    K( f)

Proof of Theorem iseqf1olemfvp
StepHypRef Expression
1 iseqf1olemfvp.p . . . . 5  |-  P  =  ( x  e.  (
ZZ>= `  M )  |->  if ( x  <_  N ,  ( G `  ( f `  x
) ) ,  ( G `  M ) ) )
21csbeq2i 3174 . . . 4  |-  [_ T  /  f ]_ P  =  [_ T  /  f ]_ ( x  e.  (
ZZ>= `  M )  |->  if ( x  <_  N ,  ( G `  ( f `  x
) ) ,  ( G `  M ) ) )
3 iseqf1olemfvp.t . . . . . . 7  |-  ( ph  ->  T : ( M ... N ) -1-1-onto-> ( M ... N ) )
4 f1of 5639 . . . . . . 7  |-  ( T : ( M ... N ) -1-1-onto-> ( M ... N
)  ->  T :
( M ... N
) --> ( M ... N ) )
53, 4syl 14 . . . . . 6  |-  ( ph  ->  T : ( M ... N ) --> ( M ... N ) )
6 iseqf1olemfvp.k . . . . . . . 8  |-  ( ph  ->  K  e.  ( M ... N ) )
7 elfzel1 10427 . . . . . . . 8  |-  ( K  e.  ( M ... N )  ->  M  e.  ZZ )
86, 7syl 14 . . . . . . 7  |-  ( ph  ->  M  e.  ZZ )
9 elfzel2 10426 . . . . . . . 8  |-  ( K  e.  ( M ... N )  ->  N  e.  ZZ )
106, 9syl 14 . . . . . . 7  |-  ( ph  ->  N  e.  ZZ )
118, 10fzfigd 10868 . . . . . 6  |-  ( ph  ->  ( M ... N
)  e.  Fin )
12 fex 5947 . . . . . 6  |-  ( ( T : ( M ... N ) --> ( M ... N )  /\  ( M ... N )  e.  Fin )  ->  T  e.  _V )
135, 11, 12syl2anc 415 . . . . 5  |-  ( ph  ->  T  e.  _V )
14 nfcvd 2393 . . . . . 6  |-  ( T  e.  _V  ->  F/_ f
( x  e.  (
ZZ>= `  M )  |->  if ( x  <_  N ,  ( G `  ( T `  x ) ) ,  ( G `
 M ) ) ) )
15 fveq1 5694 . . . . . . . . 9  |-  ( f  =  T  ->  (
f `  x )  =  ( T `  x ) )
1615fveq2d 5699 . . . . . . . 8  |-  ( f  =  T  ->  ( G `  ( f `  x ) )  =  ( G `  ( T `  x )
) )
1716ifeq1d 3658 . . . . . . 7  |-  ( f  =  T  ->  if ( x  <_  N , 
( G `  (
f `  x )
) ,  ( G `
 M ) )  =  if ( x  <_  N ,  ( G `  ( T `
 x ) ) ,  ( G `  M ) ) )
1817mpteq2dv 4222 . . . . . 6  |-  ( f  =  T  ->  (
x  e.  ( ZZ>= `  M )  |->  if ( x  <_  N , 
( G `  (
f `  x )
) ,  ( G `
 M ) ) )  =  ( x  e.  ( ZZ>= `  M
)  |->  if ( x  <_  N ,  ( G `  ( T `
 x ) ) ,  ( G `  M ) ) ) )
1914, 18csbiegf 3191 . . . . 5  |-  ( T  e.  _V  ->  [_ T  /  f ]_ (
x  e.  ( ZZ>= `  M )  |->  if ( x  <_  N , 
( G `  (
f `  x )
) ,  ( G `
 M ) ) )  =  ( x  e.  ( ZZ>= `  M
)  |->  if ( x  <_  N ,  ( G `  ( T `
 x ) ) ,  ( G `  M ) ) ) )
2013, 19syl 14 . . . 4  |-  ( ph  ->  [_ T  /  f ]_ ( x  e.  (
ZZ>= `  M )  |->  if ( x  <_  N ,  ( G `  ( f `  x
) ) ,  ( G `  M ) ) )  =  ( x  e.  ( ZZ>= `  M )  |->  if ( x  <_  N , 
( G `  ( T `  x )
) ,  ( G `
 M ) ) ) )
212, 20eqtrid 2283 . . 3  |-  ( ph  ->  [_ T  /  f ]_ P  =  (
x  e.  ( ZZ>= `  M )  |->  if ( x  <_  N , 
( G `  ( T `  x )
) ,  ( G `
 M ) ) ) )
22 simpr 110 . . . . 5  |-  ( (
ph  /\  x  =  A )  ->  x  =  A )
2322breq1d 4140 . . . 4  |-  ( (
ph  /\  x  =  A )  ->  (
x  <_  N  <->  A  <_  N ) )
2422fveq2d 5699 . . . . 5  |-  ( (
ph  /\  x  =  A )  ->  ( T `  x )  =  ( T `  A ) )
2524fveq2d 5699 . . . 4  |-  ( (
ph  /\  x  =  A )  ->  ( G `  ( T `  x ) )  =  ( G `  ( T `  A )
) )
2623, 25ifbieq1d 3663 . . 3  |-  ( (
ph  /\  x  =  A )  ->  if ( x  <_  N , 
( G `  ( T `  x )
) ,  ( G `
 M ) )  =  if ( A  <_  N ,  ( G `  ( T `
 A ) ) ,  ( G `  M ) ) )
27 iseqf1olemfvp.a . . . 4  |-  ( ph  ->  A  e.  ( M ... N ) )
28 elfzuz 10424 . . . 4  |-  ( A  e.  ( M ... N )  ->  A  e.  ( ZZ>= `  M )
)
2927, 28syl 14 . . 3  |-  ( ph  ->  A  e.  ( ZZ>= `  M ) )
30 elfzle2 10432 . . . . . 6  |-  ( A  e.  ( M ... N )  ->  A  <_  N )
3127, 30syl 14 . . . . 5  |-  ( ph  ->  A  <_  N )
3231iftrued 3647 . . . 4  |-  ( ph  ->  if ( A  <_  N ,  ( G `  ( T `  A
) ) ,  ( G `  M ) )  =  ( G `
 ( T `  A ) ) )
33 fveq2 5695 . . . . . 6  |-  ( x  =  ( T `  A )  ->  ( G `  x )  =  ( G `  ( T `  A ) ) )
3433eleq1d 2307 . . . . 5  |-  ( x  =  ( T `  A )  ->  (
( G `  x
)  e.  S  <->  ( G `  ( T `  A
) )  e.  S
) )
35 iseqf1olemfvp.g . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( G `  x )  e.  S
)
3635ralrimiva 2623 . . . . 5  |-  ( ph  ->  A. x  e.  (
ZZ>= `  M ) ( G `  x )  e.  S )
375, 27ffvelcdmd 5844 . . . . . 6  |-  ( ph  ->  ( T `  A
)  e.  ( M ... N ) )
38 elfzuz 10424 . . . . . 6  |-  ( ( T `  A )  e.  ( M ... N )  ->  ( T `  A )  e.  ( ZZ>= `  M )
)
3937, 38syl 14 . . . . 5  |-  ( ph  ->  ( T `  A
)  e.  ( ZZ>= `  M ) )
4034, 36, 39rspcdva 2934 . . . 4  |-  ( ph  ->  ( G `  ( T `  A )
)  e.  S )
4132, 40eqeltrd 2315 . . 3  |-  ( ph  ->  if ( A  <_  N ,  ( G `  ( T `  A
) ) ,  ( G `  M ) )  e.  S )
4221, 26, 29, 41fvmptd 5786 . 2  |-  ( ph  ->  ( [_ T  / 
f ]_ P `  A
)  =  if ( A  <_  N , 
( G `  ( T `  A )
) ,  ( G `
 M ) ) )
4342, 32eqtrd 2271 1  |-  ( ph  ->  ( [_ T  / 
f ]_ P `  A
)  =  ( G `
 ( T `  A ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   [_csb 3147   ifcif 3638   class class class wbr 4130    |-> cmpt 4192   -->wf 5373   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085   Fincfn 7022    <_ cle 8361   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412
This theorem is used by:  seq3f1olemqsumkj  10948  seq3f1olemqsumk  10949
  Copyright terms: Public domain W3C validator