MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  splcl Structured version   Unicode version

Theorem splcl 12399
Description: Closure of the substring replacement operator. (Contributed by Stefan O'Rear, 26-Aug-2015.)
Assertion
Ref Expression
splcl  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( S splice  <. F ,  T ,  R >. )  e. Word  A )

Proof of Theorem splcl
Dummy variables  s 
b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2986 . . . 4  |-  ( S  e. Word  A  ->  S  e.  _V )
2 otex 4562 . . . 4  |-  <. F ,  T ,  R >.  e. 
_V
3 id 22 . . . . . . . 8  |-  ( s  =  S  ->  s  =  S )
4 fveq2 5696 . . . . . . . . . 10  |-  ( b  =  <. F ,  T ,  R >.  ->  ( 1st `  b )  =  ( 1st `  <. F ,  T ,  R >. ) )
54fveq2d 5700 . . . . . . . . 9  |-  ( b  =  <. F ,  T ,  R >.  ->  ( 1st `  ( 1st `  b
) )  =  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) )
65opeq2d 4071 . . . . . . . 8  |-  ( b  =  <. F ,  T ,  R >.  ->  <. 0 ,  ( 1st `  ( 1st `  b ) )
>.  =  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
)
73, 6oveqan12d 6115 . . . . . . 7  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( s substr  <. 0 ,  ( 1st `  ( 1st `  b
) ) >. )  =  ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) )
8 simpr 461 . . . . . . . 8  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  b  =  <. F ,  T ,  R >. )
98fveq2d 5700 . . . . . . 7  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( 2nd `  b
)  =  ( 2nd `  <. F ,  T ,  R >. ) )
107, 9oveq12d 6114 . . . . . 6  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( ( s substr  <. 0 ,  ( 1st `  ( 1st `  b
) ) >. ) concat  ( 2nd `  b ) )  =  ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) )
11 simpl 457 . . . . . . 7  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  s  =  S )
128fveq2d 5700 . . . . . . . . 9  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( 1st `  b
)  =  ( 1st `  <. F ,  T ,  R >. ) )
1312fveq2d 5700 . . . . . . . 8  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( 2nd `  ( 1st `  b ) )  =  ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) )
1411fveq2d 5700 . . . . . . . 8  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( # `  s
)  =  ( # `  S ) )
1513, 14opeq12d 4072 . . . . . . 7  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  <. ( 2nd `  ( 1st `  b ) ) ,  ( # `  s
) >.  =  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  (
# `  S ) >. )
1611, 15oveq12d 6114 . . . . . 6  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( s substr  <. ( 2nd `  ( 1st `  b ) ) ,  ( # `  s
) >. )  =  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) )
1710, 16oveq12d 6114 . . . . 5  |-  ( ( s  =  S  /\  b  =  <. F ,  T ,  R >. )  ->  ( ( ( s substr  <. 0 ,  ( 1st `  ( 1st `  b ) ) >.
) concat  ( 2nd `  b
) ) concat  ( s substr  <.
( 2nd `  ( 1st `  b ) ) ,  ( # `  s
) >. ) )  =  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >. ) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  (
# `  S ) >. ) ) )
18 df-splice 12239 . . . . 5  |- splice  =  ( s  e.  _V , 
b  e.  _V  |->  ( ( ( s substr  <. 0 ,  ( 1st `  ( 1st `  b
) ) >. ) concat  ( 2nd `  b ) ) concat  ( s substr  <. ( 2nd `  ( 1st `  b ) ) ,  ( # `  s
) >. ) ) )
19 ovex 6121 . . . . 5  |-  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) )  e. 
_V
2017, 18, 19ovmpt2a 6226 . . . 4  |-  ( ( S  e.  _V  /\  <. F ,  T ,  R >.  e.  _V )  ->  ( S splice  <. F ,  T ,  R >. )  =  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) ) )
211, 2, 20sylancl 662 . . 3  |-  ( S  e. Word  A  ->  ( S splice  <. F ,  T ,  R >. )  =  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) ) )
2221adantr 465 . 2  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( S splice  <. F ,  T ,  R >. )  =  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) ) )
23 swrdcl 12320 . . . . 5  |-  ( S  e. Word  A  ->  ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
)  e. Word  A )
2423adantr 465 . . . 4  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
)  e. Word  A )
25 ot3rdg 6598 . . . . . 6  |-  ( R  e. Word  A  ->  ( 2nd `  <. F ,  T ,  R >. )  =  R )
2625adantl 466 . . . . 5  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( 2nd `  <. F ,  T ,  R >. )  =  R )
27 simpr 461 . . . . 5  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  R  e. Word  A )
2826, 27eqeltrd 2517 . . . 4  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( 2nd `  <. F ,  T ,  R >. )  e. Word  A )
29 ccatcl 12279 . . . 4  |-  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
)  e. Word  A  /\  ( 2nd `  <. F ,  T ,  R >. )  e. Word  A )  -> 
( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) )  e. Word  A
)
3024, 28, 29syl2anc 661 . . 3  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) )  e. Word  A
)
31 swrdcl 12320 . . . 4  |-  ( S  e. Word  A  ->  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. )  e. Word  A
)
3231adantr 465 . . 3  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  (
# `  S ) >. )  e. Word  A )
33 ccatcl 12279 . . 3  |-  ( ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) )  e. Word  A  /\  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  (
# `  S ) >. )  e. Word  A )  ->  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >.
) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  ( # `  S
) >. ) )  e. Word  A )
3430, 32, 33syl2anc 661 . 2  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( ( ( S substr  <. 0 ,  ( 1st `  ( 1st `  <. F ,  T ,  R >. ) ) >. ) concat  ( 2nd `  <. F ,  T ,  R >. ) ) concat  ( S substr  <. ( 2nd `  ( 1st `  <. F ,  T ,  R >. ) ) ,  (
# `  S ) >. ) )  e. Word  A
)
3522, 34eqeltrd 2517 1  |-  ( ( S  e. Word  A  /\  R  e. Word  A )  ->  ( S splice  <. F ,  T ,  R >. )  e. Word  A )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1369    e. wcel 1756   _Vcvv 2977   <.cop 3888   <.cotp 3890   ` cfv 5423  (class class class)co 6096   1stc1st 6580   2ndc2nd 6581   0cc0 9287   #chash 12108  Word cword 12226   concat cconcat 12228   substr csubstr 12230   splice csplice 12231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4408  ax-sep 4418  ax-nul 4426  ax-pow 4475  ax-pr 4536  ax-un 6377  ax-cnex 9343  ax-resscn 9344  ax-1cn 9345  ax-icn 9346  ax-addcl 9347  ax-addrcl 9348  ax-mulcl 9349  ax-mulrcl 9350  ax-mulcom 9351  ax-addass 9352  ax-mulass 9353  ax-distr 9354  ax-i2m1 9355  ax-1ne0 9356  ax-1rid 9357  ax-rnegex 9358  ax-rrecex 9359  ax-cnre 9360  ax-pre-lttri 9361  ax-pre-lttrn 9362  ax-pre-ltadd 9363  ax-pre-mulgt0 9364
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2573  df-ne 2613  df-nel 2614  df-ral 2725  df-rex 2726  df-reu 2727  df-rab 2729  df-v 2979  df-sbc 3192  df-csb 3294  df-dif 3336  df-un 3338  df-in 3340  df-ss 3347  df-pss 3349  df-nul 3643  df-if 3797  df-pw 3867  df-sn 3883  df-pr 3885  df-tp 3887  df-op 3889  df-ot 3891  df-uni 4097  df-int 4134  df-iun 4178  df-br 4298  df-opab 4356  df-mpt 4357  df-tr 4391  df-eprel 4637  df-id 4641  df-po 4646  df-so 4647  df-fr 4684  df-we 4686  df-ord 4727  df-on 4728  df-lim 4729  df-suc 4730  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-rn 4856  df-res 4857  df-ima 4858  df-iota 5386  df-fun 5425  df-fn 5426  df-f 5427  df-f1 5428  df-fo 5429  df-f1o 5430  df-fv 5431  df-riota 6057  df-ov 6099  df-oprab 6100  df-mpt2 6101  df-om 6482  df-1st 6582  df-2nd 6583  df-recs 6837  df-rdg 6871  df-1o 6925  df-oadd 6929  df-er 7106  df-en 7316  df-dom 7317  df-sdom 7318  df-fin 7319  df-card 8114  df-pnf 9425  df-mnf 9426  df-xr 9427  df-ltxr 9428  df-le 9429  df-sub 9602  df-neg 9603  df-nn 10328  df-n0 10585  df-z 10652  df-uz 10867  df-fz 11443  df-fzo 11554  df-hash 12109  df-word 12234  df-concat 12236  df-substr 12238  df-splice 12239
This theorem is referenced by:  psgnunilem2  16006  efglem  16218  efgtf  16224  frgpuplem  16274
  Copyright terms: Public domain W3C validator