Theorem elfzp1b 10325

Description: An integer is a member of a 0-based finite set of sequential integers iff its successor is a member of the corresponding 1-based set. (Contributed by Paul Chapman, 22-Jun-2011.)

Assertion

Ref	Expression
elfzp1b	|- ( ( K e. ZZ /\ N e. ZZ ) -> ( K e. ( 0 ... ( N - 1 ) ) <-> ( K + 1 ) e. ( 1 ... N ) ) )

Proof of Theorem elfzp1b

Step	Hyp	Ref	Expression
1		peano2z 9508	. . . 4 |- ( K e. ZZ -> ( K + 1 ) e. ZZ )
2		1z 9498	. . . . 5 |- 1 e. ZZ
3		fzsubel 10288	. . . . . 6 |- ( ( ( 1 e. ZZ /\ N e. ZZ ) /\ ( ( K + 1 ) e. ZZ /\ 1 e. ZZ ) ) -> ( ( K + 1 ) e. ( 1 ... N ) <-> ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) ) )
4	2, 3	mpanl1 434	. . . . 5 |- ( ( N e. ZZ /\ ( ( K + 1 ) e. ZZ /\ 1 e. ZZ ) ) -> ( ( K + 1 ) e. ( 1 ... N ) <-> ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) ) )
5	2, 4	mpanr2 438	. . . 4 |- ( ( N e. ZZ /\ ( K + 1 ) e. ZZ ) -> ( ( K + 1 ) e. ( 1 ... N ) <-> ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) ) )
6	1, 5	sylan2 286	. . 3 |- ( ( N e. ZZ /\ K e. ZZ ) -> ( ( K + 1 ) e. ( 1 ... N ) <-> ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) ) )
7	6	ancoms 268	. 2 |- ( ( K e. ZZ /\ N e. ZZ ) -> ( ( K + 1 ) e. ( 1 ... N ) <-> ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) ) )
8		zcn 9477	. . . . 5 |- ( K e. ZZ -> K e. CC )
9		ax-1cn 8118	. . . . 5 |- 1 e. CC
10		pncan 8378	. . . . 5 |- ( ( K e. CC /\ 1 e. CC ) -> ( ( K + 1 ) - 1 ) = K )
11	8, 9, 10	sylancl 413	. . . 4 |- ( K e. ZZ -> ( ( K + 1 ) - 1 ) = K )
12		1m1e0 9205	. . . . . 6 |- ( 1 - 1 ) = 0
13	12	oveq1i 6023	. . . . 5 |- ( ( 1 - 1 ) ... ( N - 1 ) ) = ( 0 ... ( N - 1 ) )
14	13	a1i 9	. . . 4 |- ( K e. ZZ -> ( ( 1 - 1 ) ... ( N - 1 ) ) = ( 0 ... ( N - 1 ) ) )
15	11, 14	eleq12d 2300	. . 3 |- ( K e. ZZ -> ( ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) <-> K e. ( 0 ... ( N - 1 ) ) ) )
16	15	adantr 276	. 2 |- ( ( K e. ZZ /\ N e. ZZ ) -> ( ( ( K + 1 ) - 1 ) e. ( ( 1 - 1 ) ... ( N - 1 ) ) <-> K e. ( 0 ... ( N - 1 ) ) ) )
17	7, 16	bitr2d 189	1 |- ( ( K e. ZZ /\ N e. ZZ ) -> ( K e. ( 0 ... ( N - 1 ) ) <-> ( K + 1 ) e. ( 1 ... N ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1395   e. wcel 2200  (class class class)co 6013   CCcc 8023   0cc0 8025   1c1 8026   + caddc 8028   - cmin 8343   ZZcz 9472   ...cfz 10236

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-addcom 8125  ax-addass 8127  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-0id 8133  ax-rnegex 8134  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-ltadd 8141

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-inn 9137  df-n0 9396  df-z 9473  df-fz 10237

This theorem is referenced by: (None)