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

Theorem negdii 8617
Description: Distribution of negative over addition. (Contributed by NM, 28-Jul-1999.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
Hypotheses
Ref Expression
negidi.1  |-  A  e.  CC
pncan3i.2  |-  B  e.  CC
Assertion
Ref Expression
negdii  |-  -u ( A  +  B )  =  (  -u A  +  -u B )

Proof of Theorem negdii
StepHypRef Expression
1 negidi.1 . . . . 5  |-  A  e.  CC
2 pncan3i.2 . . . . 5  |-  B  e.  CC
31, 2addcli 8336 . . . 4  |-  ( A  +  B )  e.  CC
43negidi 8602 . . 3  |-  ( ( A  +  B )  +  -u ( A  +  B ) )  =  0
51negidi 8602 . . . . 5  |-  ( A  +  -u A )  =  0
62negidi 8602 . . . . 5  |-  ( B  +  -u B )  =  0
75, 6oveq12i 6100 . . . 4  |-  ( ( A  +  -u A
)  +  ( B  +  -u B ) )  =  ( 0  +  0 )
8 00id 8474 . . . 4  |-  ( 0  +  0 )  =  0
97, 8eqtri 2259 . . 3  |-  ( ( A  +  -u A
)  +  ( B  +  -u B ) )  =  0
101negcli 8601 . . . 4  |-  -u A  e.  CC
112negcli 8601 . . . 4  |-  -u B  e.  CC
121, 10, 2, 11add4i 8498 . . 3  |-  ( ( A  +  -u A
)  +  ( B  +  -u B ) )  =  ( ( A  +  B )  +  (  -u A  +  -u B ) )
134, 9, 123eqtr2i 2265 . 2  |-  ( ( A  +  B )  +  -u ( A  +  B ) )  =  ( ( A  +  B )  +  ( 
-u A  +  -u B ) )
143negcli 8601 . . 3  |-  -u ( A  +  B )  e.  CC
1510, 11addcli 8336 . . 3  |-  (  -u A  +  -u B )  e.  CC
163, 14, 15addcani 8515 . 2  |-  ( ( ( A  +  B
)  +  -u ( A  +  B )
)  =  ( ( A  +  B )  +  (  -u A  +  -u B ) )  <->  -u ( A  +  B
)  =  (  -u A  +  -u B ) )
1713, 16mpbi 145 1  |-  -u ( A  +  B )  =  (  -u A  +  -u B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209  (class class class)co 6088   CCcc 8183   0cc0 8185    + caddc 8188    -ucneg 8505
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 4251  ax-pow 4313  ax-pr 4348  ax-setind 4686  ax-resscn 8277  ax-1cn 8278  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296
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 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-sub 8506  df-neg 8507
This theorem is used by:  negsubdii  8618
  Copyright terms: Public domain W3C validator