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

Theorem pfxccatid 11321
Description: A prefix of a concatenation of length of the first concatenated word is the first word itself. (Contributed by Alexander van der Vekens, 20-Sep-2018.) (Revised by AV, 10-May-2020.)
Assertion
Ref Expression
pfxccatid  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( ( A ++  B ) prefix  N )  =  A )

Proof of Theorem pfxccatid
StepHypRef Expression
1 lencl 11116 . . . . . 6  |-  ( A  e. Word  V  ->  ( `  A )  e.  NN0 )
2 nn0fz0 10353 . . . . . 6  |-  ( ( `  A )  e.  NN0  <->  ( `  A )  e.  ( 0 ... ( `  A
) ) )
31, 2sylib 122 . . . . 5  |-  ( A  e. Word  V  ->  ( `  A )  e.  ( 0 ... ( `  A
) ) )
433ad2ant1 1044 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( `  A
)  e.  ( 0 ... ( `  A
) ) )
5 eleq1 2294 . . . . 5  |-  ( N  =  ( `  A
)  ->  ( N  e.  ( 0 ... ( `  A ) )  <->  ( `  A
)  e.  ( 0 ... ( `  A
) ) ) )
653ad2ant3 1046 . . . 4  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( N  e.  ( 0 ... ( `  A ) )  <->  ( `  A
)  e.  ( 0 ... ( `  A
) ) ) )
74, 6mpbird 167 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  N  e.  ( 0 ... ( `  A ) ) )
8 eqid 2231 . . . 4  |-  ( `  A
)  =  ( `  A
)
98pfxccatpfx1 11316 . . 3  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  e.  ( 0 ... ( `  A ) ) )  ->  ( ( A ++  B ) prefix  N )  =  ( A prefix  N
) )
107, 9syld3an3 1318 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( ( A ++  B ) prefix  N )  =  ( A prefix  N
) )
11 oveq2 6025 . . 3  |-  ( N  =  ( `  A
)  ->  ( A prefix  N )  =  ( A prefix 
( `  A ) ) )
12113ad2ant3 1046 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( A prefix  N )  =  ( A prefix 
( `  A ) ) )
13 pfxid 11266 . . 3  |-  ( A  e. Word  V  ->  ( A prefix  ( `  A )
)  =  A )
14133ad2ant1 1044 . 2  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( A prefix  ( `  A ) )  =  A )
1510, 12, 143eqtrd 2268 1  |-  ( ( A  e. Word  V  /\  B  e. Word  V  /\  N  =  ( `  A )
)  ->  ( ( A ++  B ) prefix  N )  =  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2202   ` cfv 5326  (class class class)co 6017   0cc0 8031   NN0cn0 9401   ...cfz 10242  ♯chash 11036  Word cword 11112   ++ cconcat 11166   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-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147
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 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-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377  df-ihash 11037  df-word 11113  df-concat 11167  df-substr 11226  df-pfx 11253
This theorem is referenced by:  ccats1pfxeqbi  11322
  Copyright terms: Public domain W3C validator