Theorem fzofzim 10554

Description: If a nonnegative integer in a finite interval of integers is not the upper bound of the interval, it is contained in the corresponding half-open integer range. (Contributed by Alexander van der Vekens, 15-Jun-2018.)

Assertion

Ref	Expression
fzofzim	|- ( ( K =/= M /\ K e. ( 0 ... M ) ) -> K e. ( 0..^ M ) )

Proof of Theorem fzofzim

Step	Hyp	Ref	Expression
1		elfz2nn0 10473	. . . 4 |- ( K e. ( 0 ... M ) <-> ( K e. NN0 /\ M e. NN0 /\ K <_ M ) )
2		simpl1 1027	. . . . . 6 |- ( ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) /\ K =/= M ) -> K e. NN0 )
3		necom 2498	. . . . . . . . 9 |- ( K =/= M <-> M =/= K )
4		nn0z 9619	. . . . . . . . . . . . 13 |- ( K e. NN0 -> K e. ZZ )
5		nn0z 9619	. . . . . . . . . . . . 13 |- ( M e. NN0 -> M e. ZZ )
6		zltlen 9679	. . . . . . . . . . . . 13 |- ( ( K e. ZZ /\ M e. ZZ ) -> ( K < M <-> ( K <_ M /\ M =/= K ) ) )
7	4, 5, 6	syl2an 289	. . . . . . . . . . . 12 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( K < M <-> ( K <_ M /\ M =/= K ) ) )
8	7	bicomd 141	. . . . . . . . . . 11 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( ( K <_ M /\ M =/= K ) <-> K < M ) )
9		elnn0z 9612	. . . . . . . . . . . . 13 |- ( K e. NN0 <-> ( K e. ZZ /\ 0 <_ K ) )
10		0red 8293	. . . . . . . . . . . . . . . . 17 |- ( ( K e. ZZ /\ M e. NN0 ) -> 0 e. RR )
11		zre 9603	. . . . . . . . . . . . . . . . . 18 |- ( K e. ZZ -> K e. RR )
12	11	adantr 276	. . . . . . . . . . . . . . . . 17 |- ( ( K e. ZZ /\ M e. NN0 ) -> K e. RR )
13		nn0re 9527	. . . . . . . . . . . . . . . . . 18 |- ( M e. NN0 -> M e. RR )
14	13	adantl 277	. . . . . . . . . . . . . . . . 17 |- ( ( K e. ZZ /\ M e. NN0 ) -> M e. RR )
15		lelttr 8380	. . . . . . . . . . . . . . . . 17 |- ( ( 0 e. RR /\ K e. RR /\ M e. RR ) -> ( ( 0 <_ K /\ K < M ) -> 0 < M ) )
16	10, 12, 14, 15	syl3anc 1274	. . . . . . . . . . . . . . . 16 |- ( ( K e. ZZ /\ M e. NN0 ) -> ( ( 0 <_ K /\ K < M ) -> 0 < M ) )
17		elnnz 9609	. . . . . . . . . . . . . . . . . . 19 |- ( M e. NN <-> ( M e. ZZ /\ 0 < M ) )
18	17	simplbi2 385	. . . . . . . . . . . . . . . . . 18 |- ( M e. ZZ -> ( 0 < M -> M e. NN ) )
19	5, 18	syl 14	. . . . . . . . . . . . . . . . 17 |- ( M e. NN0 -> ( 0 < M -> M e. NN ) )
20	19	adantl 277	. . . . . . . . . . . . . . . 16 |- ( ( K e. ZZ /\ M e. NN0 ) -> ( 0 < M -> M e. NN ) )
21	16, 20	syld 45	. . . . . . . . . . . . . . 15 |- ( ( K e. ZZ /\ M e. NN0 ) -> ( ( 0 <_ K /\ K < M ) -> M e. NN ) )
22	21	expd 258	. . . . . . . . . . . . . 14 |- ( ( K e. ZZ /\ M e. NN0 ) -> ( 0 <_ K -> ( K < M -> M e. NN ) ) )
23	22	impancom 260	. . . . . . . . . . . . 13 |- ( ( K e. ZZ /\ 0 <_ K ) -> ( M e. NN0 -> ( K < M -> M e. NN ) ) )
24	9, 23	sylbi 121	. . . . . . . . . . . 12 |- ( K e. NN0 -> ( M e. NN0 -> ( K < M -> M e. NN ) ) )
25	24	imp 124	. . . . . . . . . . 11 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( K < M -> M e. NN ) )
26	8, 25	sylbid 150	. . . . . . . . . 10 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( ( K <_ M /\ M =/= K ) -> M e. NN ) )
27	26	expd 258	. . . . . . . . 9 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( K <_ M -> ( M =/= K -> M e. NN ) ) )
28	3, 27	syl7bi 165	. . . . . . . 8 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( K <_ M -> ( K =/= M -> M e. NN ) ) )
29	28	3impia 1227	. . . . . . 7 |- ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) -> ( K =/= M -> M e. NN ) )
30	29	imp 124	. . . . . 6 |- ( ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) /\ K =/= M ) -> M e. NN )
31	8	biimpd 144	. . . . . . . . . 10 |- ( ( K e. NN0 /\ M e. NN0 ) -> ( ( K <_ M /\ M =/= K ) -> K < M ) )
32	31	exp4b 367	. . . . . . . . 9 |- ( K e. NN0 -> ( M e. NN0 -> ( K <_ M -> ( M =/= K -> K < M ) ) ) )
33	32	3imp 1220	. . . . . . . 8 |- ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) -> ( M =/= K -> K < M ) )
34	3, 33	biimtrid 152	. . . . . . 7 |- ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) -> ( K =/= M -> K < M ) )
35	34	imp 124	. . . . . 6 |- ( ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) /\ K =/= M ) -> K < M )
36	2, 30, 35	3jca 1204	. . . . 5 |- ( ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) /\ K =/= M ) -> ( K e. NN0 /\ M e. NN /\ K < M ) )
37	36	ex 115	. . . 4 |- ( ( K e. NN0 /\ M e. NN0 /\ K <_ M ) -> ( K =/= M -> ( K e. NN0 /\ M e. NN /\ K < M ) ) )
38	1, 37	sylbi 121	. . 3 |- ( K e. ( 0 ... M ) -> ( K =/= M -> ( K e. NN0 /\ M e. NN /\ K < M ) ) )
39	38	impcom 125	. 2 |- ( ( K =/= M /\ K e. ( 0 ... M ) ) -> ( K e. NN0 /\ M e. NN /\ K < M ) )
40		elfzo0 10547	. 2 |- ( K e. ( 0..^ M ) <-> ( K e. NN0 /\ M e. NN /\ K < M ) )
41	39, 40	sylibr 134	1 |- ( ( K =/= M /\ K e. ( 0 ... M ) ) -> K e. ( 0..^ M ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   e. wcel 2205   =/= wne 2414   class class class wbr 4115  (class class class)co 6060   RRcr 8144   0cc0 8145   < clt 8326   <_ cle 8327   NNcn 9259   NN0cn0 9518   ZZcz 9599   ...cfz 10366  ..^cfzo 10503

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-mulrcl 8244  ax-addcom 8245  ax-mulcom 8246  ax-addass 8247  ax-mulass 8248  ax-distr 8249  ax-i2m1 8250  ax-0lt1 8251  ax-1rid 8252  ax-0id 8253  ax-rnegex 8254  ax-precex 8255  ax-cnre 8256  ax-pre-ltirr 8257  ax-pre-ltwlin 8258  ax-pre-lttrn 8259  ax-pre-apti 8260  ax-pre-ltadd 8261  ax-pre-mulgt0 8262

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-1st 6349  df-2nd 6350  df-pnf 8328  df-mnf 8329  df-xr 8330  df-ltxr 8331  df-le 8332  df-sub 8465  df-neg 8466  df-reap 8869  df-ap 8876  df-inn 9260  df-n0 9519  df-z 9600  df-uz 9877  df-fz 10367  df-fzo 10504

This theorem is referenced by: (None)