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

Theorem addlsub 8548
Description: Left-subtraction: Subtraction of the left summand from the result of an addition. (Contributed by BJ, 6-Jun-2019.)
Hypotheses
Ref Expression
addlsub.a  |-  ( ph  ->  A  e.  CC )
addlsub.b  |-  ( ph  ->  B  e.  CC )
addlsub.c  |-  ( ph  ->  C  e.  CC )
Assertion
Ref Expression
addlsub  |-  ( ph  ->  ( ( A  +  B )  =  C  <-> 
A  =  ( C  -  B ) ) )

Proof of Theorem addlsub
StepHypRef Expression
1 oveq1 6024 . . 3  |-  ( ( A  +  B )  =  C  ->  (
( A  +  B
)  -  B )  =  ( C  -  B ) )
2 addlsub.a . . . . 5  |-  ( ph  ->  A  e.  CC )
3 addlsub.b . . . . 5  |-  ( ph  ->  B  e.  CC )
42, 3pncand 8490 . . . 4  |-  ( ph  ->  ( ( A  +  B )  -  B
)  =  A )
5 eqtr2 2250 . . . . . 6  |-  ( ( ( ( A  +  B )  -  B
)  =  ( C  -  B )  /\  ( ( A  +  B )  -  B
)  =  A )  ->  ( C  -  B )  =  A )
65eqcomd 2237 . . . . 5  |-  ( ( ( ( A  +  B )  -  B
)  =  ( C  -  B )  /\  ( ( A  +  B )  -  B
)  =  A )  ->  A  =  ( C  -  B ) )
76a1i 9 . . . 4  |-  ( ph  ->  ( ( ( ( A  +  B )  -  B )  =  ( C  -  B
)  /\  ( ( A  +  B )  -  B )  =  A )  ->  A  =  ( C  -  B
) ) )
84, 7mpan2d 428 . . 3  |-  ( ph  ->  ( ( ( A  +  B )  -  B )  =  ( C  -  B )  ->  A  =  ( C  -  B ) ) )
91, 8syl5 32 . 2  |-  ( ph  ->  ( ( A  +  B )  =  C  ->  A  =  ( C  -  B ) ) )
10 oveq1 6024 . . 3  |-  ( A  =  ( C  -  B )  ->  ( A  +  B )  =  ( ( C  -  B )  +  B ) )
11 addlsub.c . . . . 5  |-  ( ph  ->  C  e.  CC )
1211, 3npcand 8493 . . . 4  |-  ( ph  ->  ( ( C  -  B )  +  B
)  =  C )
13 eqtr 2249 . . . . 5  |-  ( ( ( A  +  B
)  =  ( ( C  -  B )  +  B )  /\  ( ( C  -  B )  +  B
)  =  C )  ->  ( A  +  B )  =  C )
1413a1i 9 . . . 4  |-  ( ph  ->  ( ( ( A  +  B )  =  ( ( C  -  B )  +  B
)  /\  ( ( C  -  B )  +  B )  =  C )  ->  ( A  +  B )  =  C ) )
1512, 14mpan2d 428 . . 3  |-  ( ph  ->  ( ( A  +  B )  =  ( ( C  -  B
)  +  B )  ->  ( A  +  B )  =  C ) )
1610, 15syl5 32 . 2  |-  ( ph  ->  ( A  =  ( C  -  B )  ->  ( A  +  B )  =  C ) )
179, 16impbid 129 1  |-  ( ph  ->  ( ( A  +  B )  =  C  <-> 
A  =  ( C  -  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202  (class class class)co 6017   CCcc 8029    + caddc 8034    - cmin 8349
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635  ax-resscn 8123  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-sub 8351
This theorem is referenced by:  addrsub  8549  subexsub  8550  nn0ob  12468  oddennn  13012
  Copyright terms: Public domain W3C validator