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

Theorem resunimafz0 10744
Description: The union of a restriction by an image over an open range of nonnegative integers and a singleton of an ordered pair is a restriction by an image over an interval of nonnegative integers. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 20-Feb-2021.)
Hypotheses
Ref Expression
resunimafz0.i  |-  ( ph  ->  Fun  I )
resunimafz0.f  |-  ( ph  ->  F : ( 0..^ ( `  F )
) --> dom  I )
resunimafz0.n  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
Assertion
Ref Expression
resunimafz0  |-  ( ph  ->  ( I  |`  ( F " ( 0 ... N ) ) )  =  ( ( I  |`  ( F " (
0..^ N ) ) )  u.  { <. ( F `  N ) ,  ( I `  ( F `  N ) ) >. } ) )

Proof of Theorem resunimafz0
StepHypRef Expression
1 imaundi 5016 . . . . 5  |-  ( F
" ( ( 0..^ N )  u.  { N } ) )  =  ( ( F "
( 0..^ N ) )  u.  ( F
" { N }
) )
2 resunimafz0.n . . . . . . . . 9  |-  ( ph  ->  N  e.  ( 0..^ ( `  F )
) )
3 elfzonn0 10121 . . . . . . . . 9  |-  ( N  e.  ( 0..^ ( `  F ) )  ->  N  e.  NN0 )
42, 3syl 14 . . . . . . . 8  |-  ( ph  ->  N  e.  NN0 )
5 elnn0uz 9503 . . . . . . . 8  |-  ( N  e.  NN0  <->  N  e.  ( ZZ>=
`  0 ) )
64, 5sylib 121 . . . . . . 7  |-  ( ph  ->  N  e.  ( ZZ>= ` 
0 ) )
7 fzisfzounsn 10171 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  0
)  ->  ( 0 ... N )  =  ( ( 0..^ N )  u.  { N } ) )
86, 7syl 14 . . . . . 6  |-  ( ph  ->  ( 0 ... N
)  =  ( ( 0..^ N )  u. 
{ N } ) )
98imaeq2d 4946 . . . . 5  |-  ( ph  ->  ( F " (
0 ... N ) )  =  ( F "
( ( 0..^ N )  u.  { N } ) ) )
10 resunimafz0.f . . . . . . . 8  |-  ( ph  ->  F : ( 0..^ ( `  F )
) --> dom  I )
1110ffnd 5338 . . . . . . 7  |-  ( ph  ->  F  Fn  ( 0..^ ( `  F )
) )
12 fnsnfv 5545 . . . . . . 7  |-  ( ( F  Fn  ( 0..^ ( `  F )
)  /\  N  e.  ( 0..^ ( `  F
) ) )  ->  { ( F `  N ) }  =  ( F " { N } ) )
1311, 2, 12syl2anc 409 . . . . . 6  |-  ( ph  ->  { ( F `  N ) }  =  ( F " { N } ) )
1413uneq2d 3276 . . . . 5  |-  ( ph  ->  ( ( F "
( 0..^ N ) )  u.  { ( F `  N ) } )  =  ( ( F " (
0..^ N ) )  u.  ( F " { N } ) ) )
151, 9, 143eqtr4a 2225 . . . 4  |-  ( ph  ->  ( F " (
0 ... N ) )  =  ( ( F
" ( 0..^ N ) )  u.  {
( F `  N
) } ) )
1615reseq2d 4884 . . 3  |-  ( ph  ->  ( I  |`  ( F " ( 0 ... N ) ) )  =  ( I  |`  ( ( F "
( 0..^ N ) )  u.  { ( F `  N ) } ) ) )
17 resundi 4897 . . 3  |-  ( I  |`  ( ( F "
( 0..^ N ) )  u.  { ( F `  N ) } ) )  =  ( ( I  |`  ( F " ( 0..^ N ) ) )  u.  ( I  |`  { ( F `  N ) } ) )
1816, 17eqtrdi 2215 . 2  |-  ( ph  ->  ( I  |`  ( F " ( 0 ... N ) ) )  =  ( ( I  |`  ( F " (
0..^ N ) ) )  u.  ( I  |`  { ( F `  N ) } ) ) )
19 resunimafz0.i . . . . 5  |-  ( ph  ->  Fun  I )
20 funfn 5218 . . . . 5  |-  ( Fun  I  <->  I  Fn  dom  I )
2119, 20sylib 121 . . . 4  |-  ( ph  ->  I  Fn  dom  I
)
2210, 2ffvelrnd 5621 . . . 4  |-  ( ph  ->  ( F `  N
)  e.  dom  I
)
23 fnressn 5671 . . . 4  |-  ( ( I  Fn  dom  I  /\  ( F `  N
)  e.  dom  I
)  ->  ( I  |` 
{ ( F `  N ) } )  =  { <. ( F `  N ) ,  ( I `  ( F `  N ) ) >. } )
2421, 22, 23syl2anc 409 . . 3  |-  ( ph  ->  ( I  |`  { ( F `  N ) } )  =  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } )
2524uneq2d 3276 . 2  |-  ( ph  ->  ( ( I  |`  ( F " ( 0..^ N ) ) )  u.  ( I  |`  { ( F `  N ) } ) )  =  ( ( I  |`  ( F " ( 0..^ N ) ) )  u.  { <. ( F `  N
) ,  ( I `
 ( F `  N ) ) >. } ) )
2618, 25eqtrd 2198 1  |-  ( ph  ->  ( I  |`  ( F " ( 0 ... N ) ) )  =  ( ( I  |`  ( F " (
0..^ N ) ) )  u.  { <. ( F `  N ) ,  ( I `  ( F `  N ) ) >. } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1343    e. wcel 2136    u. cun 3114   {csn 3576   <.cop 3579   dom cdm 4604    |` cres 4606   "cima 4607   Fun wfun 5182    Fn wfn 5183   -->wf 5184   ` cfv 5188  (class class class)co 5842   0cc0 7753   NN0cn0 9114   ZZ>=cuz 9466   ...cfz 9944  ..^cfzo 10077  ♯chash 10688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192  df-uz 9467  df-fz 9945  df-fzo 10078
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator