Theorem splfv1 13506

Description: Symbols to the left of a splice are unaffected. (Contributed by Stefan O'Rear, 23-Aug-2015.)

Hypotheses

Ref	Expression
spllen.s	|- ( ph -> S e. Word A )
spllen.f	|- ( ph -> F e. ( 0 ... T ) )
spllen.t	|- ( ph -> T e. ( 0 ... ( # ` S ) ) )
spllen.r	|- ( ph -> R e. Word A )
splfv1.x	|- ( ph -> X e. ( 0..^ F ) )

Assertion

Ref	Expression
splfv1	|- ( ph -> ( ( S splice <. F , T , R >. ) ` X ) = ( S ` X ) )

Proof of Theorem splfv1

Step	Hyp	Ref	Expression
1		spllen.s	. . . 4 |- ( ph -> S e. Word A )
2		spllen.f	. . . 4 |- ( ph -> F e. ( 0 ... T ) )
3		spllen.t	. . . 4 |- ( ph -> T e. ( 0 ... ( # ` S ) ) )
4		spllen.r	. . . 4 |- ( ph -> R e. Word A )
5		splval 13502	. . . 4 |- ( ( S e. Word A /\ ( F e. ( 0 ... T ) /\ T e. ( 0 ... ( # ` S ) ) /\ R e. Word A ) ) -> ( S splice <. F , T , R >. ) = ( ( ( S substr <. 0 , F >. ) ++ R ) ++ ( S substr <. T , ( # ` S ) >. ) ) )
6	1, 2, 3, 4, 5	syl13anc 1328	. . 3 |- ( ph -> ( S splice <. F , T , R >. ) = ( ( ( S substr <. 0 , F >. ) ++ R ) ++ ( S substr <. T , ( # ` S ) >. ) ) )
7	6	fveq1d 6193	. 2 |- ( ph -> ( ( S splice <. F , T , R >. ) ` X ) = ( ( ( ( S substr <. 0 , F >. ) ++ R ) ++ ( S substr <. T , ( # ` S ) >. ) ) ` X ) )
8		swrdcl 13419	. . . . 5 |- ( S e. Word A -> ( S substr <. 0 , F >. ) e. Word A )
9	1, 8	syl 17	. . . 4 |- ( ph -> ( S substr <. 0 , F >. ) e. Word A )
10		ccatcl 13359	. . . 4 |- ( ( ( S substr <. 0 , F >. ) e. Word A /\ R e. Word A ) -> ( ( S substr <. 0 , F >. ) ++ R ) e. Word A )
11	9, 4, 10	syl2anc 693	. . 3 |- ( ph -> ( ( S substr <. 0 , F >. ) ++ R ) e. Word A )
12		swrdcl 13419	. . . 4 |- ( S e. Word A -> ( S substr <. T , ( # ` S ) >. ) e. Word A )
13	1, 12	syl 17	. . 3 |- ( ph -> ( S substr <. T , ( # ` S ) >. ) e. Word A )
14		elfzelz 12342	. . . . . . . 8 |- ( F e. ( 0 ... T ) -> F e. ZZ )
15		uzid 11702	. . . . . . . 8 |- ( F e. ZZ -> F e. ( ZZ>= ` F ) )
16	2, 14, 15	3syl 18	. . . . . . 7 |- ( ph -> F e. ( ZZ>= ` F ) )
17		wrdfin 13323	. . . . . . . 8 |- ( R e. Word A -> R e. Fin )
18		hashcl 13147	. . . . . . . 8 |- ( R e. Fin -> ( # ` R ) e. NN0 )
19	4, 17, 18	3syl 18	. . . . . . 7 |- ( ph -> ( # ` R ) e. NN0 )
20		uzaddcl 11744	. . . . . . 7 |- ( ( F e. ( ZZ>= ` F ) /\ ( # ` R ) e. NN0 ) -> ( F + ( # ` R ) ) e. ( ZZ>= ` F ) )
21	16, 19, 20	syl2anc 693	. . . . . 6 |- ( ph -> ( F + ( # ` R ) ) e. ( ZZ>= ` F ) )
22		fzoss2 12496	. . . . . 6 |- ( ( F + ( # ` R ) ) e. ( ZZ>= ` F ) -> ( 0..^ F ) C_ ( 0..^ ( F + ( # ` R ) ) ) )
23	21, 22	syl 17	. . . . 5 |- ( ph -> ( 0..^ F ) C_ ( 0..^ ( F + ( # ` R ) ) ) )
24		splfv1.x	. . . . 5 |- ( ph -> X e. ( 0..^ F ) )
25	23, 24	sseldd 3604	. . . 4 |- ( ph -> X e. ( 0..^ ( F + ( # ` R ) ) ) )
26		ccatlen 13360	. . . . . . 7 |- ( ( ( S substr <. 0 , F >. ) e. Word A /\ R e. Word A ) -> ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) = ( ( # ` ( S substr <. 0 , F >. ) ) + ( # ` R ) ) )
27	9, 4, 26	syl2anc 693	. . . . . 6 |- ( ph -> ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) = ( ( # ` ( S substr <. 0 , F >. ) ) + ( # ` R ) ) )
28		elfzuz 12338	. . . . . . . . . 10 |- ( F e. ( 0 ... T ) -> F e. ( ZZ>= ` 0 ) )
29		eluzfz1 12348	. . . . . . . . . 10 |- ( F e. ( ZZ>= ` 0 ) -> 0 e. ( 0 ... F ) )
30	2, 28, 29	3syl 18	. . . . . . . . 9 |- ( ph -> 0 e. ( 0 ... F ) )
31		fzass4 12379	. . . . . . . . . . . 12 |- ( ( F e. ( 0 ... ( # ` S ) ) /\ T e. ( F ... ( # ` S ) ) ) <-> ( F e. ( 0 ... T ) /\ T e. ( 0 ... ( # ` S ) ) ) )
32	31	bicomi 214	. . . . . . . . . . 11 |- ( ( F e. ( 0 ... T ) /\ T e. ( 0 ... ( # ` S ) ) ) <-> ( F e. ( 0 ... ( # ` S ) ) /\ T e. ( F ... ( # ` S ) ) ) )
33	32	simplbi 476	. . . . . . . . . 10 |- ( ( F e. ( 0 ... T ) /\ T e. ( 0 ... ( # ` S ) ) ) -> F e. ( 0 ... ( # ` S ) ) )
34	2, 3, 33	syl2anc 693	. . . . . . . . 9 |- ( ph -> F e. ( 0 ... ( # ` S ) ) )
35		swrdlen 13423	. . . . . . . . 9 |- ( ( S e. Word A /\ 0 e. ( 0 ... F ) /\ F e. ( 0 ... ( # ` S ) ) ) -> ( # ` ( S substr <. 0 , F >. ) ) = ( F - 0 ) )
36	1, 30, 34, 35	syl3anc 1326	. . . . . . . 8 |- ( ph -> ( # ` ( S substr <. 0 , F >. ) ) = ( F - 0 ) )
37	2, 14	syl 17	. . . . . . . . . 10 |- ( ph -> F e. ZZ )
38	37	zcnd 11483	. . . . . . . . 9 |- ( ph -> F e. CC )
39	38	subid1d 10381	. . . . . . . 8 |- ( ph -> ( F - 0 ) = F )
40	36, 39	eqtrd 2656	. . . . . . 7 |- ( ph -> ( # ` ( S substr <. 0 , F >. ) ) = F )
41	40	oveq1d 6665	. . . . . 6 |- ( ph -> ( ( # ` ( S substr <. 0 , F >. ) ) + ( # ` R ) ) = ( F + ( # ` R ) ) )
42	27, 41	eqtrd 2656	. . . . 5 |- ( ph -> ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) = ( F + ( # ` R ) ) )
43	42	oveq2d 6666	. . . 4 |- ( ph -> ( 0..^ ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) ) = ( 0..^ ( F + ( # ` R ) ) ) )
44	25, 43	eleqtrrd 2704	. . 3 |- ( ph -> X e. ( 0..^ ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) ) )
45		ccatval1 13361	. . 3 |- ( ( ( ( S substr <. 0 , F >. ) ++ R ) e. Word A /\ ( S substr <. T , ( # ` S ) >. ) e. Word A /\ X e. ( 0..^ ( # ` ( ( S substr <. 0 , F >. ) ++ R ) ) ) ) -> ( ( ( ( S substr <. 0 , F >. ) ++ R ) ++ ( S substr <. T , ( # ` S ) >. ) ) ` X ) = ( ( ( S substr <. 0 , F >. ) ++ R ) ` X ) )
46	11, 13, 44, 45	syl3anc 1326	. 2 |- ( ph -> ( ( ( ( S substr <. 0 , F >. ) ++ R ) ++ ( S substr <. T , ( # ` S ) >. ) ) ` X ) = ( ( ( S substr <. 0 , F >. ) ++ R ) ` X ) )
47	40	oveq2d 6666	. . . . 5 |- ( ph -> ( 0..^ ( # ` ( S substr <. 0 , F >. ) ) ) = ( 0..^ F ) )
48	24, 47	eleqtrrd 2704	. . . 4 |- ( ph -> X e. ( 0..^ ( # ` ( S substr <. 0 , F >. ) ) ) )
49		ccatval1 13361	. . . 4 |- ( ( ( S substr <. 0 , F >. ) e. Word A /\ R e. Word A /\ X e. ( 0..^ ( # ` ( S substr <. 0 , F >. ) ) ) ) -> ( ( ( S substr <. 0 , F >. ) ++ R ) ` X ) = ( ( S substr <. 0 , F >. ) ` X ) )
50	9, 4, 48, 49	syl3anc 1326	. . 3 |- ( ph -> ( ( ( S substr <. 0 , F >. ) ++ R ) ` X ) = ( ( S substr <. 0 , F >. ) ` X ) )
51	39	oveq2d 6666	. . . . 5 |- ( ph -> ( 0..^ ( F - 0 ) ) = ( 0..^ F ) )
52	24, 51	eleqtrrd 2704	. . . 4 |- ( ph -> X e. ( 0..^ ( F - 0 ) ) )
53		swrdfv 13424	. . . 4 |- ( ( ( S e. Word A /\ 0 e. ( 0 ... F ) /\ F e. ( 0 ... ( # ` S ) ) ) /\ X e. ( 0..^ ( F - 0 ) ) ) -> ( ( S substr <. 0 , F >. ) ` X ) = ( S ` ( X + 0 ) ) )
54	1, 30, 34, 52, 53	syl31anc 1329	. . 3 |- ( ph -> ( ( S substr <. 0 , F >. ) ` X ) = ( S ` ( X + 0 ) ) )
55		elfzoelz 12470	. . . . . . 7 |- ( X e. ( 0..^ F ) -> X e. ZZ )
56	55	zcnd 11483	. . . . . 6 |- ( X e. ( 0..^ F ) -> X e. CC )
57	24, 56	syl 17	. . . . 5 |- ( ph -> X e. CC )
58	57	addid1d 10236	. . . 4 |- ( ph -> ( X + 0 ) = X )
59	58	fveq2d 6195	. . 3 |- ( ph -> ( S ` ( X + 0 ) ) = ( S ` X ) )
60	50, 54, 59	3eqtrd 2660	. 2 |- ( ph -> ( ( ( S substr <. 0 , F >. ) ++ R ) ` X ) = ( S ` X ) )
61	7, 46, 60	3eqtrd 2660	1 |- ( ph -> ( ( S splice <. F , T , R >. ) ` X ) = ( S ` X ) )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   C_ wss 3574   <.cop 4183   <.cotp 4185   ` cfv 5888  (class class class)co 6650   Fincfn 7955   CCcc 9934   0cc0 9936   + caddc 9939   - cmin 10266   NN0cn0 11292   ZZcz 11377   ZZ>=cuz 11687   ...cfz 12326  ..^cfzo 12465   #chash 13117  Word cword 13291   ++ cconcat 13293   substr csubstr 13295   splice csplice 13296

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-ot 4186  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-n0 11293  df-z 11378  df-uz 11688  df-fz 12327  df-fzo 12466  df-hash 13118  df-word 13299  df-concat 13301  df-substr 13303  df-splice 13304

This theorem is referenced by:  psgnunilem2  17915