ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  reuccatpfxs1 Unicode version

Theorem reuccatpfxs1 11327
Description: There is a unique word having the length of a given word increased by 1 with the given word as prefix if there is a unique symbol which extends the given word. (Contributed by Alexander van der Vekens, 6-Oct-2018.) (Revised by AV, 21-Jan-2022.) (Revised by AV, 13-Oct-2022.)
Hypothesis
Ref Expression
reuccatpfxs1.1  |-  F/_ v X
Assertion
Ref Expression
reuccatpfxs1  |-  ( ( W  e. Word  V  /\  A. x  e.  X  ( x  e. Word  V  /\  ( `  x )  =  ( ( `  W
)  +  1 ) ) )  ->  ( E! v  e.  V  ( W ++  <" v "> )  e.  X  ->  E! x  e.  X  W  =  ( x prefix  ( `  W ) ) ) )
Distinct variable groups:    v, V, x   
v, W, x    x, X
Allowed substitution hint:    X( v)

Proof of Theorem reuccatpfxs1
Dummy variables  u  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1w 2292 . . . 4  |-  ( x  =  y  ->  (
x  e. Word  V  <->  y  e. Word  V ) )
2 fveqeq2 5648 . . . 4  |-  ( x  =  y  ->  (
( `  x )  =  ( ( `  W
)  +  1 )  <-> 
( `  y )  =  ( ( `  W
)  +  1 ) ) )
31, 2anbi12d 473 . . 3  |-  ( x  =  y  ->  (
( x  e. Word  V  /\  ( `  x )  =  ( ( `  W
)  +  1 ) )  <->  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) ) )
43cbvralvw 2771 . 2  |-  ( A. x  e.  X  (
x  e. Word  V  /\  ( `  x )  =  ( ( `  W
)  +  1 ) )  <->  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )
5 reuccatpfxs1.1 . . . . 5  |-  F/_ v X
65nfel2 2387 . . . 4  |-  F/ v ( W ++  <" u "> )  e.  X
75nfel2 2387 . . . 4  |-  F/ v ( W ++  <" x "> )  e.  X
8 s1eq 11195 . . . . . 6  |-  ( v  =  x  ->  <" v ">  =  <" x "> )
98oveq2d 6033 . . . . 5  |-  ( v  =  x  ->  ( W ++  <" v "> )  =  ( W ++  <" x "> ) )
109eleq1d 2300 . . . 4  |-  ( v  =  x  ->  (
( W ++  <" v "> )  e.  X  <->  ( W ++  <" x "> )  e.  X
) )
11 s1eq 11195 . . . . . 6  |-  ( x  =  u  ->  <" x ">  =  <" u "> )
1211oveq2d 6033 . . . . 5  |-  ( x  =  u  ->  ( W ++  <" x "> )  =  ( W ++  <" u "> ) )
1312eleq1d 2300 . . . 4  |-  ( x  =  u  ->  (
( W ++  <" x "> )  e.  X  <->  ( W ++  <" u "> )  e.  X
) )
146, 7, 10, 13reu8nf 3113 . . 3  |-  ( E! v  e.  V  ( W ++  <" v "> )  e.  X  <->  E. v  e.  V  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )
15 nfv 1576 . . . . 5  |-  F/ v  W  e. Word  V
16 nfv 1576 . . . . . 6  |-  F/ v ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) )
175, 16nfralw 2569 . . . . 5  |-  F/ v A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) )
1815, 17nfan 1613 . . . 4  |-  F/ v ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )
19 nfv 1576 . . . . 5  |-  F/ v  W  =  ( x prefix 
( `  W ) )
205, 19nfreuw 2708 . . . 4  |-  F/ v E! x  e.  X  W  =  ( x prefix  ( `  W ) )
21 simprl 531 . . . . . 6  |-  ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )  /\  v  e.  V )  /\  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  ->  ( W ++  <" v "> )  e.  X
)
22 simpl 109 . . . . . . . . . . 11  |-  ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  ->  W  e. Word  V )
2322ad2antrr 488 . . . . . . . . . 10  |-  ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )  /\  v  e.  V )  /\  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  ->  W  e. Word  V )
2423anim1i 340 . . . . . . . . 9  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( W  e. Word  V  /\  x  e.  X ) )
25 simplrr 538 . . . . . . . . 9  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) )
26 simp-4r 544 . . . . . . . . 9  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )
27 reuccatpfxs1lem 11326 . . . . . . . . 9  |-  ( ( ( W  e. Word  V  /\  x  e.  X
)  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u )  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )  -> 
( W  =  ( x prefix  ( `  W )
)  ->  x  =  ( W ++  <" v "> ) ) )
2824, 25, 26, 27syl3anc 1273 . . . . . . . 8  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( W  =  ( x prefix  ( `  W ) )  ->  x  =  ( W ++  <" v "> ) ) )
29 oveq1 6024 . . . . . . . . . . 11  |-  ( x  =  ( W ++  <" v "> )  ->  ( x prefix  ( `  W
) )  =  ( ( W ++  <" v "> ) prefix  ( `  W
) ) )
30 s1cl 11197 . . . . . . . . . . . . . 14  |-  ( v  e.  V  ->  <" v ">  e. Word  V )
3122, 30anim12i 338 . . . . . . . . . . . . 13  |-  ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  ->  ( W  e. Word  V  /\  <" v ">  e. Word  V ) )
3231ad2antrr 488 . . . . . . . . . . . 12  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( W  e. Word  V  /\  <" v ">  e. Word  V )
)
33 pfxccat1 11282 . . . . . . . . . . . 12  |-  ( ( W  e. Word  V  /\  <" v ">  e. Word  V )  ->  (
( W ++  <" v "> ) prefix  ( `  W
) )  =  W )
3432, 33syl 14 . . . . . . . . . . 11  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( ( W ++  <" v "> ) prefix  ( `  W
) )  =  W )
3529, 34sylan9eqr 2286 . . . . . . . . . 10  |-  ( ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  /\  x  =  ( W ++  <" v "> ) )  -> 
( x prefix  ( `  W
) )  =  W )
3635eqcomd 2237 . . . . . . . . 9  |-  ( ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  /\  x  =  ( W ++  <" v "> ) )  ->  W  =  ( x prefix  ( `  W ) ) )
3736ex 115 . . . . . . . 8  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( x  =  ( W ++  <" v "> )  ->  W  =  ( x prefix 
( `  W ) ) ) )
3828, 37impbid 129 . . . . . . 7  |-  ( ( ( ( ( W  e. Word  V  /\  A. y  e.  X  (
y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  /\  v  e.  V )  /\  (
( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  /\  x  e.  X
)  ->  ( W  =  ( x prefix  ( `  W ) )  <->  x  =  ( W ++  <" v "> ) ) )
3938ralrimiva 2605 . . . . . 6  |-  ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )  /\  v  e.  V )  /\  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  ->  A. x  e.  X  ( W  =  ( x prefix  ( `  W ) )  <->  x  =  ( W ++  <" v "> ) ) )
40 reu6i 2997 . . . . . 6  |-  ( ( ( W ++  <" v "> )  e.  X  /\  A. x  e.  X  ( W  =  (
x prefix  ( `  W )
)  <->  x  =  ( W ++  <" v "> ) ) )  ->  E! x  e.  X  W  =  ( x prefix  ( `  W )
) )
4121, 39, 40syl2anc 411 . . . . 5  |-  ( ( ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y
)  =  ( ( `  W )  +  1 ) ) )  /\  v  e.  V )  /\  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) ) )  ->  E! x  e.  X  W  =  ( x prefix  ( `  W ) ) )
4241exp31 364 . . . 4  |-  ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  ->  (
v  e.  V  -> 
( ( ( W ++ 
<" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) )  ->  E! x  e.  X  W  =  ( x prefix  ( `  W
) ) ) ) )
4318, 20, 42rexlimd 2647 . . 3  |-  ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  ->  ( E. v  e.  V  ( ( W ++  <" v "> )  e.  X  /\  A. u  e.  V  ( ( W ++  <" u "> )  e.  X  ->  v  =  u ) )  ->  E! x  e.  X  W  =  ( x prefix  ( `  W
) ) ) )
4414, 43biimtrid 152 . 2  |-  ( ( W  e. Word  V  /\  A. y  e.  X  ( y  e. Word  V  /\  ( `  y )  =  ( ( `  W
)  +  1 ) ) )  ->  ( E! v  e.  V  ( W ++  <" v "> )  e.  X  ->  E! x  e.  X  W  =  ( x prefix  ( `  W ) ) ) )
454, 44sylan2b 287 1  |-  ( ( W  e. Word  V  /\  A. x  e.  X  ( x  e. Word  V  /\  ( `  x )  =  ( ( `  W
)  +  1 ) ) )  ->  ( E! v  e.  V  ( W ++  <" v "> )  e.  X  ->  E! x  e.  X  W  =  ( x prefix  ( `  W ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   F/_wnfc 2361   A.wral 2510   E.wrex 2511   E!wreu 2512   ` cfv 5326  (class class class)co 6017   1c1 8032    + caddc 8034  ♯chash 11036  Word cword 11112   ++ cconcat 11166   <"cs1 11191   prefix cpfx 11252
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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
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-rmo 2518  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 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-er 6701  df-en 6909  df-dom 6910  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377  df-ihash 11037  df-word 11113  df-lsw 11158  df-concat 11167  df-s1 11192  df-substr 11226  df-pfx 11253
This theorem is referenced by:  reuccatpfxs1v  11328
  Copyright terms: Public domain W3C validator