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

Theorem cats1un 11495
Description: Express a word with an extra symbol as the union of the word and the new value. (Contributed by Mario Carneiro, 28-Feb-2016.)
Assertion
Ref Expression
cats1un  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> )  =  ( A  u.  { <. ( `  A ) ,  B >. } ) )

Proof of Theorem cats1un
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ccatws1cl 11402 . . . . 5  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> )  e. Word  X
)
2 wrdf 11312 . . . . 5  |-  ( ( A ++  <" B "> )  e. Word  X  -> 
( A ++  <" B "> ) : ( 0..^ ( `  ( A ++  <" B "> ) ) ) --> X )
31, 2syl 14 . . . 4  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> ) : ( 0..^ ( `  ( A ++  <" B "> ) ) ) --> X )
4 ccatws1leng 11404 . . . . . . 7  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( `  ( A ++  <" B "> ) )  =  ( ( `  A )  +  1 ) )
54oveq2d 6101 . . . . . 6  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( 0..^ ( `  ( A ++  <" B "> ) ) )  =  ( 0..^ ( ( `  A )  +  1 ) ) )
6 lencl 11310 . . . . . . . . 9  |-  ( A  e. Word  X  ->  ( `  A )  e.  NN0 )
7 nn0uz 9959 . . . . . . . . 9  |-  NN0  =  ( ZZ>= `  0 )
86, 7eleqtrdi 2331 . . . . . . . 8  |-  ( A  e. Word  X  ->  ( `  A )  e.  (
ZZ>= `  0 ) )
9 fzosplitsn 10653 . . . . . . . 8  |-  ( ( `  A )  e.  (
ZZ>= `  0 )  -> 
( 0..^ ( ( `  A )  +  1 ) )  =  ( ( 0..^ ( `  A
) )  u.  {
( `  A ) } ) )
108, 9syl 14 . . . . . . 7  |-  ( A  e. Word  X  ->  (
0..^ ( ( `  A
)  +  1 ) )  =  ( ( 0..^ ( `  A
) )  u.  {
( `  A ) } ) )
1110adantr 276 . . . . . 6  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( 0..^ ( ( `  A )  +  1 ) )  =  ( ( 0..^ ( `  A
) )  u.  {
( `  A ) } ) )
125, 11eqtrd 2271 . . . . 5  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( 0..^ ( `  ( A ++  <" B "> ) ) )  =  ( ( 0..^ ( `  A ) )  u. 
{ ( `  A
) } ) )
1312feq2d 5521 . . . 4  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A ++  <" B "> ) : ( 0..^ ( `  ( A ++  <" B "> ) ) ) --> X  <->  ( A ++  <" B "> ) : ( ( 0..^ ( `  A )
)  u.  { ( `  A ) } ) --> X ) )
143, 13mpbid 147 . . 3  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> ) : ( ( 0..^ ( `  A
) )  u.  {
( `  A ) } ) --> X )
1514ffnd 5534 . 2  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> )  Fn  (
( 0..^ ( `  A
) )  u.  {
( `  A ) } ) )
16 wrdf 11312 . . . . 5  |-  ( A  e. Word  X  ->  A : ( 0..^ ( `  A ) ) --> X )
1716adantr 276 . . . 4  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  A : ( 0..^ ( `  A )
) --> X )
18 eqid 2238 . . . . . 6  |-  { <. ( `  A ) ,  B >. }  =  { <. ( `  A ) ,  B >. }
19 fsng 5881 . . . . . 6  |-  ( ( ( `  A )  e.  NN0  /\  B  e.  X )  ->  ( { <. ( `  A ) ,  B >. } : {
( `  A ) } --> { B }  <->  { <. ( `  A ) ,  B >. }  =  { <. ( `  A ) ,  B >. } ) )
2018, 19mpbiri 168 . . . . 5  |-  ( ( ( `  A )  e.  NN0  /\  B  e.  X )  ->  { <. ( `  A ) ,  B >. } : { ( `  A ) } --> { B } )
216, 20sylan 283 . . . 4  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  { <. ( `  A ) ,  B >. } : {
( `  A ) } --> { B } )
22 fzodisjsn 10593 . . . . 5  |-  ( ( 0..^ ( `  A
) )  i^i  {
( `  A ) } )  =  (/)
2322a1i 9 . . . 4  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( 0..^ ( `  A ) )  i^i 
{ ( `  A
) } )  =  (/) )
24 fun 5561 . . . 4  |-  ( ( ( A : ( 0..^ ( `  A
) ) --> X  /\  {
<. ( `  A ) ,  B >. } : {
( `  A ) } --> { B } )  /\  ( ( 0..^ ( `  A )
)  i^i  { ( `  A ) } )  =  (/) )  ->  ( A  u.  { <. ( `  A ) ,  B >. } ) : ( ( 0..^ ( `  A
) )  u.  {
( `  A ) } ) --> ( X  u.  { B } ) )
2517, 21, 23, 24syl21anc 1277 . . 3  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A  u.  { <. ( `  A ) ,  B >. } ) : ( ( 0..^ ( `  A ) )  u. 
{ ( `  A
) } ) --> ( X  u.  { B } ) )
2625ffnd 5534 . 2  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A  u.  { <. ( `  A ) ,  B >. } )  Fn  ( ( 0..^ ( `  A ) )  u. 
{ ( `  A
) } ) )
27 elun 3370 . . 3  |-  ( x  e.  ( ( 0..^ ( `  A )
)  u.  { ( `  A ) } )  <-> 
( x  e.  ( 0..^ ( `  A
) )  \/  x  e.  { ( `  A
) } ) )
28 ccats1val1g 11409 . . . . . 6  |-  ( ( A  e. Word  X  /\  B  e.  X  /\  x  e.  ( 0..^ ( `  A )
) )  ->  (
( A ++  <" B "> ) `  x
)  =  ( A `
 x ) )
29283expa 1234 . . . . 5  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  -> 
( ( A ++  <" B "> ) `  x )  =  ( A `  x ) )
30 vex 2824 . . . . . 6  |-  x  e. 
_V
31 simpr 110 . . . . . . . 8  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  ->  x  e.  ( 0..^ ( `  A )
) )
32 fzonel 10570 . . . . . . . 8  |-  -.  ( `  A )  e.  ( 0..^ ( `  A
) )
33 nelne2 2511 . . . . . . . 8  |-  ( ( x  e.  ( 0..^ ( `  A )
)  /\  -.  ( `  A )  e.  ( 0..^ ( `  A
) ) )  ->  x  =/=  ( `  A
) )
3431, 32, 33sylancl 417 . . . . . . 7  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  ->  x  =/=  ( `  A
) )
3534necomd 2506 . . . . . 6  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  -> 
( `  A )  =/=  x )
36 fvunsng 5909 . . . . . 6  |-  ( ( x  e.  _V  /\  ( `  A )  =/=  x )  ->  (
( A  u.  { <. ( `  A ) ,  B >. } ) `  x )  =  ( A `  x ) )
3730, 35, 36sylancr 418 . . . . 5  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  -> 
( ( A  u.  {
<. ( `  A ) ,  B >. } ) `  x )  =  ( A `  x ) )
3829, 37eqtr4d 2274 . . . 4  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( 0..^ ( `  A
) ) )  -> 
( ( A ++  <" B "> ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x ) )
396elexd 2835 . . . . . . . . 9  |-  ( A  e. Word  X  ->  ( `  A )  e.  _V )
4039adantr 276 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( `  A )  e.  _V )
41 simpr 110 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  B  e.  X )
4217fdmd 5540 . . . . . . . . . 10  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  dom  A  =  ( 0..^ ( `  A
) ) )
4342eleq2d 2308 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( `  A
)  e.  dom  A  <->  ( `  A )  e.  ( 0..^ ( `  A
) ) ) )
4432, 43mtbiri 686 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  -.  ( `  A
)  e.  dom  A
)
45 fsnunfv 5916 . . . . . . . 8  |-  ( ( ( `  A )  e.  _V  /\  B  e.  X  /\  -.  ( `  A )  e.  dom  A )  ->  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  ( `  A ) )  =  B )
4640, 41, 44, 45syl3anc 1278 . . . . . . 7  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A  u.  {
<. ( `  A ) ,  B >. } ) `  ( `  A ) )  =  B )
47 simpl 109 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  A  e. Word  X )
48 s1cl 11391 . . . . . . . . . 10  |-  ( B  e.  X  ->  <" B ">  e. Word  X )
4948adantl 277 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  <" B ">  e. Word  X )
50 s1leng 11394 . . . . . . . . . . . 12  |-  ( B  e.  X  ->  ( ` 
<" B "> )  =  1 )
51 1nn 9316 . . . . . . . . . . . 12  |-  1  e.  NN
5250, 51eqeltrdi 2329 . . . . . . . . . . 11  |-  ( B  e.  X  ->  ( ` 
<" B "> )  e.  NN )
53 lbfzo0 10594 . . . . . . . . . . 11  |-  ( 0  e.  ( 0..^ ( `  <" B "> ) )  <->  ( `  <" B "> )  e.  NN )
5452, 53sylibr 134 . . . . . . . . . 10  |-  ( B  e.  X  ->  0  e.  ( 0..^ ( `  <" B "> )
) )
5554adantl 277 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  0  e.  ( 0..^ ( `  <" B "> ) ) )
56 ccatval3 11369 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  <" B ">  e. Word  X  /\  0  e.  ( 0..^ ( `  <" B "> )
) )  ->  (
( A ++  <" B "> ) `  (
0  +  ( `  A
) ) )  =  ( <" B "> `  0 )
)
5747, 49, 55, 56syl3anc 1278 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A ++  <" B "> ) `  ( 0  +  ( `  A ) ) )  =  ( <" B "> `  0 )
)
58 s1fv 11396 . . . . . . . . 9  |-  ( B  e.  X  ->  ( <" B "> `  0 )  =  B )
5958adantl 277 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( <" B "> `  0 )  =  B )
6057, 59eqtrd 2271 . . . . . . 7  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A ++  <" B "> ) `  ( 0  +  ( `  A ) ) )  =  B )
616adantr 276 . . . . . . . . . 10  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( `  A )  e.  NN0 )
6261nn0cnd 9624 . . . . . . . . 9  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( `  A )  e.  CC )
6362addlidd 8476 . . . . . . . 8  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( 0  +  ( `  A ) )  =  ( `  A )
)
6463fveq2d 5699 . . . . . . 7  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A ++  <" B "> ) `  ( 0  +  ( `  A ) ) )  =  ( ( A ++ 
<" B "> ) `  ( `  A
) ) )
6546, 60, 643eqtr2rd 2278 . . . . . 6  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( ( A ++  <" B "> ) `  ( `  A )
)  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  ( `  A ) ) )
66 elsni 3727 . . . . . . . 8  |-  ( x  e.  { ( `  A
) }  ->  x  =  ( `  A )
)
6766fveq2d 5699 . . . . . . 7  |-  ( x  e.  { ( `  A
) }  ->  (
( A ++  <" B "> ) `  x
)  =  ( ( A ++  <" B "> ) `  ( `  A
) ) )
6866fveq2d 5699 . . . . . . 7  |-  ( x  e.  { ( `  A
) }  ->  (
( A  u.  { <. ( `  A ) ,  B >. } ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  ( `  A ) ) )
6967, 68eqeq12d 2253 . . . . . 6  |-  ( x  e.  { ( `  A
) }  ->  (
( ( A ++  <" B "> ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x )  <->  ( ( A ++  <" B "> ) `  ( `  A
) )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  ( `  A ) ) ) )
7065, 69syl5ibrcom 157 . . . . 5  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( x  e.  {
( `  A ) }  ->  ( ( A ++ 
<" B "> ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x
) ) )
7170imp 124 . . . 4  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  { ( `  A ) } )  ->  (
( A ++  <" B "> ) `  x
)  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x
) )
7238, 71jaodan 809 . . 3  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  ( x  e.  ( 0..^ ( `  A
) )  \/  x  e.  { ( `  A
) } ) )  ->  ( ( A ++ 
<" B "> ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x
) )
7327, 72sylan2b 287 . 2  |-  ( ( ( A  e. Word  X  /\  B  e.  X
)  /\  x  e.  ( ( 0..^ ( `  A ) )  u. 
{ ( `  A
) } ) )  ->  ( ( A ++ 
<" B "> ) `  x )  =  ( ( A  u.  { <. ( `  A ) ,  B >. } ) `  x
) )
7415, 26, 73eqfnfvd 5809 1  |-  ( ( A  e. Word  X  /\  B  e.  X )  ->  ( A ++  <" B "> )  =  ( A  u.  { <. ( `  A ) ,  B >. } ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    u. cun 3218    i^i cin 3219   (/)c0 3520   {csn 3709   <.cop 3712   dom cdm 4774   -->wf 5373   ` cfv 5377  (class class class)co 6085   0cc0 8179   1c1 8180    + caddc 8182   NNcn 9305   NN0cn0 9565   ZZ>=cuz 9923  ..^cfzo 10551  ♯chash 11216  Word cword 11306   ++ cconcat 11360   <"cs1 11385
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 9306  df-n0 9566  df-z 9647  df-uz 9924  df-fz 10414  df-fzo 10552  df-ihash 11217  df-word 11307  df-concat 11361  df-s1 11386
This theorem is used by:  vdegp1aid  16567  vdegp1bid  16568
  Copyright terms: Public domain W3C validator