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

Theorem uz11 9372
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 9364 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
2 eleq2 2204 . . . . . 6  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  <->  M  e.  ( ZZ>= `  N )
) )
3 eluzel2 9355 . . . . . 6  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  e.  ZZ )
42, 3syl6bi 162 . . . . 5  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  ->  N  e.  ZZ )
)
51, 4mpan9 279 . . . 4  |-  ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  ->  N  e.  ZZ )
6 uzid 9364 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  N )
)
7 eleq2 2204 . . . . . . . . . . 11  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  (
ZZ>= `  M )  <->  N  e.  ( ZZ>= `  N )
) )
86, 7syl5ibr 155 . . . . . . . . . 10  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  M ) ) )
9 eluzle 9362 . . . . . . . . . 10  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  <_  N )
108, 9syl6 33 . . . . . . . . 9  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( N  e.  ZZ  ->  M  <_  N )
)
111, 2syl5ib 153 . . . . . . . . . 10  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  N ) ) )
12 eluzle 9362 . . . . . . . . . 10  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  <_  M )
1311, 12syl6 33 . . . . . . . . 9  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  ZZ  ->  N  <_  M )
)
1410, 13anim12d 333 . . . . . . . 8  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( ( N  e.  ZZ  /\  M  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) ) )
1514impl 378 . . . . . . 7  |-  ( ( ( ( ZZ>= `  M
)  =  ( ZZ>= `  N )  /\  N  e.  ZZ )  /\  M  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) )
1615ancoms 266 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( ( ZZ>= `  M
)  =  ( ZZ>= `  N )  /\  N  e.  ZZ ) )  -> 
( M  <_  N  /\  N  <_  M ) )
1716anassrs 398 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) )
18 zre 9082 . . . . . . 7  |-  ( M  e.  ZZ  ->  M  e.  RR )
19 zre 9082 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  RR )
20 letri3 7869 . . . . . . 7  |-  ( ( M  e.  RR  /\  N  e.  RR )  ->  ( M  =  N  <-> 
( M  <_  N  /\  N  <_  M ) ) )
2118, 19, 20syl2an 287 . . . . . 6  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  =  N  <-> 
( M  <_  N  /\  N  <_  M ) ) )
2221adantlr 469 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  ( M  =  N  <->  ( M  <_  N  /\  N  <_  M ) ) )
2317, 22mpbird 166 . . . 4  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  M  =  N )
245, 23mpdan 418 . . 3  |-  ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  ->  M  =  N )
2524ex 114 . 2  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  ->  M  =  N ) )
26 fveq2 5429 . 2  |-  ( M  =  N  ->  ( ZZ>=
`  M )  =  ( ZZ>= `  N )
)
2725, 26impbid1 141 1  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  <->  M  =  N
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1332    e. wcel 1481   class class class wbr 3937   ` cfv 5131   RRcr 7643    <_ cle 7825   ZZcz 9078   ZZ>=cuz 9350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-pre-ltirr 7756  ax-pre-apti 7759
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fv 5139  df-ov 5785  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-neg 7960  df-z 9079  df-uz 9351
This theorem is referenced by:  fzopth  9872
  Copyright terms: Public domain W3C validator