Theorem swrdco 13583

Description: Mapping of words commutes with the substring operation. (Contributed by AV, 11-Nov-2018.)

Assertion

Ref	Expression
swrdco	|- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( F o. ( W substr <. M , N >. ) ) = ( ( F o. W ) substr <. M , N >. ) )

Proof of Theorem swrdco

Dummy variable i is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 6045	. . . 4 |- ( F : A --> B -> F Fn A )
2	1	3ad2ant3 1084	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> F Fn A )
3		swrdvalfn 13426	. . . . 5 |- ( ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( W substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) )
4	3	3expb 1266	. . . 4 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) ) -> ( W substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) )
5	4	3adant3 1081	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( W substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) )
6		swrdrn 13429	. . . . 5 |- ( ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ran ( W substr <. M , N >. ) C_ A )
7	6	3expb 1266	. . . 4 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) ) -> ran ( W substr <. M , N >. ) C_ A )
8	7	3adant3 1081	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ran ( W substr <. M , N >. ) C_ A )
9		fnco 5999	. . 3 |- ( ( F Fn A /\ ( W substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) /\ ran ( W substr <. M , N >. ) C_ A ) -> ( F o. ( W substr <. M , N >. ) ) Fn ( 0..^ ( N - M ) ) )
10	2, 5, 8, 9	syl3anc 1326	. 2 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( F o. ( W substr <. M , N >. ) ) Fn ( 0..^ ( N - M ) ) )
11		wrdco 13577	. . . 4 |- ( ( W e. Word A /\ F : A --> B ) -> ( F o. W ) e. Word B )
12	11	3adant2 1080	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( F o. W ) e. Word B )
13		simp2l 1087	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> M e. ( 0 ... N ) )
14		lenco 13578	. . . . . . . . . . . 12 |- ( ( W e. Word A /\ F : A --> B ) -> ( # ` ( F o. W ) ) = ( # ` W ) )
15	14	eqcomd 2628	. . . . . . . . . . 11 |- ( ( W e. Word A /\ F : A --> B ) -> ( # ` W ) = ( # ` ( F o. W ) ) )
16	15	oveq2d 6666	. . . . . . . . . 10 |- ( ( W e. Word A /\ F : A --> B ) -> ( 0 ... ( # ` W ) ) = ( 0 ... ( # ` ( F o. W ) ) ) )
17	16	eleq2d 2687	. . . . . . . . 9 |- ( ( W e. Word A /\ F : A --> B ) -> ( N e. ( 0 ... ( # ` W ) ) <-> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) )
18	17	biimpd 219	. . . . . . . 8 |- ( ( W e. Word A /\ F : A --> B ) -> ( N e. ( 0 ... ( # ` W ) ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) )
19	18	expcom 451	. . . . . . 7 |- ( F : A --> B -> ( W e. Word A -> ( N e. ( 0 ... ( # ` W ) ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
20	19	com13 88	. . . . . 6 |- ( N e. ( 0 ... ( # ` W ) ) -> ( W e. Word A -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
21	20	adantl 482	. . . . 5 |- ( ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( W e. Word A -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
22	21	com12 32	. . . 4 |- ( W e. Word A -> ( ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
23	22	3imp 1256	. . 3 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) )
24		swrdvalfn 13426	. . 3 |- ( ( ( F o. W ) e. Word B /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` ( F o. W ) ) ) ) -> ( ( F o. W ) substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) )
25	12, 13, 23, 24	syl3anc 1326	. 2 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( ( F o. W ) substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) )
26		3anass 1042	. . . . . . 7 |- ( ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) <-> ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) ) )
27	26	biimpri 218	. . . . . 6 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) ) -> ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) )
28	27	3adant3 1081	. . . . 5 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) )
29		swrdfv 13424	. . . . . 6 |- ( ( ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( W substr <. M , N >. ) ` i ) = ( W ` ( i + M ) ) )
30	29	fveq2d 6195	. . . . 5 |- ( ( ( W e. Word A /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( F ` ( ( W substr <. M , N >. ) ` i ) ) = ( F ` ( W ` ( i + M ) ) ) )
31	28, 30	sylan 488	. . . 4 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( F ` ( ( W substr <. M , N >. ) ` i ) ) = ( F ` ( W ` ( i + M ) ) ) )
32		wrdfn 13319	. . . . . . 7 |- ( W e. Word A -> W Fn ( 0..^ ( # ` W ) ) )
33	32	3ad2ant1 1082	. . . . . 6 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> W Fn ( 0..^ ( # ` W ) ) )
34	33	adantr 481	. . . . 5 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> W Fn ( 0..^ ( # ` W ) ) )
35		elfzodifsumelfzo 12533	. . . . . . 7 |- ( ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( i e. ( 0..^ ( N - M ) ) -> ( i + M ) e. ( 0..^ ( # ` W ) ) ) )
36	35	3ad2ant2 1083	. . . . . 6 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( i e. ( 0..^ ( N - M ) ) -> ( i + M ) e. ( 0..^ ( # ` W ) ) ) )
37	36	imp 445	. . . . 5 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( i + M ) e. ( 0..^ ( # ` W ) ) )
38		fvco2 6273	. . . . 5 |- ( ( W Fn ( 0..^ ( # ` W ) ) /\ ( i + M ) e. ( 0..^ ( # ` W ) ) ) -> ( ( F o. W ) ` ( i + M ) ) = ( F ` ( W ` ( i + M ) ) ) )
39	34, 37, 38	syl2anc 693	. . . 4 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( F o. W ) ` ( i + M ) ) = ( F ` ( W ` ( i + M ) ) ) )
40	31, 39	eqtr4d 2659	. . 3 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( F ` ( ( W substr <. M , N >. ) ` i ) ) = ( ( F o. W ) ` ( i + M ) ) )
41		fvco2 6273	. . . 4 |- ( ( ( W substr <. M , N >. ) Fn ( 0..^ ( N - M ) ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( F o. ( W substr <. M , N >. ) ) ` i ) = ( F ` ( ( W substr <. M , N >. ) ` i ) ) )
42	5, 41	sylan 488	. . 3 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( F o. ( W substr <. M , N >. ) ) ` i ) = ( F ` ( ( W substr <. M , N >. ) ` i ) ) )
43	14	ancoms 469	. . . . . . . . . . . . . 14 |- ( ( F : A --> B /\ W e. Word A ) -> ( # ` ( F o. W ) ) = ( # ` W ) )
44	43	eqcomd 2628	. . . . . . . . . . . . 13 |- ( ( F : A --> B /\ W e. Word A ) -> ( # ` W ) = ( # ` ( F o. W ) ) )
45	44	oveq2d 6666	. . . . . . . . . . . 12 |- ( ( F : A --> B /\ W e. Word A ) -> ( 0 ... ( # ` W ) ) = ( 0 ... ( # ` ( F o. W ) ) ) )
46	45	eleq2d 2687	. . . . . . . . . . 11 |- ( ( F : A --> B /\ W e. Word A ) -> ( N e. ( 0 ... ( # ` W ) ) <-> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) )
47	46	biimpd 219	. . . . . . . . . 10 |- ( ( F : A --> B /\ W e. Word A ) -> ( N e. ( 0 ... ( # ` W ) ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) )
48	47	ex 450	. . . . . . . . 9 |- ( F : A --> B -> ( W e. Word A -> ( N e. ( 0 ... ( # ` W ) ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
49	48	com13 88	. . . . . . . 8 |- ( N e. ( 0 ... ( # ` W ) ) -> ( W e. Word A -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
50	49	adantl 482	. . . . . . 7 |- ( ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( W e. Word A -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
51	50	com12 32	. . . . . 6 |- ( W e. Word A -> ( ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) -> ( F : A --> B -> N e. ( 0 ... ( # ` ( F o. W ) ) ) ) ) )
52	51	3imp 1256	. . . . 5 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> N e. ( 0 ... ( # ` ( F o. W ) ) ) )
53	12, 13, 52	3jca 1242	. . . 4 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( ( F o. W ) e. Word B /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` ( F o. W ) ) ) ) )
54		swrdfv 13424	. . . 4 |- ( ( ( ( F o. W ) e. Word B /\ M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` ( F o. W ) ) ) ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( ( F o. W ) substr <. M , N >. ) ` i ) = ( ( F o. W ) ` ( i + M ) ) )
55	53, 54	sylan 488	. . 3 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( ( F o. W ) substr <. M , N >. ) ` i ) = ( ( F o. W ) ` ( i + M ) ) )
56	40, 42, 55	3eqtr4d 2666	. 2 |- ( ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) /\ i e. ( 0..^ ( N - M ) ) ) -> ( ( F o. ( W substr <. M , N >. ) ) ` i ) = ( ( ( F o. W ) substr <. M , N >. ) ` i ) )
57	10, 25, 56	eqfnfvd 6314	1 |- ( ( W e. Word A /\ ( M e. ( 0 ... N ) /\ N e. ( 0 ... ( # ` W ) ) ) /\ F : A --> B ) -> ( F o. ( W substr <. M , N >. ) ) = ( ( F o. W ) substr <. M , N >. ) )

Syntax hints:   -> wi 4   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   C_ wss 3574   <.cop 4183   ran crn 5115   o. ccom 5118   Fn wfn 5883   -->wf 5884   ` cfv 5888  (class class class)co 6650   0cc0 9936   + caddc 9939   - cmin 10266   ...cfz 12326  ..^cfzo 12465   #chash 13117  Word cword 13291   substr csubstr 13295

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-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-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-substr 13303

This theorem is referenced by:  pfxco  41438