Theorem pfxeq 11468

Description: The prefixes of two words are equal iff they have the same length and the same symbols at each position. (Contributed by Alexander van der Vekens, 7-Aug-2018.) (Revised by AV, 4-May-2020.)

Assertion

Ref	Expression
pfxeq	|- ( ( ( W e. Word V /\ U e. Word V ) /\ ( M e. NN0 /\ N e. NN0 ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( W prefix M ) = ( U prefix N ) <-> ( M = N /\ A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) ) )

Distinct variable groups:   i, M   i, N   U, i   i, V   i, W

Proof of Theorem pfxeq

Step	Hyp	Ref	Expression
1		simp2l 1054	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> W e. Word V )
2		simp1l 1052	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> M e. NN0 )
3		pfxclg 11450	. . . . 5 |- ( ( W e. Word V /\ M e. NN0 ) -> ( W prefix M ) e. Word V )
4	1, 2, 3	syl2anc 415	. . . 4 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( W prefix M ) e. Word V )
5		simp2r 1055	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> U e. Word V )
6		simp1r 1053	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> N e. NN0 )
7		pfxclg 11450	. . . . 5 |- ( ( U e. Word V /\ N e. NN0 ) -> ( U prefix N ) e. Word V )
8	5, 6, 7	syl2anc 415	. . . 4 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( U prefix N ) e. Word V )
9		eqwrd 11345	. . . 4 |- ( ( ( W prefix M ) e. Word V /\ ( U prefix N ) e. Word V ) -> ( ( W prefix M ) = ( U prefix N ) <-> ( (♯ ` ( W prefix M ) ) = (♯ ` ( U prefix N ) ) /\ A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) ) )
10	4, 8, 9	syl2anc 415	. . 3 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( W prefix M ) = ( U prefix N ) <-> ( (♯ ` ( W prefix M ) ) = (♯ ` ( U prefix N ) ) /\ A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) ) )
11		simpl 109	. . . . . . . 8 |- ( ( M e. NN0 /\ N e. NN0 ) -> M e. NN0 )
12		lencl 11308	. . . . . . . . 9 |- ( W e. Word V -> (♯ ` W ) e. NN0 )
13	12	adantr 276	. . . . . . . 8 |- ( ( W e. Word V /\ U e. Word V ) -> (♯ ` W ) e. NN0 )
14		simpl 109	. . . . . . . 8 |- ( ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) -> M <_ (♯ ` W ) )
15	11, 13, 14	3anim123i 1215	. . . . . . 7 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( M e. NN0 /\ (♯ ` W ) e. NN0 /\ M <_ (♯ ` W ) ) )
16		elfz2nn0 10519	. . . . . . 7 |- ( M e. ( 0 ... (♯ ` W ) ) <-> ( M e. NN0 /\ (♯ ` W ) e. NN0 /\ M <_ (♯ ` W ) ) )
17	15, 16	sylibr 134	. . . . . 6 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> M e. ( 0 ... (♯ ` W ) ) )
18		pfxlen 11457	. . . . . 6 |- ( ( W e. Word V /\ M e. ( 0 ... (♯ ` W ) ) ) -> (♯ ` ( W prefix M ) ) = M )
19	1, 17, 18	syl2anc 415	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> (♯ ` ( W prefix M ) ) = M )
20		simpr 110	. . . . . . . 8 |- ( ( M e. NN0 /\ N e. NN0 ) -> N e. NN0 )
21		lencl 11308	. . . . . . . . 9 |- ( U e. Word V -> (♯ ` U ) e. NN0 )
22	21	adantl 277	. . . . . . . 8 |- ( ( W e. Word V /\ U e. Word V ) -> (♯ ` U ) e. NN0 )
23		simpr 110	. . . . . . . 8 |- ( ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) -> N <_ (♯ ` U ) )
24	20, 22, 23	3anim123i 1215	. . . . . . 7 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( N e. NN0 /\ (♯ ` U ) e. NN0 /\ N <_ (♯ ` U ) ) )
25		elfz2nn0 10519	. . . . . . 7 |- ( N e. ( 0 ... (♯ ` U ) ) <-> ( N e. NN0 /\ (♯ ` U ) e. NN0 /\ N <_ (♯ ` U ) ) )
26	24, 25	sylibr 134	. . . . . 6 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> N e. ( 0 ... (♯ ` U ) ) )
27		pfxlen 11457	. . . . . 6 |- ( ( U e. Word V /\ N e. ( 0 ... (♯ ` U ) ) ) -> (♯ ` ( U prefix N ) ) = N )
28	5, 26, 27	syl2anc 415	. . . . 5 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> (♯ ` ( U prefix N ) ) = N )
29	19, 28	eqeq12d 2253	. . . 4 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( (♯ ` ( W prefix M ) ) = (♯ ` ( U prefix N ) ) <-> M = N ) )
30	29	anbi1d 469	. . 3 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( (♯ ` ( W prefix M ) ) = (♯ ` ( U prefix N ) ) /\ A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) <-> ( M = N /\ A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) ) )
31	19	adantr 276	. . . . . . 7 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> (♯ ` ( W prefix M ) ) = M )
32	31	oveq2d 6101	. . . . . 6 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> ( 0..^ (♯ ` ( W prefix M ) ) ) = ( 0..^ M ) )
33	32	raleqdv 2755	. . . . 5 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> ( A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) <-> A. i e. ( 0..^ M ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) )
34	1	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> W e. Word V )
35	17	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> M e. ( 0 ... (♯ ` W ) ) )
36		simpr 110	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> i e. ( 0..^ M ) )
37		pfxfv 11456	. . . . . . . 8 |- ( ( W e. Word V /\ M e. ( 0 ... (♯ ` W ) ) /\ i e. ( 0..^ M ) ) -> ( ( W prefix M ) ` i ) = ( W ` i ) )
38	34, 35, 36, 37	syl3anc 1278	. . . . . . 7 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> ( ( W prefix M ) ` i ) = ( W ` i ) )
39	5	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> U e. Word V )
40	26	ad2antrr 492	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> N e. ( 0 ... (♯ ` U ) ) )
41		oveq2 6093	. . . . . . . . . . 11 |- ( M = N -> ( 0..^ M ) = ( 0..^ N ) )
42	41	eleq2d 2308	. . . . . . . . . 10 |- ( M = N -> ( i e. ( 0..^ M ) <-> i e. ( 0..^ N ) ) )
43	42	adantl 277	. . . . . . . . 9 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> ( i e. ( 0..^ M ) <-> i e. ( 0..^ N ) ) )
44	43	biimpa 296	. . . . . . . 8 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> i e. ( 0..^ N ) )
45		pfxfv 11456	. . . . . . . 8 |- ( ( U e. Word V /\ N e. ( 0 ... (♯ ` U ) ) /\ i e. ( 0..^ N ) ) -> ( ( U prefix N ) ` i ) = ( U ` i ) )
46	39, 40, 44, 45	syl3anc 1278	. . . . . . 7 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> ( ( U prefix N ) ` i ) = ( U ` i ) )
47	38, 46	eqeq12d 2253	. . . . . 6 |- ( ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) /\ i e. ( 0..^ M ) ) -> ( ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) <-> ( W ` i ) = ( U ` i ) ) )
48	47	ralbidva 2546	. . . . 5 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> ( A. i e. ( 0..^ M ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) <-> A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) )
49	33, 48	bitrd 188	. . . 4 |- ( ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) /\ M = N ) -> ( A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) <-> A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) )
50	49	pm5.32da 456	. . 3 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( M = N /\ A. i e. ( 0..^ (♯ ` ( W prefix M ) ) ) ( ( W prefix M ) ` i ) = ( ( U prefix N ) ` i ) ) <-> ( M = N /\ A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) ) )
51	10, 30, 50	3bitrd 214	. 2 |- ( ( ( M e. NN0 /\ N e. NN0 ) /\ ( W e. Word V /\ U e. Word V ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( W prefix M ) = ( U prefix N ) <-> ( M = N /\ A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) ) )
52	51	3com12 1238	1 |- ( ( ( W e. Word V /\ U e. Word V ) /\ ( M e. NN0 /\ N e. NN0 ) /\ ( M <_ (♯ ` W ) /\ N <_ (♯ ` U ) ) ) -> ( ( W prefix M ) = ( U prefix N ) <-> ( M = N /\ A. i e. ( 0..^ M ) ( W ` i ) = ( U ` i ) ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   A.wral 2528   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   0cc0 8179   <_ cle 8361   NN0cn0 9563   ...cfz 10411  ..^cfzo 10549  ♯chash 11214  Word cword 11304   prefix cpfx 11444

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-dom 7024  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  df-fzo 10550  df-ihash 11215  df-word 11305  df-substr 11418  df-pfx 11445

This theorem is used by:  pfxsuffeqwrdeq  11470