Theorem fzval 10413

Description: The value of a finite set of sequential integers. E.g., 2 ... 5 means the set { 2 , 3 , 4 , 5 }. A special case of this definition (starting at 1) appears as Definition 11-2.1 of [Gleason] p. 141, where NN_k means our 1 ... k; he calls these sets segments of the integers. (Contributed by NM, 6-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)

Assertion

Ref	Expression
fzval	|- ( ( M e. ZZ /\ N e. ZZ ) -> ( M ... N ) = { k e. ZZ | ( M <_ k /\ k <_ N ) } )

Distinct variable groups:   k, M   k, N

Proof of Theorem fzval

Dummy variables m n are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 4133	. . . 4 |- ( m = M -> ( m <_ k <-> M <_ k ) )
2	1	anbi1d 469	. . 3 |- ( m = M -> ( ( m <_ k /\ k <_ n ) <-> ( M <_ k /\ k <_ n ) ) )
3	2	rabbidv 2810	. 2 |- ( m = M -> { k e. ZZ | ( m <_ k /\ k <_ n ) } = { k e. ZZ | ( M <_ k /\ k <_ n ) } )
4		breq2 4134	. . . 4 |- ( n = N -> ( k <_ n <-> k <_ N ) )
5	4	anbi2d 468	. . 3 |- ( n = N -> ( ( M <_ k /\ k <_ n ) <-> ( M <_ k /\ k <_ N ) ) )
6	5	rabbidv 2810	. 2 |- ( n = N -> { k e. ZZ | ( M <_ k /\ k <_ n ) } = { k e. ZZ | ( M <_ k /\ k <_ N ) } )
7		df-fz 10412	. 2 |- ... = ( m e. ZZ , n e. ZZ |-> { k e. ZZ | ( m <_ k /\ k <_ n ) } )
8		zex 9653	. . 3 |- ZZ e. _V
9	8	rabex 4280	. 2 |- { k e. ZZ | ( M <_ k /\ k <_ N ) } e. _V
10	3, 6, 7, 9	ovmpo 6224	1 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M ... N ) = { k e. ZZ | ( M <_ k /\ k <_ N ) } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {crab 2532   class class class wbr 4130  (class class class)co 6085   <_ cle 8361   ZZcz 9644   ...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-setind 4684  ax-cnex 8270  ax-resscn 8271

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-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  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-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-neg 8500  df-z 9645  df-fz 10412

This theorem is used by:  fzval2  10414  elfz1  10416  fznlem  10445