Theorem fzopth 10153

Description: A finite set of sequential integers can represent an ordered pair. (Contributed by NM, 31-Oct-2005.) (Revised by Mario Carneiro, 28-Apr-2015.)

Assertion

Ref	Expression
fzopth	|- ( N e. ( ZZ>= ` M ) -> ( ( M ... N ) = ( J ... K ) <-> ( M = J /\ N = K ) ) )

Proof of Theorem fzopth

Step	Hyp	Ref	Expression
1		eluzfz1 10123	. . . . . . . . 9 |- ( N e. ( ZZ>= ` M ) -> M e. ( M ... N ) )
2	1	adantr 276	. . . . . . . 8 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> M e. ( M ... N ) )
3		simpr 110	. . . . . . . 8 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( M ... N ) = ( J ... K ) )
4	2, 3	eleqtrd 2275	. . . . . . 7 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> M e. ( J ... K ) )
5		elfzuz 10113	. . . . . . 7 |- ( M e. ( J ... K ) -> M e. ( ZZ>= ` J ) )
6		uzss 9639	. . . . . . 7 |- ( M e. ( ZZ>= ` J ) -> ( ZZ>= ` M ) C_ ( ZZ>= ` J ) )
7	4, 5, 6	3syl 17	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` M ) C_ ( ZZ>= ` J ) )
8		elfzuz2 10121	. . . . . . . . 9 |- ( M e. ( J ... K ) -> K e. ( ZZ>= ` J ) )
9		eluzfz1 10123	. . . . . . . . 9 |- ( K e. ( ZZ>= ` J ) -> J e. ( J ... K ) )
10	4, 8, 9	3syl 17	. . . . . . . 8 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> J e. ( J ... K ) )
11	10, 3	eleqtrrd 2276	. . . . . . 7 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> J e. ( M ... N ) )
12		elfzuz 10113	. . . . . . 7 |- ( J e. ( M ... N ) -> J e. ( ZZ>= ` M ) )
13		uzss 9639	. . . . . . 7 |- ( J e. ( ZZ>= ` M ) -> ( ZZ>= ` J ) C_ ( ZZ>= ` M ) )
14	11, 12, 13	3syl 17	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` J ) C_ ( ZZ>= ` M ) )
15	7, 14	eqssd 3201	. . . . 5 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` M ) = ( ZZ>= ` J ) )
16		eluzel2 9623	. . . . . . 7 |- ( N e. ( ZZ>= ` M ) -> M e. ZZ )
17	16	adantr 276	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> M e. ZZ )
18		uz11 9641	. . . . . 6 |- ( M e. ZZ -> ( ( ZZ>= ` M ) = ( ZZ>= ` J ) <-> M = J ) )
19	17, 18	syl 14	. . . . 5 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ( ZZ>= ` M ) = ( ZZ>= ` J ) <-> M = J ) )
20	15, 19	mpbid 147	. . . 4 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> M = J )
21		eluzfz2 10124	. . . . . . . . 9 |- ( K e. ( ZZ>= ` J ) -> K e. ( J ... K ) )
22	4, 8, 21	3syl 17	. . . . . . . 8 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> K e. ( J ... K ) )
23	22, 3	eleqtrrd 2276	. . . . . . 7 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> K e. ( M ... N ) )
24		elfzuz3 10114	. . . . . . 7 |- ( K e. ( M ... N ) -> N e. ( ZZ>= ` K ) )
25		uzss 9639	. . . . . . 7 |- ( N e. ( ZZ>= ` K ) -> ( ZZ>= ` N ) C_ ( ZZ>= ` K ) )
26	23, 24, 25	3syl 17	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` N ) C_ ( ZZ>= ` K ) )
27		eluzfz2 10124	. . . . . . . . 9 |- ( N e. ( ZZ>= ` M ) -> N e. ( M ... N ) )
28	27	adantr 276	. . . . . . . 8 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> N e. ( M ... N ) )
29	28, 3	eleqtrd 2275	. . . . . . 7 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> N e. ( J ... K ) )
30		elfzuz3 10114	. . . . . . 7 |- ( N e. ( J ... K ) -> K e. ( ZZ>= ` N ) )
31		uzss 9639	. . . . . . 7 |- ( K e. ( ZZ>= ` N ) -> ( ZZ>= ` K ) C_ ( ZZ>= ` N ) )
32	29, 30, 31	3syl 17	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` K ) C_ ( ZZ>= ` N ) )
33	26, 32	eqssd 3201	. . . . 5 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ZZ>= ` N ) = ( ZZ>= ` K ) )
34		eluzelz 9627	. . . . . . 7 |- ( N e. ( ZZ>= ` M ) -> N e. ZZ )
35	34	adantr 276	. . . . . 6 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> N e. ZZ )
36		uz11 9641	. . . . . 6 |- ( N e. ZZ -> ( ( ZZ>= ` N ) = ( ZZ>= ` K ) <-> N = K ) )
37	35, 36	syl 14	. . . . 5 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( ( ZZ>= ` N ) = ( ZZ>= ` K ) <-> N = K ) )
38	33, 37	mpbid 147	. . . 4 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> N = K )
39	20, 38	jca 306	. . 3 |- ( ( N e. ( ZZ>= ` M ) /\ ( M ... N ) = ( J ... K ) ) -> ( M = J /\ N = K ) )
40	39	ex 115	. 2 |- ( N e. ( ZZ>= ` M ) -> ( ( M ... N ) = ( J ... K ) -> ( M = J /\ N = K ) ) )
41		oveq12 5934	. 2 |- ( ( M = J /\ N = K ) -> ( M ... N ) = ( J ... K ) )
42	40, 41	impbid1 142	1 |- ( N e. ( ZZ>= ` M ) -> ( ( M ... N ) = ( J ... K ) <-> ( M = J /\ N = K ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2167   C_ wss 3157   ` cfv 5259  (class class class)co 5925   ZZcz 9343   ZZ>=cuz 9618   ...cfz 10100

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-apti 8011

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-neg 8217  df-z 9344  df-uz 9619  df-fz 10101

This theorem is referenced by:  fz0to4untppr  10216  2ffzeq  10233  gsumfzval  13093  gsumval2  13099