Theorem resunimafz0 11296

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

Step	Hyp	Ref	Expression
1		imaundi 5203	. . . . 5 |- ( F " ( ( 0..^ N ) u. { N } ) ) = ( ( F " ( 0..^ N ) ) u. ( F " { N } ) )
2		resunimafz0.n	. . . . . . . . 9 |- ( ph -> N e. ( 0..^ (♯ ` F ) ) )
3		elfzonn0 10615	. . . . . . . . 9 |- ( N e. ( 0..^ (♯ ` F ) ) -> N e. NN0 )
4	2, 3	syl 14	. . . . . . . 8 |- ( ph -> N e. NN0 )
5		elnn0uz 9976	. . . . . . . 8 |- ( N e. NN0 <-> N e. ( ZZ>= ` 0 ) )
6	4, 5	sylib 122	. . . . . . 7 |- ( ph -> N e. ( ZZ>= ` 0 ) )
7		fzisfzounsn 10672	. . . . . . 7 |- ( N e. ( ZZ>= ` 0 ) -> ( 0 ... N ) = ( ( 0..^ N ) u. { N } ) )
8	6, 7	syl 14	. . . . . 6 |- ( ph -> ( 0 ... N ) = ( ( 0..^ N ) u. { N } ) )
9	8	imaeq2d 5129	. . . . 5 |- ( ph -> ( F " ( 0 ... N ) ) = ( F " ( ( 0..^ N ) u. { N } ) ) )
10		resunimafz0.f	. . . . . . . 8 |- ( ph -> F : ( 0..^ (♯ ` F ) ) --> dom I )
11	10	ffnd 5537	. . . . . . 7 |- ( ph -> F Fn ( 0..^ (♯ ` F ) ) )
12		fnsnfv 5765	. . . . . . 7 |- ( ( F Fn ( 0..^ (♯ ` F ) ) /\ N e. ( 0..^ (♯ ` F ) ) ) -> { ( F ` N ) } = ( F " { N } ) )
13	11, 2, 12	syl2anc 415	. . . . . 6 |- ( ph -> { ( F ` N ) } = ( F " { N } ) )
14	13	uneq2d 3383	. . . . 5 |- ( ph -> ( ( F " ( 0..^ N ) ) u. { ( F ` N ) } ) = ( ( F " ( 0..^ N ) ) u. ( F " { N } ) ) )
15	1, 9, 14	3eqtr4a 2297	. . . 4 |- ( ph -> ( F " ( 0 ... N ) ) = ( ( F " ( 0..^ N ) ) u. { ( F ` N ) } ) )
16	15	reseq2d 5065	. . 3 |- ( ph -> ( I |` ( F " ( 0 ... N ) ) ) = ( I |` ( ( F " ( 0..^ N ) ) u. { ( F ` N ) } ) ) )
17		resundi 5078	. . 3 |- ( I |` ( ( F " ( 0..^ N ) ) u. { ( F ` N ) } ) ) = ( ( I |` ( F " ( 0..^ N ) ) ) u. ( I |` { ( F ` N ) } ) )
18	16, 17	eqtrdi 2287	. 2 |- ( ph -> ( I |` ( F " ( 0 ... N ) ) ) = ( ( I |` ( F " ( 0..^ N ) ) ) u. ( I |` { ( F ` N ) } ) ) )
19		resunimafz0.i	. . . . 5 |- ( ph -> Fun I )
20		funfn 5410	. . . . 5 |- ( Fun I <-> I Fn dom I )
21	19, 20	sylib 122	. . . 4 |- ( ph -> I Fn dom I )
22	10, 2	ffvelcdmd 5847	. . . 4 |- ( ph -> ( F ` N ) e. dom I )
23		fnressn 5904	. . . 4 |- ( ( I Fn dom I /\ ( F ` N ) e. dom I ) -> ( I |` { ( F ` N ) } ) = { <. ( F ` N ) , ( I ` ( F ` N ) ) >. } )
24	21, 22, 23	syl2anc 415	. . 3 |- ( ph -> ( I |` { ( F ` N ) } ) = { <. ( F ` N ) , ( I ` ( F ` N ) ) >. } )
25	24	uneq2d 3383	. 2 |- ( ph -> ( ( I |` ( F " ( 0..^ N ) ) ) u. ( I |` { ( F ` N ) } ) ) = ( ( I |` ( F " ( 0..^ N ) ) ) u. { <. ( F ` N ) , ( I ` ( F ` N ) ) >. } ) )
26	18, 25	eqtrd 2271	1 |- ( ph -> ( I |` ( F " ( 0 ... N ) ) ) = ( ( I |` ( F " ( 0..^ N ) ) ) u. { <. ( F ` N ) , ( I ` ( F ` N ) ) >. } ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   u. cun 3218   {csn 3709   <.cop 3712   dom cdm 4776   |` cres 4778   "cima 4779   Fun wfun 5374   Fn wfn 5375   -->wf 5376   ` cfv 5380  (class class class)co 6088   0cc0 8185   NN0cn0 9574   ZZ>=cuz 9937   ...cfz 10428  ..^cfzo 10566  ♯chash 11236

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-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-fzo 10567

This theorem is used by:  trlsegvdegfi  16913