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

Theorem neg11 8577
Description: Negative is one-to-one. (Contributed by NM, 8-Feb-2005.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
neg11  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( -u A  = 
-u B  <->  A  =  B ) )

Proof of Theorem neg11
StepHypRef Expression
1 negeq 8519 . . 3  |-  ( -u A  =  -u B  ->  -u -u A  =  -u -u B
)
2 negneg 8576 . . . 4  |-  ( A  e.  CC  ->  -u -u A  =  A )
3 negneg 8576 . . . 4  |-  ( B  e.  CC  ->  -u -u B  =  B )
42, 3eqeqan12d 2254 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( -u -u A  =  -u -u B  <->  A  =  B ) )
51, 4imbitrid 154 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( -u A  = 
-u B  ->  A  =  B ) )
6 negeq 8519 . 2  |-  ( A  =  B  ->  -u A  =  -u B )
75, 6impbid1 142 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( -u A  = 
-u B  <->  A  =  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   CCcc 8177   -ucneg 8498
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-neg 8500
This theorem is used by:  negcon1  8578  negeq0  8580  neg11i  8607  neg11ad  8633  subeqrev  8702
  Copyright terms: Public domain W3C validator