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

Theorem subadd 8536
Description: Relationship between subtraction and addition. (Contributed by NM, 20-Jan-1997.) (Revised by Mario Carneiro, 21-Dec-2013.)
Assertion
Ref Expression
subadd  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  -  B
)  =  C  <->  ( B  +  C )  =  A ) )

Proof of Theorem subadd
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 subval 8525 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  B
)  =  ( iota_ x  e.  CC  ( B  +  x )  =  A ) )
21eqeq1d 2247 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  -  B )  =  C  <-> 
( iota_ x  e.  CC  ( B  +  x
)  =  A )  =  C ) )
323adant3 1048 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  -  B
)  =  C  <->  ( iota_ x  e.  CC  ( B  +  x )  =  A )  =  C ) )
4 negeu 8524 . . . . 5  |-  ( ( B  e.  CC  /\  A  e.  CC )  ->  E! x  e.  CC  ( B  +  x
)  =  A )
5 oveq2 6096 . . . . . . 7  |-  ( x  =  C  ->  ( B  +  x )  =  ( B  +  C ) )
65eqeq1d 2247 . . . . . 6  |-  ( x  =  C  ->  (
( B  +  x
)  =  A  <->  ( B  +  C )  =  A ) )
76riota2 6065 . . . . 5  |-  ( ( C  e.  CC  /\  E! x  e.  CC  ( B  +  x
)  =  A )  ->  ( ( B  +  C )  =  A  <->  ( iota_ x  e.  CC  ( B  +  x )  =  A )  =  C ) )
84, 7sylan2 286 . . . 4  |-  ( ( C  e.  CC  /\  ( B  e.  CC  /\  A  e.  CC ) )  ->  ( ( B  +  C )  =  A  <->  ( iota_ x  e.  CC  ( B  +  x )  =  A )  =  C ) )
983impb 1230 . . 3  |-  ( ( C  e.  CC  /\  B  e.  CC  /\  A  e.  CC )  ->  (
( B  +  C
)  =  A  <->  ( iota_ x  e.  CC  ( B  +  x )  =  A )  =  C ) )
1093com13 1239 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( B  +  C
)  =  A  <->  ( iota_ x  e.  CC  ( B  +  x )  =  A )  =  C ) )
113, 10bitr4d 191 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  -  B
)  =  C  <->  ( B  +  C )  =  A ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   E!wreu 2530   iota_crio 6040  (class class class)co 6088   CCcc 8183    + caddc 8188    - cmin 8504
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
This theorem is used by:  subadd2  8537  subsub23  8538  pncan  8539  pncan3  8541  addsubeq4  8548  subsub2  8561  renegcl  8594  subaddi  8620  subaddd  8662  fzen  10464  nn0ennn  10891  cos2t  12542  cos2tsin  12543  odd2np1  12665  divalgb  12717  sincosq1eq  16066  coskpi  16075
  Copyright terms: Public domain W3C validator