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

Theorem uz11 9552
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 9544 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
2 eleq2 2241 . . . . . 6  |-  ( (
ZZ>= `  M )  =  ( ZZ>= `  N )  ->  ( M  e.  (
ZZ>= `  M )  <->  M  e.  ( ZZ>= `  N )
) )
3 eluzel2 9535 . . . . . 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 9544 . . . . . . . . . . 11  |-  ( N  e.  ZZ  ->  N  e.  ( ZZ>= `  N )
)
7 eleq2 2241 . . . . . . . . . . 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 9542 . . . . . . . . . 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 9542 . . . . . . . . . 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 9259 . . . . . . 7  |-  ( M  e.  ZZ  ->  M  e.  RR )
19 zre 9259 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  RR )
20 letri3 8040 . . . . . . 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 5517 . 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 1353    e. wcel 2148   class class class wbr 4005   ` cfv 5218   RRcr 7812    <_ cle 7995   ZZcz 9255   ZZ>=cuz 9530
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-pre-ltirr 7925  ax-pre-apti 7928
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-ov 5880  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-neg 8133  df-z 9256  df-uz 9531
This theorem is referenced by:  fzopth  10063
  Copyright terms: Public domain W3C validator