Theorem fznlem 10445

Description: A finite set of sequential integers is empty if the bounds are reversed. (Contributed by Jim Kingdon, 16-Apr-2020.)

Assertion

Ref	Expression
fznlem	|- ( ( M e. ZZ /\ N e. ZZ ) -> ( N < M -> ( M ... N ) = (/) ) )

Proof of Theorem fznlem

Dummy variable k is distinct from all other variables.

Step	Hyp	Ref	Expression
1		zre 9648	. . . . . . . . . . 11 |- ( M e. ZZ -> M e. RR )
2		zre 9648	. . . . . . . . . . 11 |- ( N e. ZZ -> N e. RR )
3		lenlt 8401	. . . . . . . . . . 11 |- ( ( M e. RR /\ N e. RR ) -> ( M <_ N <-> -. N < M ) )
4	1, 2, 3	syl2an 289	. . . . . . . . . 10 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M <_ N <-> -. N < M ) )
5	4	biimpd 144	. . . . . . . . 9 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M <_ N -> -. N < M ) )
6	5	con2d 633	. . . . . . . 8 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( N < M -> -. M <_ N ) )
7	6	imp 124	. . . . . . 7 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) -> -. M <_ N )
8	7	adantr 276	. . . . . 6 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> -. M <_ N )
9		simplll 539	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> M e. ZZ )
10	9	zred 9768	. . . . . . 7 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> M e. RR )
11		simpr 110	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> k e. ZZ )
12	11	zred 9768	. . . . . . 7 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> k e. RR )
13		simpllr 540	. . . . . . . 8 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> N e. ZZ )
14	13	zred 9768	. . . . . . 7 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> N e. RR )
15		letr 8408	. . . . . . 7 |- ( ( M e. RR /\ k e. RR /\ N e. RR ) -> ( ( M <_ k /\ k <_ N ) -> M <_ N ) )
16	10, 12, 14, 15	syl3anc 1278	. . . . . 6 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> ( ( M <_ k /\ k <_ N ) -> M <_ N ) )
17	8, 16	mtod 673	. . . . 5 |- ( ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) /\ k e. ZZ ) -> -. ( M <_ k /\ k <_ N ) )
18	17	ralrimiva 2623	. . . 4 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) -> A. k e. ZZ -. ( M <_ k /\ k <_ N ) )
19		rabeq0 3552	. . . 4 |- ( { k e. ZZ | ( M <_ k /\ k <_ N ) } = (/) <-> A. k e. ZZ -. ( M <_ k /\ k <_ N ) )
20	18, 19	sylibr 134	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) -> { k e. ZZ | ( M <_ k /\ k <_ N ) } = (/) )
21		fzval 10413	. . . . 5 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( M ... N ) = { k e. ZZ | ( M <_ k /\ k <_ N ) } )
22	21	eqeq1d 2247	. . . 4 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( ( M ... N ) = (/) <-> { k e. ZZ | ( M <_ k /\ k <_ N ) } = (/) ) )
23	22	adantr 276	. . 3 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) -> ( ( M ... N ) = (/) <-> { k e. ZZ | ( M <_ k /\ k <_ N ) } = (/) ) )
24	20, 23	mpbird 167	. 2 |- ( ( ( M e. ZZ /\ N e. ZZ ) /\ N < M ) -> ( M ... N ) = (/) )
25	24	ex 115	1 |- ( ( M e. ZZ /\ N e. ZZ ) -> ( N < M -> ( M ... N ) = (/) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   {crab 2532   (/)c0 3520   class class class wbr 4130  (class class class)co 6085   RRcr 8178   < clt 8360   <_ 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-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-pre-ltwlin 8292

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-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-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-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-neg 8500  df-z 9645  df-fz 10412

This theorem is used by:  fzn  10446