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

Theorem uz11 9924
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 9915 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
2 eleq2 2302 . . . . . 6  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  <->  M  e.  ( ZZ>= `  N )
) )
3 eluzel2 9905 . . . . . 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 9915 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  N )
)
7 eleq2 2302 . . . . . . . . . . 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 9913 . . . . . . . . . 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 9913 . . . . . . . . . 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 404 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  /\  N  e.  ZZ )  ->  ( M  <_  N  /\  N  <_  M ) )
18 zre 9627 . . . . . . 7  |-  ( M  e.  ZZ  ->  M  e.  RR )
19 zre 9627 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  RR )
20 letri3 8396 . . . . . . 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 481 . . . . 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 425 . . 3  |-  ( ( M  e.  ZZ  /\  ( ZZ>= `  M )  =  ( ZZ>= `  N
) )  ->  M  =  N )
2524ex 115 . 2  |-  ( M  e.  ZZ  ->  (
( ZZ>= `  M )  =  ( ZZ>= `  N
)  ->  M  =  N ) )
26 fveq2 5690 . 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 1402    e. wcel 2209   class class class wbr 4125   ` cfv 5372   RRcr 8168    <_ cle 8351   ZZcz 9623   ZZ>=cuz 9900
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-pre-ltirr 8281  ax-pre-apti 8284
This theorem 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-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-neg 8490  df-z 9624  df-uz 9901
This theorem is referenced by:  fzopth  10445
  Copyright terms: Public domain W3C validator