Theorem reuccatpfxs1lem 11331

Description: Lemma for reuccatpfxs1 11332. (Contributed by Alexander van der Vekens, 5-Oct-2018.) (Revised by AV, 9-May-2020.)

Assertion

Ref	Expression
reuccatpfxs1lem	|- ( ( ( W e. Word V /\ U e. X ) /\ A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) /\ A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) )

Distinct variable groups:   S, s   x, U   V, s, x   W, s, x   X, s, x

Allowed substitution hints:   S( x)   U( s)

Proof of Theorem reuccatpfxs1lem

Dummy variable u is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2294	. . . . . . 7 |- ( x = U -> ( x e. Word V <-> U e. Word V ) )
2		fveqeq2 5648	. . . . . . 7 |- ( x = U -> ( (♯ ` x ) = ( (♯ ` W ) + 1 ) <-> (♯ ` U ) = ( (♯ ` W ) + 1 ) ) )
3	1, 2	anbi12d 473	. . . . . 6 |- ( x = U -> ( ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) <-> ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) )
4	3	rspcv 2906	. . . . 5 |- ( U e. X -> ( A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) -> ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) )
5	4	adantl 277	. . . 4 |- ( ( W e. Word V /\ U e. X ) -> ( A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) -> ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) )
6		simpl 109	. . . . . . . . 9 |- ( ( W e. Word V /\ U e. X ) -> W e. Word V )
7	6	adantr 276	. . . . . . . 8 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> W e. Word V )
8		simpl 109	. . . . . . . . 9 |- ( ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) -> U e. Word V )
9	8	adantl 277	. . . . . . . 8 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> U e. Word V )
10		simprr 533	. . . . . . . 8 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> (♯ ` U ) = ( (♯ ` W ) + 1 ) )
11		ccats1pfxeqrex 11300	. . . . . . . 8 |- ( ( W e. Word V /\ U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) -> ( W = ( U prefix (♯ ` W ) ) -> E. u e. V U = ( W ++ <" u "> ) ) )
12	7, 9, 10, 11	syl3anc 1273	. . . . . . 7 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> ( W = ( U prefix (♯ ` W ) ) -> E. u e. V U = ( W ++ <" u "> ) ) )
13		s1eq 11200	. . . . . . . . . . . . . . . 16 |- ( s = u -> <" s "> = <" u "> )
14	13	oveq2d 6034	. . . . . . . . . . . . . . 15 |- ( s = u -> ( W ++ <" s "> ) = ( W ++ <" u "> ) )
15	14	eleq1d 2300	. . . . . . . . . . . . . 14 |- ( s = u -> ( ( W ++ <" s "> ) e. X <-> ( W ++ <" u "> ) e. X ) )
16		eqeq2 2241	. . . . . . . . . . . . . 14 |- ( s = u -> ( S = s <-> S = u ) )
17	15, 16	imbi12d 234	. . . . . . . . . . . . 13 |- ( s = u -> ( ( ( W ++ <" s "> ) e. X -> S = s ) <-> ( ( W ++ <" u "> ) e. X -> S = u ) ) )
18	17	rspcv 2906	. . . . . . . . . . . 12 |- ( u e. V -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( ( W ++ <" u "> ) e. X -> S = u ) ) )
19		eleq1 2294	. . . . . . . . . . . . . 14 |- ( U = ( W ++ <" u "> ) -> ( U e. X <-> ( W ++ <" u "> ) e. X ) )
20		id 19	. . . . . . . . . . . . . . . . . . . . . 22 |- ( ( ( W ++ <" u "> ) e. X -> S = u ) -> ( ( W ++ <" u "> ) e. X -> S = u ) )
21	20	imp 124	. . . . . . . . . . . . . . . . . . . . 21 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> S = u )
22	21	eqcomd 2237	. . . . . . . . . . . . . . . . . . . 20 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> u = S )
23	22	s1eqd 11201	. . . . . . . . . . . . . . . . . . 19 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> <" u "> = <" S "> )
24	23	oveq2d 6034	. . . . . . . . . . . . . . . . . 18 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> ( W ++ <" u "> ) = ( W ++ <" S "> ) )
25	24	eqeq2d 2243	. . . . . . . . . . . . . . . . 17 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> ( U = ( W ++ <" u "> ) <-> U = ( W ++ <" S "> ) ) )
26	25	biimpd 144	. . . . . . . . . . . . . . . 16 |- ( ( ( ( W ++ <" u "> ) e. X -> S = u ) /\ ( W ++ <" u "> ) e. X ) -> ( U = ( W ++ <" u "> ) -> U = ( W ++ <" S "> ) ) )
27	26	ex 115	. . . . . . . . . . . . . . 15 |- ( ( ( W ++ <" u "> ) e. X -> S = u ) -> ( ( W ++ <" u "> ) e. X -> ( U = ( W ++ <" u "> ) -> U = ( W ++ <" S "> ) ) ) )
28	27	com13 80	. . . . . . . . . . . . . 14 |- ( U = ( W ++ <" u "> ) -> ( ( W ++ <" u "> ) e. X -> ( ( ( W ++ <" u "> ) e. X -> S = u ) -> U = ( W ++ <" S "> ) ) ) )
29	19, 28	sylbid 150	. . . . . . . . . . . . 13 |- ( U = ( W ++ <" u "> ) -> ( U e. X -> ( ( ( W ++ <" u "> ) e. X -> S = u ) -> U = ( W ++ <" S "> ) ) ) )
30	29	com3l 81	. . . . . . . . . . . 12 |- ( U e. X -> ( ( ( W ++ <" u "> ) e. X -> S = u ) -> ( U = ( W ++ <" u "> ) -> U = ( W ++ <" S "> ) ) ) )
31	18, 30	sylan9r 410	. . . . . . . . . . 11 |- ( ( U e. X /\ u e. V ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( U = ( W ++ <" u "> ) -> U = ( W ++ <" S "> ) ) ) )
32	31	com23 78	. . . . . . . . . 10 |- ( ( U e. X /\ u e. V ) -> ( U = ( W ++ <" u "> ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> U = ( W ++ <" S "> ) ) ) )
33	32	rexlimdva 2650	. . . . . . . . 9 |- ( U e. X -> ( E. u e. V U = ( W ++ <" u "> ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> U = ( W ++ <" S "> ) ) ) )
34	33	adantl 277	. . . . . . . 8 |- ( ( W e. Word V /\ U e. X ) -> ( E. u e. V U = ( W ++ <" u "> ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> U = ( W ++ <" S "> ) ) ) )
35	34	adantr 276	. . . . . . 7 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> ( E. u e. V U = ( W ++ <" u "> ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> U = ( W ++ <" S "> ) ) ) )
36	12, 35	syld 45	. . . . . 6 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> ( W = ( U prefix (♯ ` W ) ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> U = ( W ++ <" S "> ) ) ) )
37	36	com23 78	. . . . 5 |- ( ( ( W e. Word V /\ U e. X ) /\ ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) ) )
38	37	ex 115	. . . 4 |- ( ( W e. Word V /\ U e. X ) -> ( ( U e. Word V /\ (♯ ` U ) = ( (♯ ` W ) + 1 ) ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) ) ) )
39	5, 38	syld 45	. . 3 |- ( ( W e. Word V /\ U e. X ) -> ( A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) ) ) )
40	39	com23 78	. 2 |- ( ( W e. Word V /\ U e. X ) -> ( A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) -> ( A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) ) ) )
41	40	3imp 1219	1 |- ( ( ( W e. Word V /\ U e. X ) /\ A. s e. V ( ( W ++ <" s "> ) e. X -> S = s ) /\ A. x e. X ( x e. Word V /\ (♯ ` x ) = ( (♯ ` W ) + 1 ) ) ) -> ( W = ( U prefix (♯ ` W ) ) -> U = ( W ++ <" S "> ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   A.wral 2510   E.wrex 2511   ` cfv 5326  (class class class)co 6018   1c1 8033   + caddc 8035  ♯chash 11038  Word cword 11117   ++ cconcat 11171   <"cs1 11196   prefix cpfx 11257

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-1o 6582  df-er 6702  df-en 6910  df-dom 6911  df-fin 6912  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-fz 10244  df-fzo 10378  df-ihash 11039  df-word 11118  df-lsw 11163  df-concat 11172  df-s1 11197  df-substr 11231  df-pfx 11258

This theorem is referenced by:  reuccatpfxs1  11332