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

Theorem cats1fvnd 11461
Description: The last symbol of a concatenation with a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.) (Revised by Jim Kingdon, 20-Jan-2026.)
Hypotheses
Ref Expression
cats1cld.1  |-  T  =  ( S ++  <" X "> )
cats1fvnd.2  |-  ( ph  ->  S  e. Word  _V )
cats1fvnd.x  |-  ( ph  ->  X  e.  V )
cats1fvnd.3  |-  ( ph  ->  ( `  S )  =  M )
Assertion
Ref Expression
cats1fvnd  |-  ( ph  ->  ( T `  M
)  =  X )

Proof of Theorem cats1fvnd
StepHypRef Expression
1 cats1cld.1 . . . 4  |-  T  =  ( S ++  <" X "> )
21a1i 9 . . 3  |-  ( ph  ->  T  =  ( S ++ 
<" X "> ) )
3 cats1fvnd.2 . . . . . . 7  |-  ( ph  ->  S  e. Word  _V )
4 lencl 11232 . . . . . . 7  |-  ( S  e. Word  _V  ->  ( `  S
)  e.  NN0 )
53, 4syl 14 . . . . . 6  |-  ( ph  ->  ( `  S )  e.  NN0 )
65nn0cnd 9557 . . . . 5  |-  ( ph  ->  ( `  S )  e.  CC )
76addlidd 8425 . . . 4  |-  ( ph  ->  ( 0  +  ( `  S ) )  =  ( `  S )
)
8 cats1fvnd.3 . . . 4  |-  ( ph  ->  ( `  S )  =  M )
97, 8eqtr2d 2268 . . 3  |-  ( ph  ->  M  =  ( 0  +  ( `  S
) ) )
102, 9fveq12d 5679 . 2  |-  ( ph  ->  ( T `  M
)  =  ( ( S ++  <" X "> ) `  ( 0  +  ( `  S
) ) ) )
11 cats1fvnd.x . . . 4  |-  ( ph  ->  X  e.  V )
12 elex 2827 . . . . 5  |-  ( X  e.  V  ->  X  e.  _V )
1312s1cld 11314 . . . 4  |-  ( X  e.  V  ->  <" X ">  e. Word  _V )
1411, 13syl 14 . . 3  |-  ( ph  ->  <" X ">  e. Word  _V )
15 s1leng 11316 . . . . . 6  |-  ( X  e.  V  ->  ( ` 
<" X "> )  =  1 )
16 1nn 9250 . . . . . 6  |-  1  e.  NN
1715, 16eqeltrdi 2325 . . . . 5  |-  ( X  e.  V  ->  ( ` 
<" X "> )  e.  NN )
18 lbfzo0 10523 . . . . 5  |-  ( 0  e.  ( 0..^ ( `  <" X "> ) )  <->  ( `  <" X "> )  e.  NN )
1917, 18sylibr 134 . . . 4  |-  ( X  e.  V  ->  0  e.  ( 0..^ ( `  <" X "> )
) )
2011, 19syl 14 . . 3  |-  ( ph  ->  0  e.  ( 0..^ ( `  <" X "> ) ) )
21 ccatval3 11291 . . 3  |-  ( ( S  e. Word  _V  /\  <" X ">  e. Word  _V  /\  0  e.  ( 0..^ ( `  <" X "> )
) )  ->  (
( S ++  <" X "> ) `  (
0  +  ( `  S
) ) )  =  ( <" X "> `  0 )
)
223, 14, 20, 21syl3anc 1274 . 2  |-  ( ph  ->  ( ( S ++  <" X "> ) `  ( 0  +  ( `  S ) ) )  =  ( <" X "> `  0 )
)
23 s1fv 11318 . . 3  |-  ( X  e.  V  ->  ( <" X "> `  0 )  =  X )
2411, 23syl 14 . 2  |-  ( ph  ->  ( <" X "> `  0 )  =  X )
2510, 22, 243eqtrd 2271 1  |-  ( ph  ->  ( T `  M
)  =  X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   _Vcvv 2815   ` cfv 5354  (class class class)co 6052   0cc0 8129   1c1 8130    + caddc 8132   NNcn 9239   NN0cn0 9498  ..^cfzo 10480  ♯chash 11142  Word cword 11228   ++ cconcat 11282   <"cs1 11307
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-1o 6649  df-er 6769  df-en 6978  df-dom 6979  df-fin 6980  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-n0 9499  df-z 9580  df-uz 9857  df-fz 10346  df-fzo 10481  df-ihash 11143  df-word 11229  df-concat 11283  df-s1 11308
This theorem is referenced by:  s2fv1g  11484  s3fv2g  11489
  Copyright terms: Public domain W3C validator