ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uz11 Unicode version

Theorem uz11 9564
Description: The upper integers function is one-to-one. (Contributed by NM, 12-Dec-2005.)
Assertion
Ref Expression
uz11  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  <->  M  =  N
) )

Proof of Theorem uz11
StepHypRef Expression
1 uzid 9556 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
2 eleq2 2251 . . . . . 6  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  <->  M  e.  ( ZZ>= `  N )
) )
3 eluzel2 9547 . . . . . 6  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  e.  ZZ )
42, 3biimtrdi 163 . . . . 5  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  ->  N  e.  ZZ )
)
51, 4mpan9 281 . . . 4  |-  ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  ->  N  e.  ZZ )
6 uzid 9556 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  N )
)
7 eleq2 2251 . . . . . . . . . . 11  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  (
ZZ>= `  M )  <->  N  e.  ( ZZ>= `  N )
) )
86, 7imbitrrid 156 . . . . . . . . . 10  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  M ) ) )
9 eluzle 9554 . . . . . . . . . 10  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  <_  N )
108, 9syl6 33 . . . . . . . . 9  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  ZZ  ->  M  <_  N )
)
111, 2imbitrid 154 . . . . . . . . . 10  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  N ) ) )
12 eluzle 9554 . . . . . . . . . 10  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  <_  M )
1311, 12syl6 33 . . . . . . . . 9  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  ZZ  ->  N  <_  M )
)
1410, 13anim12d 335 . . . . . . . 8  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( ( N  e.  ZZ  /\  M  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) ) )
1514impl 380 . . . . . . 7  |-  ( ( ( ( ZZ>= `  M
)  =  ( ZZ>= `  N )  /\  N  e.  ZZ )  /\  M  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) )
1615ancoms 268 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( ( ZZ>= `  M
)  =  ( ZZ>= `  N )  /\  N  e.  ZZ ) )  -> 
( M  <_  N  /\  N  <_  M ) )
1716anassrs 400 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) )
18 zre 9271 . . . . . . 7  |-  ( M  e.  ZZ  ->  M  e.  RR )
19 zre 9271 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  RR )
20 letri3 8052 . . . . . . 7  |-  ( ( M  e.  RR  /\  N  e.  RR )  ->  ( M  =  N  <-> 
( M  <_  N  /\  N  <_  M ) ) )
2118, 19, 20syl2an 289 . . . . . 6  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  =  N  <-> 
( M  <_  N  /\  N  <_  M ) ) )
2221adantlr 477 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  ( M  =  N  <->  ( M  <_  N  /\  N  <_  M ) ) )
2317, 22mpbird 167 . . . 4  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  M  =  N )
245, 23mpdan 421 . . 3  |-  ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  ->  M  =  N )
2524ex 115 . 2  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  ->  M  =  N ) )
26 fveq2 5527 . 2  |-  ( M  =  N  ->  ( ZZ>=
`  M )  =  ( ZZ>= `  N )
)
2725, 26impbid1 142 1  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  <->  M  =  N
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1363    e. wcel 2158   class class class wbr 4015   ` cfv 5228   RRcr 7824    <_ cle 8007   ZZcz 9267   ZZ>=cuz 9542
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-pre-ltirr 7937  ax-pre-apti 7940
This theorem depends on definitions:  df-bi 117  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-sbc 2975  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-ov 5891  df-pnf 8008  df-mnf 8009  df-xr 8010  df-ltxr 8011  df-le 8012  df-neg 8145  df-z 9268  df-uz 9543
This theorem is referenced by:  fzopth  10075
  Copyright terms: Public domain W3C validator