Theorem fzsuc2 10486

Description: Join a successor to the end of a finite set of sequential integers. (Contributed by Mario Carneiro, 7-Mar-2014.)

Assertion

Ref	Expression
fzsuc2	|- ( ( M e. ZZ /\ N e. ( ZZ>= ` ( M - 1 ) ) ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )

Proof of Theorem fzsuc2

Step	Hyp	Ref	Expression
1		uzp1 9956	. 2 |- ( N e. ( ZZ>= ` ( M - 1 ) ) -> ( N = ( M - 1 ) \/ N e. ( ZZ>= ` ( ( M - 1 ) + 1 ) ) ) )
2		zcn 9649	. . . . . . . 8 |- ( M e. ZZ -> M e. CC )
3		ax-1cn 8272	. . . . . . . 8 |- 1 e. CC
4		npcan 8535	. . . . . . . 8 |- ( ( M e. CC /\ 1 e. CC ) -> ( ( M - 1 ) + 1 ) = M )
5	2, 3, 4	sylancl 417	. . . . . . 7 |- ( M e. ZZ -> ( ( M - 1 ) + 1 ) = M )
6	5	oveq2d 6101	. . . . . 6 |- ( M e. ZZ -> ( M ... ( ( M - 1 ) + 1 ) ) = ( M ... M ) )
7		uncom 3373	. . . . . . . 8 |- ( (/) u. { M } ) = ( { M } u. (/) )
8		un0 3556	. . . . . . . 8 |- ( { M } u. (/) ) = { M }
9	7, 8	eqtri 2259	. . . . . . 7 |- ( (/) u. { M } ) = { M }
10		zre 9648	. . . . . . . . . 10 |- ( M e. ZZ -> M e. RR )
11	10	ltm1d 9262	. . . . . . . . 9 |- ( M e. ZZ -> ( M - 1 ) < M )
12		peano2zm 9682	. . . . . . . . . 10 |- ( M e. ZZ -> ( M - 1 ) e. ZZ )
13		fzn 10446	. . . . . . . . . 10 |- ( ( M e. ZZ /\ ( M - 1 ) e. ZZ ) -> ( ( M - 1 ) < M <-> ( M ... ( M - 1 ) ) = (/) ) )
14	12, 13	mpdan 425	. . . . . . . . 9 |- ( M e. ZZ -> ( ( M - 1 ) < M <-> ( M ... ( M - 1 ) ) = (/) ) )
15	11, 14	mpbid 147	. . . . . . . 8 |- ( M e. ZZ -> ( M ... ( M - 1 ) ) = (/) )
16	5	sneqd 3722	. . . . . . . 8 |- ( M e. ZZ -> { ( ( M - 1 ) + 1 ) } = { M } )
17	15, 16	uneq12d 3384	. . . . . . 7 |- ( M e. ZZ -> ( ( M ... ( M - 1 ) ) u. { ( ( M - 1 ) + 1 ) } ) = ( (/) u. { M } ) )
18		fzsn 10472	. . . . . . 7 |- ( M e. ZZ -> ( M ... M ) = { M } )
19	9, 17, 18	3eqtr4a 2297	. . . . . 6 |- ( M e. ZZ -> ( ( M ... ( M - 1 ) ) u. { ( ( M - 1 ) + 1 ) } ) = ( M ... M ) )
20	6, 19	eqtr4d 2274	. . . . 5 |- ( M e. ZZ -> ( M ... ( ( M - 1 ) + 1 ) ) = ( ( M ... ( M - 1 ) ) u. { ( ( M - 1 ) + 1 ) } ) )
21		oveq1 6092	. . . . . . 7 |- ( N = ( M - 1 ) -> ( N + 1 ) = ( ( M - 1 ) + 1 ) )
22	21	oveq2d 6101	. . . . . 6 |- ( N = ( M - 1 ) -> ( M ... ( N + 1 ) ) = ( M ... ( ( M - 1 ) + 1 ) ) )
23		oveq2 6093	. . . . . . 7 |- ( N = ( M - 1 ) -> ( M ... N ) = ( M ... ( M - 1 ) ) )
24	21	sneqd 3722	. . . . . . 7 |- ( N = ( M - 1 ) -> { ( N + 1 ) } = { ( ( M - 1 ) + 1 ) } )
25	23, 24	uneq12d 3384	. . . . . 6 |- ( N = ( M - 1 ) -> ( ( M ... N ) u. { ( N + 1 ) } ) = ( ( M ... ( M - 1 ) ) u. { ( ( M - 1 ) + 1 ) } ) )
26	22, 25	eqeq12d 2253	. . . . 5 |- ( N = ( M - 1 ) -> ( ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) <-> ( M ... ( ( M - 1 ) + 1 ) ) = ( ( M ... ( M - 1 ) ) u. { ( ( M - 1 ) + 1 ) } ) ) )
27	20, 26	syl5ibrcom 157	. . . 4 |- ( M e. ZZ -> ( N = ( M - 1 ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) ) )
28	27	imp 124	. . 3 |- ( ( M e. ZZ /\ N = ( M - 1 ) ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )
29	5	fveq2d 5699	. . . . . 6 |- ( M e. ZZ -> ( ZZ>= ` ( ( M - 1 ) + 1 ) ) = ( ZZ>= ` M ) )
30	29	eleq2d 2308	. . . . 5 |- ( M e. ZZ -> ( N e. ( ZZ>= ` ( ( M - 1 ) + 1 ) ) <-> N e. ( ZZ>= ` M ) ) )
31	30	biimpa 296	. . . 4 |- ( ( M e. ZZ /\ N e. ( ZZ>= ` ( ( M - 1 ) + 1 ) ) ) -> N e. ( ZZ>= ` M ) )
32		fzsuc 10475	. . . 4 |- ( N e. ( ZZ>= ` M ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )
33	31, 32	syl 14	. . 3 |- ( ( M e. ZZ /\ N e. ( ZZ>= ` ( ( M - 1 ) + 1 ) ) ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )
34	28, 33	jaodan 809	. 2 |- ( ( M e. ZZ /\ ( N = ( M - 1 ) \/ N e. ( ZZ>= ` ( ( M - 1 ) + 1 ) ) ) ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )
35	1, 34	sylan2 286	1 |- ( ( M e. ZZ /\ N e. ( ZZ>= ` ( M - 1 ) ) ) -> ( M ... ( N + 1 ) ) = ( ( M ... N ) u. { ( N + 1 ) } ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   = wceq 1402   e. wcel 2209   u. cun 3218   (/)c0 3520   {csn 3709   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   CCcc 8177   1c1 8180   + caddc 8182   < clt 8360   - cmin 8497   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411

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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  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-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-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  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-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412

This theorem is used by:  fseq1p1m1  10501  frecfzennn  10863  zfz1isolemsplit  11290  fsumm1  12183  fprodm1  12365  gsump1  14157