Theorem swrdccat3b 11534

Description: A suffix of a concatenation is either a suffix of the second concatenated word or a concatenation of a suffix of the first word with the second word. (Contributed by Alexander van der Vekens, 31-Mar-2018.) (Revised by Alexander van der Vekens, 30-May-2018.) (Proof shortened by AV, 14-Oct-2022.)

Hypothesis

Ref	Expression
swrdccatin2.l	|- L = (♯ ` A )

Assertion

Ref	Expression
swrdccat3b	|- ( ( A e. Word V /\ B e. Word V ) -> ( M e. ( 0 ... ( L + (♯ ` B ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) ) )

Proof of Theorem swrdccat3b

Step	Hyp	Ref	Expression
1		simpl 109	. . . 4 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( A e. Word V /\ B e. Word V ) )
2		simpr 110	. . . 4 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> M e. ( 0 ... ( L + (♯ ` B ) ) ) )
3		elfzubelfz 10457	. . . . 5 |- ( M e. ( 0 ... ( L + (♯ ` B ) ) ) -> ( L + (♯ ` B ) ) e. ( 0 ... ( L + (♯ ` B ) ) ) )
4	3	adantl 277	. . . 4 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( L + (♯ ` B ) ) e. ( 0 ... ( L + (♯ ` B ) ) ) )
5		swrdccatin2.l	. . . . . 6 |- L = (♯ ` A )
6	5	pfxccat3 11528	. . . . 5 |- ( ( A e. Word V /\ B e. Word V ) -> ( ( M e. ( 0 ... ( L + (♯ ` B ) ) ) /\ ( L + (♯ ` B ) ) e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( ( L + (♯ ` B ) ) <_ L , ( A substr <. M , ( L + (♯ ` B ) ) >. ) , if ( L <_ M , ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) , ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) ) ) ) )
7	6	imp 124	. . . 4 |- ( ( ( A e. Word V /\ B e. Word V ) /\ ( M e. ( 0 ... ( L + (♯ ` B ) ) ) /\ ( L + (♯ ` B ) ) e. ( 0 ... ( L + (♯ ` B ) ) ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( ( L + (♯ ` B ) ) <_ L , ( A substr <. M , ( L + (♯ ` B ) ) >. ) , if ( L <_ M , ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) , ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) ) ) )
8	1, 2, 4, 7	syl12anc 1276	. . 3 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( ( L + (♯ ` B ) ) <_ L , ( A substr <. M , ( L + (♯ ` B ) ) >. ) , if ( L <_ M , ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) , ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) ) ) )
9	5	swrdccat3blem 11533	. . . 4 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ ( L + (♯ ` B ) ) <_ L ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( A substr <. M , ( L + (♯ ` B ) ) >. ) )
10		iftrue 3645	. . . . . 6 |- ( L <_ M -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( B substr <. ( M - L ) , (♯ ` B ) >. ) )
11	10	3ad2ant3 1051	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ L <_ M ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( B substr <. ( M - L ) , (♯ ` B ) >. ) )
12		lencl 11330	. . . . . . . . . . . 12 |- ( A e. Word V -> (♯ ` A ) e. NN0 )
13	12	nn0cnd 9633	. . . . . . . . . . 11 |- ( A e. Word V -> (♯ ` A ) e. CC )
14		lencl 11330	. . . . . . . . . . . 12 |- ( B e. Word V -> (♯ ` B ) e. NN0 )
15	14	nn0cnd 9633	. . . . . . . . . . 11 |- ( B e. Word V -> (♯ ` B ) e. CC )
16	5	eqcomi 2242	. . . . . . . . . . . . 13 |- (♯ ` A ) = L
17	16	eleq1i 2304	. . . . . . . . . . . 12 |- ( (♯ ` A ) e. CC <-> L e. CC )
18		pncan2 8540	. . . . . . . . . . . 12 |- ( ( L e. CC /\ (♯ ` B ) e. CC ) -> ( ( L + (♯ ` B ) ) - L ) = (♯ ` B ) )
19	17, 18	sylanb 284	. . . . . . . . . . 11 |- ( ( (♯ ` A ) e. CC /\ (♯ ` B ) e. CC ) -> ( ( L + (♯ ` B ) ) - L ) = (♯ ` B ) )
20	13, 15, 19	syl2an 289	. . . . . . . . . 10 |- ( ( A e. Word V /\ B e. Word V ) -> ( ( L + (♯ ` B ) ) - L ) = (♯ ` B ) )
21	20	eqcomd 2244	. . . . . . . . 9 |- ( ( A e. Word V /\ B e. Word V ) -> (♯ ` B ) = ( ( L + (♯ ` B ) ) - L ) )
22	21	adantr 276	. . . . . . . 8 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> (♯ ` B ) = ( ( L + (♯ ` B ) ) - L ) )
23	22	3ad2ant1 1049	. . . . . . 7 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ L <_ M ) -> (♯ ` B ) = ( ( L + (♯ ` B ) ) - L ) )
24	23	opeq2d 3911	. . . . . 6 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ L <_ M ) -> <. ( M - L ) , (♯ ` B ) >. = <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. )
25	24	oveq2d 6104	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ L <_ M ) -> ( B substr <. ( M - L ) , (♯ ` B ) >. ) = ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) )
26	11, 25	eqtrd 2271	. . . 4 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ L <_ M ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) )
27		iffalse 3648	. . . . . 6 |- ( -. L <_ M -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( ( A substr <. M , L >. ) ++ B ) )
28	27	3ad2ant3 1051	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( ( A substr <. M , L >. ) ++ B ) )
29	20	adantr 276	. . . . . . . . 9 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( ( L + (♯ ` B ) ) - L ) = (♯ ` B ) )
30	29	3ad2ant1 1049	. . . . . . . 8 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> ( ( L + (♯ ` B ) ) - L ) = (♯ ` B ) )
31	30	oveq2d 6104	. . . . . . 7 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> ( B prefix ( ( L + (♯ ` B ) ) - L ) ) = ( B prefix (♯ ` B ) ) )
32		pfxid 11480	. . . . . . . . 9 |- ( B e. Word V -> ( B prefix (♯ ` B ) ) = B )
33	32	ad2antlr 493	. . . . . . . 8 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( B prefix (♯ ` B ) ) = B )
34	33	3ad2ant1 1049	. . . . . . 7 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> ( B prefix (♯ ` B ) ) = B )
35	31, 34	eqtr2d 2272	. . . . . 6 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> B = ( B prefix ( ( L + (♯ ` B ) ) - L ) ) )
36	35	oveq2d 6104	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> ( ( A substr <. M , L >. ) ++ B ) = ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) )
37	28, 36	eqtrd 2271	. . . 4 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L /\ -. L <_ M ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) )
38	4	elfzelzd 10446	. . . . 5 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( L + (♯ ` B ) ) e. ZZ )
39	5, 12	eqeltrid 2325	. . . . . . 7 |- ( A e. Word V -> L e. NN0 )
40	39	ad2antrr 492	. . . . . 6 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> L e. NN0 )
41	40	nn0zd 9777	. . . . 5 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> L e. ZZ )
42		zdcle 9732	. . . . 5 |- ( ( ( L + (♯ ` B ) ) e. ZZ /\ L e. ZZ ) -> DECID ( L + (♯ ` B ) ) <_ L )
43	38, 41, 42	syl2anc 415	. . . 4 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> DECID ( L + (♯ ` B ) ) <_ L )
44	41	adantr 276	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L ) -> L e. ZZ )
45		elfznn0 10538	. . . . . . 7 |- ( M e. ( 0 ... ( L + (♯ ` B ) ) ) -> M e. NN0 )
46	45	ad2antlr 493	. . . . . 6 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L ) -> M e. NN0 )
47	46	nn0zd 9777	. . . . 5 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L ) -> M e. ZZ )
48		zdcle 9732	. . . . 5 |- ( ( L e. ZZ /\ M e. ZZ ) -> DECID L <_ M )
49	44, 47, 48	syl2anc 415	. . . 4 |- ( ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) /\ -. ( L + (♯ ` B ) ) <_ L ) -> DECID L <_ M )
50	9, 26, 37, 43, 49	2if2dc 3680	. . 3 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) = if ( ( L + (♯ ` B ) ) <_ L , ( A substr <. M , ( L + (♯ ` B ) ) >. ) , if ( L <_ M , ( B substr <. ( M - L ) , ( ( L + (♯ ` B ) ) - L ) >. ) , ( ( A substr <. M , L >. ) ++ ( B prefix ( ( L + (♯ ` B ) ) - L ) ) ) ) ) )
51	8, 50	eqtr4d 2274	. 2 |- ( ( ( A e. Word V /\ B e. Word V ) /\ M e. ( 0 ... ( L + (♯ ` B ) ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) )
52	51	ex 115	1 |- ( ( A e. Word V /\ B e. Word V ) -> ( M e. ( 0 ... ( L + (♯ ` B ) ) ) -> ( ( A ++ B ) substr <. M , ( L + (♯ ` B ) ) >. ) = if ( L <_ M , ( B substr <. ( M - L ) , (♯ ` B ) >. ) , ( ( A substr <. M , L >. ) ++ B ) ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104  DECID wdc 846   /\ w3a 1009   = wceq 1402   e. wcel 2209   ifcif 3638   <.cop 3712   class class class wbr 4131   ` cfv 5380  (class class class)co 6088   CCcc 8183   0cc0 8185   + caddc 8188   <_ cle 8367   - cmin 8504   NN0cn0 9574   ZZcz 9655   ...cfz 10428  ♯chash 11236  Word cword 11326   ++ cconcat 11380   substr csubstr 11439   prefix cpfx 11466

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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301

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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-er 6811  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-fzo 10567  df-ihash 11237  df-word 11327  df-concat 11381  df-substr 11440  df-pfx 11467

This theorem is used by: (None)